/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:16:41,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:16:41,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:16:41,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:16:41,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:16:41,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:16:41,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:16:41,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:16:41,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:16:41,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:16:41,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:16:41,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:16:41,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:16:41,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:16:41,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:16:41,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:16:41,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:16:41,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:16:41,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:16:41,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:16:41,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:16:41,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:16:41,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:16:41,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:16:41,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:16:41,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:16:41,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:16:41,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:16:41,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:16:41,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:16:41,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:16:41,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:16:41,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:16:41,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:16:41,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:16:41,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:16:41,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:16:41,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:16:41,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:16:41,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:16:41,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:16:41,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:16:41,355 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:16:41,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:16:41,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:16:41,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:16:41,357 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:16:41,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:16:41,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:16:41,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:16:41,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:16:41,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:16:41,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:16:41,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:16:41,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:16:41,359 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:16:41,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:16:41,359 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:16:41,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:16:41,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:16:41,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:16:41,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:16:41,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:16:41,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:16:41,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:16:41,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:16:41,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:16:41,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:16:41,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:16:41,361 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:16:41,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:16:41,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:16:41,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:16:41,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:16:41,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:16:41,659 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:16:41,659 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:16:41,660 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2019-12-27 06:16:41,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1cfa963b/2938b255f8914bd396bc6bffd88796a4/FLAGb6ebcff78 [2019-12-27 06:16:42,317 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:16:42,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2019-12-27 06:16:42,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1cfa963b/2938b255f8914bd396bc6bffd88796a4/FLAGb6ebcff78 [2019-12-27 06:16:42,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1cfa963b/2938b255f8914bd396bc6bffd88796a4 [2019-12-27 06:16:42,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:16:42,582 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:16:42,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:16:42,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:16:42,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:16:42,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:16:42" (1/1) ... [2019-12-27 06:16:42,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7215fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:42, skipping insertion in model container [2019-12-27 06:16:42,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:16:42" (1/1) ... [2019-12-27 06:16:42,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:16:42,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:16:43,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:16:43,167 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:16:43,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:16:43,304 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:16:43,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43 WrapperNode [2019-12-27 06:16:43,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:16:43,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:16:43,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:16:43,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:16:43,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (1/1) ... [2019-12-27 06:16:43,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (1/1) ... [2019-12-27 06:16:43,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:16:43,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:16:43,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:16:43,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:16:43,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (1/1) ... [2019-12-27 06:16:43,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (1/1) ... [2019-12-27 06:16:43,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (1/1) ... [2019-12-27 06:16:43,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (1/1) ... [2019-12-27 06:16:43,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (1/1) ... [2019-12-27 06:16:43,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (1/1) ... [2019-12-27 06:16:43,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (1/1) ... [2019-12-27 06:16:43,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:16:43,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:16:43,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:16:43,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:16:43,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:16:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:16:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:16:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:16:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:16:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:16:43,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:16:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:16:43,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:16:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:16:43,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:16:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:16:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:16:43,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:16:43,498 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:16:44,258 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:16:44,259 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:16:44,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:16:44 BoogieIcfgContainer [2019-12-27 06:16:44,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:16:44,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:16:44,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:16:44,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:16:44,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:16:42" (1/3) ... [2019-12-27 06:16:44,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631c1f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:16:44, skipping insertion in model container [2019-12-27 06:16:44,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:43" (2/3) ... [2019-12-27 06:16:44,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631c1f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:16:44, skipping insertion in model container [2019-12-27 06:16:44,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:16:44" (3/3) ... [2019-12-27 06:16:44,269 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_tso.oepc.i [2019-12-27 06:16:44,279 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:16:44,280 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:16:44,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:16:44,292 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:16:44,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,389 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,389 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,417 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,419 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,429 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,429 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:44,445 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:16:44,466 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:16:44,466 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:16:44,466 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:16:44,466 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:16:44,466 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:16:44,467 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:16:44,467 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:16:44,467 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:16:44,484 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 06:16:44,486 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 06:16:44,597 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 06:16:44,598 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:16:44,615 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:16:44,636 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 06:16:44,736 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 06:16:44,736 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:16:44,745 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:16:44,769 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:16:44,770 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:16:48,278 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 06:16:48,450 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 06:16:48,492 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86659 [2019-12-27 06:16:48,492 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 06:16:48,496 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 06:17:08,865 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 06:17:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 06:17:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:17:08,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:08,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:17:08,874 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:08,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash 916959, now seen corresponding path program 1 times [2019-12-27 06:17:08,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:08,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924853547] [2019-12-27 06:17:08,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:09,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924853547] [2019-12-27 06:17:09,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:09,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:17:09,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873868077] [2019-12-27 06:17:09,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:09,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:09,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:09,135 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 06:17:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:10,594 INFO L93 Difference]: Finished difference Result 123002 states and 528862 transitions. [2019-12-27 06:17:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:10,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:17:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:11,451 INFO L225 Difference]: With dead ends: 123002 [2019-12-27 06:17:11,452 INFO L226 Difference]: Without dead ends: 115358 [2019-12-27 06:17:11,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115358 states. [2019-12-27 06:17:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115358 to 115358. [2019-12-27 06:17:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115358 states. [2019-12-27 06:17:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115358 states to 115358 states and 495332 transitions. [2019-12-27 06:17:23,013 INFO L78 Accepts]: Start accepts. Automaton has 115358 states and 495332 transitions. Word has length 3 [2019-12-27 06:17:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:23,014 INFO L462 AbstractCegarLoop]: Abstraction has 115358 states and 495332 transitions. [2019-12-27 06:17:23,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 115358 states and 495332 transitions. [2019-12-27 06:17:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:17:23,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:23,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:23,018 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:23,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1587788746, now seen corresponding path program 1 times [2019-12-27 06:17:23,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:23,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572726374] [2019-12-27 06:17:23,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:23,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572726374] [2019-12-27 06:17:23,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:23,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:23,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960279207] [2019-12-27 06:17:23,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:23,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:23,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:23,164 INFO L87 Difference]: Start difference. First operand 115358 states and 495332 transitions. Second operand 4 states. [2019-12-27 06:17:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:28,736 INFO L93 Difference]: Finished difference Result 179368 states and 739568 transitions. [2019-12-27 06:17:28,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:28,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:17:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:29,368 INFO L225 Difference]: With dead ends: 179368 [2019-12-27 06:17:29,368 INFO L226 Difference]: Without dead ends: 179319 [2019-12-27 06:17:29,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179319 states. [2019-12-27 06:17:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179319 to 163842. [2019-12-27 06:17:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163842 states. [2019-12-27 06:17:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163842 states to 163842 states and 684578 transitions. [2019-12-27 06:17:44,404 INFO L78 Accepts]: Start accepts. Automaton has 163842 states and 684578 transitions. Word has length 11 [2019-12-27 06:17:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:44,404 INFO L462 AbstractCegarLoop]: Abstraction has 163842 states and 684578 transitions. [2019-12-27 06:17:44,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 163842 states and 684578 transitions. [2019-12-27 06:17:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:17:44,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:44,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:44,413 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash 245340836, now seen corresponding path program 1 times [2019-12-27 06:17:44,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:44,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331579188] [2019-12-27 06:17:44,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:44,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331579188] [2019-12-27 06:17:44,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:44,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:44,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470562706] [2019-12-27 06:17:44,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:44,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:44,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:44,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:44,498 INFO L87 Difference]: Start difference. First operand 163842 states and 684578 transitions. Second operand 3 states. [2019-12-27 06:17:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:44,635 INFO L93 Difference]: Finished difference Result 35474 states and 116324 transitions. [2019-12-27 06:17:44,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:44,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:17:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:44,754 INFO L225 Difference]: With dead ends: 35474 [2019-12-27 06:17:44,755 INFO L226 Difference]: Without dead ends: 35474 [2019-12-27 06:17:44,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2019-12-27 06:17:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 35474. [2019-12-27 06:17:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35474 states. [2019-12-27 06:17:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35474 states to 35474 states and 116324 transitions. [2019-12-27 06:17:45,587 INFO L78 Accepts]: Start accepts. Automaton has 35474 states and 116324 transitions. Word has length 13 [2019-12-27 06:17:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:45,588 INFO L462 AbstractCegarLoop]: Abstraction has 35474 states and 116324 transitions. [2019-12-27 06:17:45,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 35474 states and 116324 transitions. [2019-12-27 06:17:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:45,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:45,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:45,592 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:45,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:45,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1764199357, now seen corresponding path program 1 times [2019-12-27 06:17:45,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:45,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383913574] [2019-12-27 06:17:45,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:45,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383913574] [2019-12-27 06:17:45,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:45,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:45,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718443707] [2019-12-27 06:17:45,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:45,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:45,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:45,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:45,684 INFO L87 Difference]: Start difference. First operand 35474 states and 116324 transitions. Second operand 3 states. [2019-12-27 06:17:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:45,930 INFO L93 Difference]: Finished difference Result 53873 states and 176061 transitions. [2019-12-27 06:17:45,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:45,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 06:17:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:46,043 INFO L225 Difference]: With dead ends: 53873 [2019-12-27 06:17:46,044 INFO L226 Difference]: Without dead ends: 53873 [2019-12-27 06:17:46,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53873 states. [2019-12-27 06:17:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53873 to 40386. [2019-12-27 06:17:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40386 states. [2019-12-27 06:17:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40386 states to 40386 states and 133919 transitions. [2019-12-27 06:17:49,759 INFO L78 Accepts]: Start accepts. Automaton has 40386 states and 133919 transitions. Word has length 16 [2019-12-27 06:17:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:49,760 INFO L462 AbstractCegarLoop]: Abstraction has 40386 states and 133919 transitions. [2019-12-27 06:17:49,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 40386 states and 133919 transitions. [2019-12-27 06:17:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:49,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:49,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:49,765 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:49,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:49,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1679414171, now seen corresponding path program 1 times [2019-12-27 06:17:49,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:49,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737306542] [2019-12-27 06:17:49,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:49,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737306542] [2019-12-27 06:17:49,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:49,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:49,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15905536] [2019-12-27 06:17:49,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:49,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:49,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:49,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:49,859 INFO L87 Difference]: Start difference. First operand 40386 states and 133919 transitions. Second operand 4 states. [2019-12-27 06:17:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:50,273 INFO L93 Difference]: Finished difference Result 48153 states and 157153 transitions. [2019-12-27 06:17:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:50,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:17:50,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:50,355 INFO L225 Difference]: With dead ends: 48153 [2019-12-27 06:17:50,355 INFO L226 Difference]: Without dead ends: 48153 [2019-12-27 06:17:50,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48153 states. [2019-12-27 06:17:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48153 to 44290. [2019-12-27 06:17:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44290 states. [2019-12-27 06:17:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44290 states to 44290 states and 145673 transitions. [2019-12-27 06:17:51,194 INFO L78 Accepts]: Start accepts. Automaton has 44290 states and 145673 transitions. Word has length 16 [2019-12-27 06:17:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:51,195 INFO L462 AbstractCegarLoop]: Abstraction has 44290 states and 145673 transitions. [2019-12-27 06:17:51,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 44290 states and 145673 transitions. [2019-12-27 06:17:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:51,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:51,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:51,199 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1745863415, now seen corresponding path program 1 times [2019-12-27 06:17:51,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:51,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014930087] [2019-12-27 06:17:51,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:51,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014930087] [2019-12-27 06:17:51,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:51,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:51,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477544633] [2019-12-27 06:17:51,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:51,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:51,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:51,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:51,269 INFO L87 Difference]: Start difference. First operand 44290 states and 145673 transitions. Second operand 4 states. [2019-12-27 06:17:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:51,668 INFO L93 Difference]: Finished difference Result 52593 states and 171527 transitions. [2019-12-27 06:17:51,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:51,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:17:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:51,764 INFO L225 Difference]: With dead ends: 52593 [2019-12-27 06:17:51,765 INFO L226 Difference]: Without dead ends: 52593 [2019-12-27 06:17:51,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52593 states. [2019-12-27 06:17:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52593 to 45862. [2019-12-27 06:17:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-27 06:17:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 150892 transitions. [2019-12-27 06:17:53,099 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 150892 transitions. Word has length 16 [2019-12-27 06:17:53,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:53,099 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 150892 transitions. [2019-12-27 06:17:53,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 150892 transitions. [2019-12-27 06:17:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:17:53,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:53,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:53,110 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:53,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:53,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1921236917, now seen corresponding path program 1 times [2019-12-27 06:17:53,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:53,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521765424] [2019-12-27 06:17:53,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:53,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521765424] [2019-12-27 06:17:53,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:53,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:53,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561100511] [2019-12-27 06:17:53,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:53,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:53,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:53,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:53,212 INFO L87 Difference]: Start difference. First operand 45862 states and 150892 transitions. Second operand 5 states. [2019-12-27 06:17:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:53,946 INFO L93 Difference]: Finished difference Result 62673 states and 200938 transitions. [2019-12-27 06:17:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:17:53,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:17:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:54,049 INFO L225 Difference]: With dead ends: 62673 [2019-12-27 06:17:54,049 INFO L226 Difference]: Without dead ends: 62666 [2019-12-27 06:17:54,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62666 states. [2019-12-27 06:17:54,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62666 to 47202. [2019-12-27 06:17:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47202 states. [2019-12-27 06:17:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47202 states to 47202 states and 154985 transitions. [2019-12-27 06:17:54,972 INFO L78 Accepts]: Start accepts. Automaton has 47202 states and 154985 transitions. Word has length 22 [2019-12-27 06:17:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:54,972 INFO L462 AbstractCegarLoop]: Abstraction has 47202 states and 154985 transitions. [2019-12-27 06:17:54,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 47202 states and 154985 transitions. [2019-12-27 06:17:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:17:54,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:54,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:54,982 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1854787673, now seen corresponding path program 1 times [2019-12-27 06:17:54,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:54,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73878576] [2019-12-27 06:17:54,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:55,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73878576] [2019-12-27 06:17:55,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:55,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:55,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743113842] [2019-12-27 06:17:55,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:55,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:55,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:55,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:55,076 INFO L87 Difference]: Start difference. First operand 47202 states and 154985 transitions. Second operand 5 states. [2019-12-27 06:17:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:56,360 INFO L93 Difference]: Finished difference Result 65940 states and 210721 transitions. [2019-12-27 06:17:56,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:17:56,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:17:56,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:56,519 INFO L225 Difference]: With dead ends: 65940 [2019-12-27 06:17:56,519 INFO L226 Difference]: Without dead ends: 65933 [2019-12-27 06:17:56,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65933 states. [2019-12-27 06:17:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65933 to 45465. [2019-12-27 06:17:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45465 states. [2019-12-27 06:17:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45465 states to 45465 states and 149394 transitions. [2019-12-27 06:17:57,542 INFO L78 Accepts]: Start accepts. Automaton has 45465 states and 149394 transitions. Word has length 22 [2019-12-27 06:17:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:57,542 INFO L462 AbstractCegarLoop]: Abstraction has 45465 states and 149394 transitions. [2019-12-27 06:17:57,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 45465 states and 149394 transitions. [2019-12-27 06:17:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:17:57,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:57,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:57,555 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash 145172187, now seen corresponding path program 1 times [2019-12-27 06:17:57,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:57,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728195571] [2019-12-27 06:17:57,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:57,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728195571] [2019-12-27 06:17:57,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:57,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:57,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43283663] [2019-12-27 06:17:57,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:57,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:57,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:57,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:57,637 INFO L87 Difference]: Start difference. First operand 45465 states and 149394 transitions. Second operand 4 states. [2019-12-27 06:17:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:57,736 INFO L93 Difference]: Finished difference Result 18727 states and 58359 transitions. [2019-12-27 06:17:57,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:17:57,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:17:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:57,763 INFO L225 Difference]: With dead ends: 18727 [2019-12-27 06:17:57,764 INFO L226 Difference]: Without dead ends: 18727 [2019-12-27 06:17:57,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18727 states. [2019-12-27 06:17:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18727 to 18364. [2019-12-27 06:17:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-27 06:17:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 57323 transitions. [2019-12-27 06:17:58,048 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 57323 transitions. Word has length 25 [2019-12-27 06:17:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:58,048 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 57323 transitions. [2019-12-27 06:17:58,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 57323 transitions. [2019-12-27 06:17:58,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:17:58,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:58,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:58,062 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2016642455, now seen corresponding path program 1 times [2019-12-27 06:17:58,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:58,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388852559] [2019-12-27 06:17:58,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:58,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388852559] [2019-12-27 06:17:58,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:58,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:58,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567640102] [2019-12-27 06:17:58,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:58,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:58,124 INFO L87 Difference]: Start difference. First operand 18364 states and 57323 transitions. Second operand 3 states. [2019-12-27 06:17:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:58,213 INFO L93 Difference]: Finished difference Result 24105 states and 71434 transitions. [2019-12-27 06:17:58,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:58,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:17:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:58,243 INFO L225 Difference]: With dead ends: 24105 [2019-12-27 06:17:58,243 INFO L226 Difference]: Without dead ends: 24105 [2019-12-27 06:17:58,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:58,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24105 states. [2019-12-27 06:17:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24105 to 18364. [2019-12-27 06:17:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-27 06:17:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 54802 transitions. [2019-12-27 06:17:58,561 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 54802 transitions. Word has length 27 [2019-12-27 06:17:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:58,562 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 54802 transitions. [2019-12-27 06:17:58,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 54802 transitions. [2019-12-27 06:17:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:17:58,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:58,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:58,575 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:58,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:58,575 INFO L82 PathProgramCache]: Analyzing trace with hash -364349975, now seen corresponding path program 1 times [2019-12-27 06:17:58,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:58,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338317207] [2019-12-27 06:17:58,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:58,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338317207] [2019-12-27 06:17:58,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:58,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:58,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093838786] [2019-12-27 06:17:58,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:58,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:58,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:58,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:58,661 INFO L87 Difference]: Start difference. First operand 18364 states and 54802 transitions. Second operand 5 states. [2019-12-27 06:17:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:59,021 INFO L93 Difference]: Finished difference Result 22570 states and 66509 transitions. [2019-12-27 06:17:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:17:59,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 06:17:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:59,052 INFO L225 Difference]: With dead ends: 22570 [2019-12-27 06:17:59,052 INFO L226 Difference]: Without dead ends: 22570 [2019-12-27 06:17:59,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22570 states. [2019-12-27 06:17:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22570 to 21200. [2019-12-27 06:17:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21200 states. [2019-12-27 06:17:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21200 states to 21200 states and 63046 transitions. [2019-12-27 06:17:59,496 INFO L78 Accepts]: Start accepts. Automaton has 21200 states and 63046 transitions. Word has length 27 [2019-12-27 06:17:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:59,496 INFO L462 AbstractCegarLoop]: Abstraction has 21200 states and 63046 transitions. [2019-12-27 06:17:59,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 21200 states and 63046 transitions. [2019-12-27 06:17:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:17:59,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:59,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:59,511 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:59,512 INFO L82 PathProgramCache]: Analyzing trace with hash 587647727, now seen corresponding path program 1 times [2019-12-27 06:17:59,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:59,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623944120] [2019-12-27 06:17:59,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:59,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623944120] [2019-12-27 06:17:59,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:59,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:17:59,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633764927] [2019-12-27 06:17:59,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:59,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:59,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:59,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:59,616 INFO L87 Difference]: Start difference. First operand 21200 states and 63046 transitions. Second operand 5 states. [2019-12-27 06:17:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:59,781 INFO L93 Difference]: Finished difference Result 21517 states and 63843 transitions. [2019-12-27 06:17:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:59,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 06:17:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:59,819 INFO L225 Difference]: With dead ends: 21517 [2019-12-27 06:17:59,820 INFO L226 Difference]: Without dead ends: 21517 [2019-12-27 06:17:59,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21517 states. [2019-12-27 06:18:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21517 to 21517. [2019-12-27 06:18:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21517 states. [2019-12-27 06:18:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21517 states to 21517 states and 63843 transitions. [2019-12-27 06:18:00,175 INFO L78 Accepts]: Start accepts. Automaton has 21517 states and 63843 transitions. Word has length 28 [2019-12-27 06:18:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:00,176 INFO L462 AbstractCegarLoop]: Abstraction has 21517 states and 63843 transitions. [2019-12-27 06:18:00,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:18:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21517 states and 63843 transitions. [2019-12-27 06:18:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:18:00,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:00,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:00,191 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:00,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:00,192 INFO L82 PathProgramCache]: Analyzing trace with hash 423865752, now seen corresponding path program 1 times [2019-12-27 06:18:00,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:00,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395510364] [2019-12-27 06:18:00,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:00,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395510364] [2019-12-27 06:18:00,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:00,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:00,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562318160] [2019-12-27 06:18:00,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:18:00,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:00,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:18:00,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:18:00,280 INFO L87 Difference]: Start difference. First operand 21517 states and 63843 transitions. Second operand 5 states. [2019-12-27 06:18:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:00,655 INFO L93 Difference]: Finished difference Result 24989 states and 73209 transitions. [2019-12-27 06:18:00,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:18:00,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 06:18:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:00,687 INFO L225 Difference]: With dead ends: 24989 [2019-12-27 06:18:00,687 INFO L226 Difference]: Without dead ends: 24989 [2019-12-27 06:18:00,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:18:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24989 states. [2019-12-27 06:18:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24989 to 21632. [2019-12-27 06:18:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21632 states. [2019-12-27 06:18:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21632 states to 21632 states and 64119 transitions. [2019-12-27 06:18:01,044 INFO L78 Accepts]: Start accepts. Automaton has 21632 states and 64119 transitions. Word has length 29 [2019-12-27 06:18:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:01,044 INFO L462 AbstractCegarLoop]: Abstraction has 21632 states and 64119 transitions. [2019-12-27 06:18:01,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:18:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 21632 states and 64119 transitions. [2019-12-27 06:18:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:18:01,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:01,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:01,064 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash 688173209, now seen corresponding path program 1 times [2019-12-27 06:18:01,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:01,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595680187] [2019-12-27 06:18:01,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:01,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595680187] [2019-12-27 06:18:01,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:01,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:18:01,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562090679] [2019-12-27 06:18:01,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:18:01,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:01,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:18:01,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:18:01,179 INFO L87 Difference]: Start difference. First operand 21632 states and 64119 transitions. Second operand 6 states. [2019-12-27 06:18:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:01,932 INFO L93 Difference]: Finished difference Result 28684 states and 83540 transitions. [2019-12-27 06:18:01,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:18:01,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 06:18:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:01,972 INFO L225 Difference]: With dead ends: 28684 [2019-12-27 06:18:01,972 INFO L226 Difference]: Without dead ends: 28684 [2019-12-27 06:18:01,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:18:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28684 states. [2019-12-27 06:18:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28684 to 22894. [2019-12-27 06:18:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22894 states. [2019-12-27 06:18:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22894 states to 22894 states and 67752 transitions. [2019-12-27 06:18:02,372 INFO L78 Accepts]: Start accepts. Automaton has 22894 states and 67752 transitions. Word has length 33 [2019-12-27 06:18:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:02,373 INFO L462 AbstractCegarLoop]: Abstraction has 22894 states and 67752 transitions. [2019-12-27 06:18:02,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:18:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 22894 states and 67752 transitions. [2019-12-27 06:18:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 06:18:02,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:02,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:02,392 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1713636280, now seen corresponding path program 1 times [2019-12-27 06:18:02,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:02,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916395326] [2019-12-27 06:18:02,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:02,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916395326] [2019-12-27 06:18:02,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:02,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:18:02,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7529671] [2019-12-27 06:18:02,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:18:02,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:02,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:18:02,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:18:02,483 INFO L87 Difference]: Start difference. First operand 22894 states and 67752 transitions. Second operand 6 states. [2019-12-27 06:18:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:03,385 INFO L93 Difference]: Finished difference Result 27845 states and 81337 transitions. [2019-12-27 06:18:03,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:18:03,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 06:18:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:03,432 INFO L225 Difference]: With dead ends: 27845 [2019-12-27 06:18:03,433 INFO L226 Difference]: Without dead ends: 27845 [2019-12-27 06:18:03,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:18:03,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27845 states. [2019-12-27 06:18:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27845 to 19696. [2019-12-27 06:18:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19696 states. [2019-12-27 06:18:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19696 states to 19696 states and 58642 transitions. [2019-12-27 06:18:03,789 INFO L78 Accepts]: Start accepts. Automaton has 19696 states and 58642 transitions. Word has length 35 [2019-12-27 06:18:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:03,789 INFO L462 AbstractCegarLoop]: Abstraction has 19696 states and 58642 transitions. [2019-12-27 06:18:03,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:18:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand 19696 states and 58642 transitions. [2019-12-27 06:18:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:18:03,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:03,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:03,810 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:03,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1024843726, now seen corresponding path program 1 times [2019-12-27 06:18:03,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:03,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230854764] [2019-12-27 06:18:03,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:03,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230854764] [2019-12-27 06:18:03,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:03,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:18:03,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131544462] [2019-12-27 06:18:03,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:03,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:03,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:03,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:03,865 INFO L87 Difference]: Start difference. First operand 19696 states and 58642 transitions. Second operand 3 states. [2019-12-27 06:18:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:03,946 INFO L93 Difference]: Finished difference Result 19695 states and 58640 transitions. [2019-12-27 06:18:03,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:03,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:18:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:03,988 INFO L225 Difference]: With dead ends: 19695 [2019-12-27 06:18:03,989 INFO L226 Difference]: Without dead ends: 19695 [2019-12-27 06:18:03,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19695 states. [2019-12-27 06:18:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19695 to 19695. [2019-12-27 06:18:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19695 states. [2019-12-27 06:18:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19695 states to 19695 states and 58640 transitions. [2019-12-27 06:18:04,348 INFO L78 Accepts]: Start accepts. Automaton has 19695 states and 58640 transitions. Word has length 39 [2019-12-27 06:18:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:04,348 INFO L462 AbstractCegarLoop]: Abstraction has 19695 states and 58640 transitions. [2019-12-27 06:18:04,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 19695 states and 58640 transitions. [2019-12-27 06:18:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:18:04,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:04,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:04,372 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1293195895, now seen corresponding path program 1 times [2019-12-27 06:18:04,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:04,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110267489] [2019-12-27 06:18:04,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:04,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110267489] [2019-12-27 06:18:04,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:04,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:18:04,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917202053] [2019-12-27 06:18:04,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:04,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:04,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:04,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:04,438 INFO L87 Difference]: Start difference. First operand 19695 states and 58640 transitions. Second operand 3 states. [2019-12-27 06:18:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:04,522 INFO L93 Difference]: Finished difference Result 18642 states and 54687 transitions. [2019-12-27 06:18:04,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:04,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 06:18:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:04,559 INFO L225 Difference]: With dead ends: 18642 [2019-12-27 06:18:04,560 INFO L226 Difference]: Without dead ends: 18642 [2019-12-27 06:18:04,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18642 states. [2019-12-27 06:18:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18642 to 18634. [2019-12-27 06:18:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18634 states. [2019-12-27 06:18:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18634 states to 18634 states and 54671 transitions. [2019-12-27 06:18:04,999 INFO L78 Accepts]: Start accepts. Automaton has 18634 states and 54671 transitions. Word has length 40 [2019-12-27 06:18:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:04,999 INFO L462 AbstractCegarLoop]: Abstraction has 18634 states and 54671 transitions. [2019-12-27 06:18:05,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 18634 states and 54671 transitions. [2019-12-27 06:18:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 06:18:05,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:05,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:05,024 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1510048586, now seen corresponding path program 1 times [2019-12-27 06:18:05,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:05,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207497804] [2019-12-27 06:18:05,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:05,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207497804] [2019-12-27 06:18:05,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:05,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:18:05,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697062855] [2019-12-27 06:18:05,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:05,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:05,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:05,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:05,120 INFO L87 Difference]: Start difference. First operand 18634 states and 54671 transitions. Second operand 3 states. [2019-12-27 06:18:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:05,203 INFO L93 Difference]: Finished difference Result 18634 states and 54594 transitions. [2019-12-27 06:18:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:05,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 06:18:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:05,241 INFO L225 Difference]: With dead ends: 18634 [2019-12-27 06:18:05,241 INFO L226 Difference]: Without dead ends: 18634 [2019-12-27 06:18:05,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18634 states. [2019-12-27 06:18:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18634 to 16452. [2019-12-27 06:18:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16452 states. [2019-12-27 06:18:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16452 states to 16452 states and 48592 transitions. [2019-12-27 06:18:05,687 INFO L78 Accepts]: Start accepts. Automaton has 16452 states and 48592 transitions. Word has length 41 [2019-12-27 06:18:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:05,688 INFO L462 AbstractCegarLoop]: Abstraction has 16452 states and 48592 transitions. [2019-12-27 06:18:05,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16452 states and 48592 transitions. [2019-12-27 06:18:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 06:18:05,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:05,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:05,714 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash -997062185, now seen corresponding path program 1 times [2019-12-27 06:18:05,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:05,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420382737] [2019-12-27 06:18:05,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:05,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420382737] [2019-12-27 06:18:05,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:05,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:18:05,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578474705] [2019-12-27 06:18:05,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:18:05,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:18:05,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:18:05,780 INFO L87 Difference]: Start difference. First operand 16452 states and 48592 transitions. Second operand 5 states. [2019-12-27 06:18:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:05,866 INFO L93 Difference]: Finished difference Result 15254 states and 46027 transitions. [2019-12-27 06:18:05,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:18:05,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 06:18:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:05,891 INFO L225 Difference]: With dead ends: 15254 [2019-12-27 06:18:05,891 INFO L226 Difference]: Without dead ends: 15254 [2019-12-27 06:18:05,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:18:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15254 states. [2019-12-27 06:18:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15254 to 15254. [2019-12-27 06:18:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15254 states. [2019-12-27 06:18:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15254 states to 15254 states and 46027 transitions. [2019-12-27 06:18:06,258 INFO L78 Accepts]: Start accepts. Automaton has 15254 states and 46027 transitions. Word has length 42 [2019-12-27 06:18:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:06,258 INFO L462 AbstractCegarLoop]: Abstraction has 15254 states and 46027 transitions. [2019-12-27 06:18:06,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:18:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 15254 states and 46027 transitions. [2019-12-27 06:18:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:18:06,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:06,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:06,281 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:06,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1170584375, now seen corresponding path program 1 times [2019-12-27 06:18:06,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:06,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786070032] [2019-12-27 06:18:06,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:06,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786070032] [2019-12-27 06:18:06,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:06,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:18:06,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532857451] [2019-12-27 06:18:06,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:06,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:06,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:06,374 INFO L87 Difference]: Start difference. First operand 15254 states and 46027 transitions. Second operand 3 states. [2019-12-27 06:18:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:06,484 INFO L93 Difference]: Finished difference Result 17746 states and 53311 transitions. [2019-12-27 06:18:06,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:06,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:18:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:06,506 INFO L225 Difference]: With dead ends: 17746 [2019-12-27 06:18:06,506 INFO L226 Difference]: Without dead ends: 17746 [2019-12-27 06:18:06,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17746 states. [2019-12-27 06:18:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17746 to 14015. [2019-12-27 06:18:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14015 states. [2019-12-27 06:18:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14015 states to 14015 states and 42411 transitions. [2019-12-27 06:18:06,856 INFO L78 Accepts]: Start accepts. Automaton has 14015 states and 42411 transitions. Word has length 66 [2019-12-27 06:18:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:06,857 INFO L462 AbstractCegarLoop]: Abstraction has 14015 states and 42411 transitions. [2019-12-27 06:18:06,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 14015 states and 42411 transitions. [2019-12-27 06:18:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:06,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:06,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:06,871 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:06,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:06,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1013027499, now seen corresponding path program 1 times [2019-12-27 06:18:06,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:06,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737516988] [2019-12-27 06:18:06,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:07,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737516988] [2019-12-27 06:18:07,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:07,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:18:07,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934005027] [2019-12-27 06:18:07,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:18:07,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:07,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:18:07,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:18:07,085 INFO L87 Difference]: Start difference. First operand 14015 states and 42411 transitions. Second operand 10 states. [2019-12-27 06:18:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:08,827 INFO L93 Difference]: Finished difference Result 28354 states and 84996 transitions. [2019-12-27 06:18:08,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:18:08,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 06:18:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:08,854 INFO L225 Difference]: With dead ends: 28354 [2019-12-27 06:18:08,854 INFO L226 Difference]: Without dead ends: 19846 [2019-12-27 06:18:08,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:18:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19846 states. [2019-12-27 06:18:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19846 to 16545. [2019-12-27 06:18:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16545 states. [2019-12-27 06:18:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16545 states to 16545 states and 49685 transitions. [2019-12-27 06:18:09,154 INFO L78 Accepts]: Start accepts. Automaton has 16545 states and 49685 transitions. Word has length 67 [2019-12-27 06:18:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:09,155 INFO L462 AbstractCegarLoop]: Abstraction has 16545 states and 49685 transitions. [2019-12-27 06:18:09,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:18:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 16545 states and 49685 transitions. [2019-12-27 06:18:09,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:09,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:09,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:09,172 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:09,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:09,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1394809923, now seen corresponding path program 2 times [2019-12-27 06:18:09,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:09,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416186558] [2019-12-27 06:18:09,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:09,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416186558] [2019-12-27 06:18:09,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:09,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:18:09,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611253947] [2019-12-27 06:18:09,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:18:09,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:09,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:18:09,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:18:09,434 INFO L87 Difference]: Start difference. First operand 16545 states and 49685 transitions. Second operand 11 states. [2019-12-27 06:18:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:11,107 INFO L93 Difference]: Finished difference Result 44830 states and 133903 transitions. [2019-12-27 06:18:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 06:18:11,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:18:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:11,154 INFO L225 Difference]: With dead ends: 44830 [2019-12-27 06:18:11,154 INFO L226 Difference]: Without dead ends: 30560 [2019-12-27 06:18:11,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 06:18:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30560 states. [2019-12-27 06:18:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30560 to 16235. [2019-12-27 06:18:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16235 states. [2019-12-27 06:18:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16235 states to 16235 states and 48749 transitions. [2019-12-27 06:18:11,517 INFO L78 Accepts]: Start accepts. Automaton has 16235 states and 48749 transitions. Word has length 67 [2019-12-27 06:18:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:11,518 INFO L462 AbstractCegarLoop]: Abstraction has 16235 states and 48749 transitions. [2019-12-27 06:18:11,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:18:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 16235 states and 48749 transitions. [2019-12-27 06:18:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:11,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:11,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:11,534 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash -614399051, now seen corresponding path program 3 times [2019-12-27 06:18:11,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:11,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13015492] [2019-12-27 06:18:11,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:18:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:18:11,730 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:18:11,730 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:18:11,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t931~0.base_26|) 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~a$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_9 0) (= 0 |v_ULTIMATE.start_main_~#t931~0.offset_19|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t931~0.base_26|) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~a$r_buff1_thd3~0_48) (= v_~__unbuffered_p2_EBX~0_16 0) (< 0 |v_#StackHeapBarrier_16|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_26| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_26|) |v_ULTIMATE.start_main_~#t931~0.offset_19| 0)) |v_#memory_int_19|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z~0_7) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff1~0_23) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t931~0.base_26| 1)) (= 0 v_~a$w_buff0_used~0_113) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~a$mem_tmp~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_#NULL.base_7|) (= 0 v_~y~0_8) (= v_~a$r_buff0_thd2~0_21 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~a$w_buff0~0_26) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t931~0.base_26| 4)) (= v_~a$r_buff0_thd3~0_79 0) (= 0 v_~a$w_buff1_used~0_68) (= 0 v_~a$r_buff1_thd2~0_18) (= v_~a~0_27 0) (= v_~a$r_buff0_thd0~0_21 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_21|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ULTIMATE.start_main_~#t931~0.offset=|v_ULTIMATE.start_main_~#t931~0.offset_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_~#t931~0.base=|v_ULTIMATE.start_main_~#t931~0.base_26|, ~x~0=v_~x~0_10, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~a$w_buff1~0=v_~a$w_buff1~0_23, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_16|, ~y~0=v_~y~0_8, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_14|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_7, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t932~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t931~0.offset, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t931~0.base, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t933~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t932~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t933~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 06:18:11,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L750: Formula: (and (= ~a$r_buff0_thd1~0_In-1697733187 ~a$r_buff1_thd1~0_Out-1697733187) (= ~a$r_buff0_thd0~0_In-1697733187 ~a$r_buff1_thd0~0_Out-1697733187) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1697733187 0)) (= ~a$r_buff0_thd1~0_Out-1697733187 1) (= ~a$r_buff1_thd3~0_Out-1697733187 ~a$r_buff0_thd3~0_In-1697733187) (= ~a$r_buff1_thd2~0_Out-1697733187 ~a$r_buff0_thd2~0_In-1697733187) (= ~x~0_In-1697733187 ~__unbuffered_p0_EAX~0_Out-1697733187)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1697733187, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1697733187, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1697733187, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1697733187, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1697733187, ~x~0=~x~0_In-1697733187} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1697733187, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1697733187, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1697733187, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1697733187, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1697733187, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1697733187, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1697733187, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1697733187, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1697733187, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1697733187, ~x~0=~x~0_In-1697733187} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:18:11,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11|) |v_ULTIMATE.start_main_~#t932~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t932~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t932~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t932~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t932~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t932~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t932~0.offset, #length] because there is no mapped edge [2019-12-27 06:18:11,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In1416241349 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1416241349 256)))) (or (and (= ~a~0_In1416241349 |P1Thread1of1ForFork2_#t~ite9_Out1416241349|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1416241349 |P1Thread1of1ForFork2_#t~ite9_Out1416241349|)))) InVars {~a~0=~a~0_In1416241349, ~a$w_buff1~0=~a$w_buff1~0_In1416241349, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1416241349, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1416241349} OutVars{~a~0=~a~0_In1416241349, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1416241349|, ~a$w_buff1~0=~a$w_buff1~0_In1416241349, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1416241349, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1416241349} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 06:18:11,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= v_~a~0_22 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_22, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 06:18:11,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1835512072 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1835512072 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1835512072| ~a$w_buff0_used~0_In1835512072)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1835512072|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1835512072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1835512072} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1835512072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1835512072, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1835512072|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:18:11,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-607041446 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-607041446 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-607041446 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-607041446 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-607041446| ~a$w_buff1_used~0_In-607041446) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-607041446| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-607041446, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-607041446, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-607041446, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-607041446} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-607041446, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-607041446, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-607041446, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-607041446|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-607041446} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:18:11,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1364343136 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1364343136 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1364343136| ~a$r_buff0_thd2~0_In-1364343136)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1364343136| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1364343136, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1364343136} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1364343136, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1364343136, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1364343136|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:18:11,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-491581007 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-491581007 256))) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-491581007 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-491581007 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-491581007| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-491581007| ~a$r_buff1_thd2~0_In-491581007) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-491581007, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-491581007, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-491581007, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-491581007} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-491581007, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-491581007, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-491581007, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-491581007, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-491581007|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:18:11,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:18:11,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In91207700 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In91207700 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In91207700 |P0Thread1of1ForFork1_#t~ite5_Out91207700|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out91207700|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In91207700, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In91207700} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out91207700|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In91207700, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In91207700} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:18:11,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-423132674 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-423132674 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-423132674 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-423132674 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-423132674| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out-423132674| ~a$w_buff1_used~0_In-423132674)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-423132674, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-423132674, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-423132674, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-423132674} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-423132674|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-423132674, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-423132674, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-423132674, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-423132674} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:18:11,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-653910738 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-653910738 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out-653910738 ~a$r_buff0_thd1~0_In-653910738)) (and (not .cse1) (not .cse0) (= ~a$r_buff0_thd1~0_Out-653910738 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-653910738, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-653910738} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-653910738|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-653910738, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-653910738} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:18:11,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In587232743 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In587232743 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In587232743 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In587232743 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In587232743 |P0Thread1of1ForFork1_#t~ite8_Out587232743|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out587232743|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In587232743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In587232743, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In587232743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In587232743} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out587232743|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In587232743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In587232743, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In587232743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In587232743} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:18:11,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L754-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~a$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:18:11,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L834-1-->L836: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t933~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11|) |v_ULTIMATE.start_main_~#t933~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t933~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t933~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t933~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_11|, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t933~0.base, ULTIMATE.start_main_~#t933~0.offset, #length] because there is no mapped edge [2019-12-27 06:18:11,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In374405860 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In374405860 256) 0))) (or (= (mod ~a$w_buff0_used~0_In374405860 256) 0) (and .cse0 (= (mod ~a$r_buff1_thd3~0_In374405860 256) 0)) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In374405860 256))))) .cse1 (= ~a$w_buff1_used~0_In374405860 |P2Thread1of1ForFork0_#t~ite29_Out374405860|) (= |P2Thread1of1ForFork0_#t~ite30_Out374405860| |P2Thread1of1ForFork0_#t~ite29_Out374405860|)) (and (not .cse1) (= ~a$w_buff1_used~0_In374405860 |P2Thread1of1ForFork0_#t~ite30_Out374405860|) (= |P2Thread1of1ForFork0_#t~ite29_In374405860| |P2Thread1of1ForFork0_#t~ite29_Out374405860|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In374405860, ~a$w_buff0_used~0=~a$w_buff0_used~0_In374405860, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In374405860, ~a$w_buff1_used~0=~a$w_buff1_used~0_In374405860, ~weak$$choice2~0=~weak$$choice2~0_In374405860, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In374405860|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In374405860, ~a$w_buff0_used~0=~a$w_buff0_used~0_In374405860, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In374405860, ~a$w_buff1_used~0=~a$w_buff1_used~0_In374405860, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out374405860|, ~weak$$choice2~0=~weak$$choice2~0_In374405860, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out374405860|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 06:18:11,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (= v_~a$r_buff0_thd3~0_52 v_~a$r_buff0_thd3~0_51) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:18:11,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_20 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 06:18:11,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In2093877464 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In2093877464 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out2093877464| ~a~0_In2093877464)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out2093877464| ~a$w_buff1~0_In2093877464) (not .cse0)))) InVars {~a~0=~a~0_In2093877464, ~a$w_buff1~0=~a$w_buff1~0_In2093877464, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2093877464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2093877464} OutVars{~a~0=~a~0_In2093877464, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2093877464|, ~a$w_buff1~0=~a$w_buff1~0_In2093877464, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2093877464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2093877464} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:18:11,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_18 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_18, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:18:11,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1426899968 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1426899968 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1426899968 |P2Thread1of1ForFork0_#t~ite40_Out1426899968|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1426899968| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1426899968, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1426899968} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1426899968|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1426899968, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1426899968} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:18:11,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-647582894 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-647582894 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-647582894 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-647582894 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-647582894| ~a$w_buff1_used~0_In-647582894)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out-647582894| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-647582894, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-647582894, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-647582894, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-647582894} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-647582894, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-647582894, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-647582894, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-647582894, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-647582894|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:18:11,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-555665656 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-555665656 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-555665656|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In-555665656 |P2Thread1of1ForFork0_#t~ite42_Out-555665656|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-555665656, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-555665656} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-555665656, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-555665656, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-555665656|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:18:11,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-931748012 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-931748012 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-931748012 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-931748012 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-931748012|)) (and (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In-931748012 |P2Thread1of1ForFork0_#t~ite43_Out-931748012|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-931748012, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-931748012, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-931748012, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-931748012} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-931748012|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-931748012, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-931748012, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-931748012, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-931748012} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:18:11,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:18:11,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:18:11,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite47_Out1138177848| |ULTIMATE.start_main_#t~ite48_Out1138177848|)) (.cse0 (= (mod ~a$w_buff1_used~0_In1138177848 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In1138177848 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1138177848| ~a$w_buff1~0_In1138177848) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite47_Out1138177848| ~a~0_In1138177848) .cse1 (or .cse0 .cse2)))) InVars {~a~0=~a~0_In1138177848, ~a$w_buff1~0=~a$w_buff1~0_In1138177848, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1138177848, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1138177848} OutVars{~a~0=~a~0_In1138177848, ~a$w_buff1~0=~a$w_buff1~0_In1138177848, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1138177848|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1138177848, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1138177848|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1138177848} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:18:11,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1874283540 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1874283540 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1874283540 |ULTIMATE.start_main_#t~ite49_Out-1874283540|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-1874283540|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1874283540, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1874283540} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1874283540, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1874283540|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1874283540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:18:11,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In602115030 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In602115030 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In602115030 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In602115030 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In602115030 |ULTIMATE.start_main_#t~ite50_Out602115030|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out602115030|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In602115030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In602115030, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In602115030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In602115030} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out602115030|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In602115030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In602115030, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In602115030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In602115030} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:18:11,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1451567527 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1451567527 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1451567527 |ULTIMATE.start_main_#t~ite51_Out1451567527|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1451567527|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1451567527, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1451567527} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1451567527|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1451567527, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1451567527} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:18:11,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1968870246 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1968870246 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1968870246 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1968870246 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1968870246| ~a$r_buff1_thd0~0_In1968870246) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out1968870246| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1968870246, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1968870246, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1968870246, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1968870246} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1968870246|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1968870246, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1968870246, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1968870246, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1968870246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:18:11,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite52_13| v_~a$r_buff1_thd0~0_19) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:18:11,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:18:11 BasicIcfg [2019-12-27 06:18:11,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:18:11,873 INFO L168 Benchmark]: Toolchain (without parser) took 89291.52 ms. Allocated memory was 138.4 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 100.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 06:18:11,874 INFO L168 Benchmark]: CDTParser took 1.33 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:18:11,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.96 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 156.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:11,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.54 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 154.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:11,876 INFO L168 Benchmark]: Boogie Preprocessor took 62.83 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:11,876 INFO L168 Benchmark]: RCFGBuilder took 827.82 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 100.9 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:11,877 INFO L168 Benchmark]: TraceAbstraction took 87608.94 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 06:18:11,886 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 721.96 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 156.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.54 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 154.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.83 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.82 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 100.9 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87608.94 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7337 VarBasedMoverChecksPositive, 224 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 86659 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t931, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t932, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t933, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 87.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4298 SDtfs, 4409 SDslu, 11169 SDs, 0 SdLazy, 5299 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163842occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 123807 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 752 NumberOfCodeBlocks, 752 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 663 ConstructedInterpolants, 0 QuantifiedInterpolants, 137513 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...