/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/safe031_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:08:21,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:08:21,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:08:21,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:08:21,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:08:21,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:08:21,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:08:21,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:08:21,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:08:21,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:08:21,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:08:21,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:08:21,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:08:21,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:08:21,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:08:21,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:08:21,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:08:21,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:08:21,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:08:21,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:08:21,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:08:21,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:08:21,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:08:21,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:08:21,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:08:21,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:08:21,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:08:21,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:08:21,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:08:21,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:08:21,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:08:21,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:08:21,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:08:21,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:08:21,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:08:21,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:08:21,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:08:21,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:08:21,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:08:21,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:08:21,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:08:21,407 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 08:08:21,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:08:21,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:08:21,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:08:21,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:08:21,432 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:08:21,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:08:21,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:08:21,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:08:21,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:08:21,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:08:21,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:08:21,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:08:21,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:08:21,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:08:21,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:08:21,436 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:08:21,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:08:21,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:08:21,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:08:21,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:08:21,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:08:21,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:08:21,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:08:21,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:08:21,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:08:21,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:08:21,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:08:21,439 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:08:21,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:08:21,439 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:08:21,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:08:21,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:08:21,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:08:21,764 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:08:21,764 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:08:21,765 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.oepc.i [2019-12-27 08:08:21,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340493bcb/21439642ea374bf680d94d2b921b2bf2/FLAG9efca6090 [2019-12-27 08:08:22,362 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:08:22,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.oepc.i [2019-12-27 08:08:22,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340493bcb/21439642ea374bf680d94d2b921b2bf2/FLAG9efca6090 [2019-12-27 08:08:22,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340493bcb/21439642ea374bf680d94d2b921b2bf2 [2019-12-27 08:08:22,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:08:22,657 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:08:22,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:08:22,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:08:22,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:08:22,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22, skipping insertion in model container [2019-12-27 08:08:22,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:08:22,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:08:23,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:08:23,343 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:08:23,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:08:23,491 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:08:23,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23 WrapperNode [2019-12-27 08:08:23,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:08:23,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:08:23,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:08:23,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:08:23,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (1/1) ... [2019-12-27 08:08:23,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (1/1) ... [2019-12-27 08:08:23,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:08:23,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:08:23,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:08:23,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:08:23,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (1/1) ... [2019-12-27 08:08:23,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (1/1) ... [2019-12-27 08:08:23,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (1/1) ... [2019-12-27 08:08:23,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (1/1) ... [2019-12-27 08:08:23,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (1/1) ... [2019-12-27 08:08:23,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (1/1) ... [2019-12-27 08:08:23,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (1/1) ... [2019-12-27 08:08:23,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:08:23,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:08:23,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:08:23,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:08:23,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (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 08:08:23,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:08:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:08:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:08:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:08:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:08:23,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:08:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:08:23,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:08:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 08:08:23,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 08:08:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:08:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:08:23,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:08:23,663 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 08:08:24,381 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:08:24,382 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:08:24,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:08:24 BoogieIcfgContainer [2019-12-27 08:08:24,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:08:24,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:08:24,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:08:24,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:08:24,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:08:22" (1/3) ... [2019-12-27 08:08:24,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d7422f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:08:24, skipping insertion in model container [2019-12-27 08:08:24,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:23" (2/3) ... [2019-12-27 08:08:24,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d7422f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:08:24, skipping insertion in model container [2019-12-27 08:08:24,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:08:24" (3/3) ... [2019-12-27 08:08:24,397 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_pso.oepc.i [2019-12-27 08:08:24,408 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:08:24,409 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:08:24,419 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:08:24,420 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:08:24,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,503 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,503 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,510 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,511 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,534 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,540 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,540 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:24,563 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 08:08:24,583 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:08:24,584 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:08:24,584 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:08:24,584 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:08:24,584 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:08:24,584 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:08:24,584 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:08:24,584 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:08:24,600 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 08:08:24,602 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 08:08:24,703 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 08:08:24,704 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:08:24,722 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 08:08:24,748 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 08:08:24,798 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 08:08:24,798 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:08:24,806 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 08:08:24,826 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 08:08:24,827 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:08:28,066 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 08:08:28,172 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 08:08:28,404 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 08:08:28,524 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 08:08:28,544 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75290 [2019-12-27 08:08:28,544 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 08:08:28,547 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 94 transitions [2019-12-27 08:08:41,920 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92134 states. [2019-12-27 08:08:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 92134 states. [2019-12-27 08:08:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 08:08:41,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:41,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 08:08:41,928 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:41,932 INFO L82 PathProgramCache]: Analyzing trace with hash 790879197, now seen corresponding path program 1 times [2019-12-27 08:08:41,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:41,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503296871] [2019-12-27 08:08:41,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:42,198 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 08:08:42,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503296871] [2019-12-27 08:08:42,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:42,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:08:42,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193331163] [2019-12-27 08:08:42,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:42,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:42,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:42,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:42,218 INFO L87 Difference]: Start difference. First operand 92134 states. Second operand 3 states. [2019-12-27 08:08:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:44,668 INFO L93 Difference]: Finished difference Result 90524 states and 389631 transitions. [2019-12-27 08:08:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:44,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 08:08:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:45,203 INFO L225 Difference]: With dead ends: 90524 [2019-12-27 08:08:45,203 INFO L226 Difference]: Without dead ends: 84882 [2019-12-27 08:08:45,211 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 08:08:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84882 states. [2019-12-27 08:08:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84882 to 84882. [2019-12-27 08:08:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84882 states. [2019-12-27 08:08:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84882 states to 84882 states and 364809 transitions. [2019-12-27 08:08:55,983 INFO L78 Accepts]: Start accepts. Automaton has 84882 states and 364809 transitions. Word has length 5 [2019-12-27 08:08:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:55,983 INFO L462 AbstractCegarLoop]: Abstraction has 84882 states and 364809 transitions. [2019-12-27 08:08:55,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 84882 states and 364809 transitions. [2019-12-27 08:08:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:08:55,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:55,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:55,992 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:55,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2214746, now seen corresponding path program 1 times [2019-12-27 08:08:55,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:55,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910311785] [2019-12-27 08:08:55,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:56,124 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 08:08:56,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910311785] [2019-12-27 08:08:56,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:56,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:56,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207465507] [2019-12-27 08:08:56,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:08:56,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:56,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:08:56,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:08:56,128 INFO L87 Difference]: Start difference. First operand 84882 states and 364809 transitions. Second operand 4 states. [2019-12-27 08:08:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:57,207 INFO L93 Difference]: Finished difference Result 130108 states and 534106 transitions. [2019-12-27 08:08:57,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:08:57,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 08:08:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:01,630 INFO L225 Difference]: With dead ends: 130108 [2019-12-27 08:09:01,631 INFO L226 Difference]: Without dead ends: 129996 [2019-12-27 08:09:01,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 08:09:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129996 states. [2019-12-27 08:09:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129996 to 120798. [2019-12-27 08:09:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120798 states. [2019-12-27 08:09:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120798 states to 120798 states and 501253 transitions. [2019-12-27 08:09:08,050 INFO L78 Accepts]: Start accepts. Automaton has 120798 states and 501253 transitions. Word has length 13 [2019-12-27 08:09:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:08,050 INFO L462 AbstractCegarLoop]: Abstraction has 120798 states and 501253 transitions. [2019-12-27 08:09:08,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:09:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 120798 states and 501253 transitions. [2019-12-27 08:09:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:09:08,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:08,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:08,054 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:08,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:08,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1319615161, now seen corresponding path program 1 times [2019-12-27 08:09:08,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:08,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701959512] [2019-12-27 08:09:08,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:08,115 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 08:09:08,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701959512] [2019-12-27 08:09:08,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:08,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:08,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905163376] [2019-12-27 08:09:08,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:08,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:08,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:08,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:08,120 INFO L87 Difference]: Start difference. First operand 120798 states and 501253 transitions. Second operand 3 states. [2019-12-27 08:09:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:11,700 INFO L93 Difference]: Finished difference Result 29480 states and 98975 transitions. [2019-12-27 08:09:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:11,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 08:09:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:11,749 INFO L225 Difference]: With dead ends: 29480 [2019-12-27 08:09:11,750 INFO L226 Difference]: Without dead ends: 29480 [2019-12-27 08:09:11,750 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 08:09:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29480 states. [2019-12-27 08:09:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29480 to 29480. [2019-12-27 08:09:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29480 states. [2019-12-27 08:09:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29480 states to 29480 states and 98975 transitions. [2019-12-27 08:09:12,348 INFO L78 Accepts]: Start accepts. Automaton has 29480 states and 98975 transitions. Word has length 13 [2019-12-27 08:09:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:12,348 INFO L462 AbstractCegarLoop]: Abstraction has 29480 states and 98975 transitions. [2019-12-27 08:09:12,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29480 states and 98975 transitions. [2019-12-27 08:09:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:09:12,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:12,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:12,350 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:12,350 INFO L82 PathProgramCache]: Analyzing trace with hash -856921002, now seen corresponding path program 1 times [2019-12-27 08:09:12,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:12,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619302534] [2019-12-27 08:09:12,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:12,439 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 08:09:12,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619302534] [2019-12-27 08:09:12,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:12,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:12,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711521283] [2019-12-27 08:09:12,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:09:12,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:09:12,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:12,446 INFO L87 Difference]: Start difference. First operand 29480 states and 98975 transitions. Second operand 5 states. [2019-12-27 08:09:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:12,927 INFO L93 Difference]: Finished difference Result 42246 states and 139417 transitions. [2019-12-27 08:09:12,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:09:12,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 08:09:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:13,029 INFO L225 Difference]: With dead ends: 42246 [2019-12-27 08:09:13,029 INFO L226 Difference]: Without dead ends: 42228 [2019-12-27 08:09:13,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42228 states. [2019-12-27 08:09:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42228 to 33417. [2019-12-27 08:09:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33417 states. [2019-12-27 08:09:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33417 states to 33417 states and 111616 transitions. [2019-12-27 08:09:13,955 INFO L78 Accepts]: Start accepts. Automaton has 33417 states and 111616 transitions. Word has length 14 [2019-12-27 08:09:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:13,956 INFO L462 AbstractCegarLoop]: Abstraction has 33417 states and 111616 transitions. [2019-12-27 08:09:13,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:09:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 33417 states and 111616 transitions. [2019-12-27 08:09:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:09:13,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:13,966 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 08:09:13,966 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:13,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1451441927, now seen corresponding path program 1 times [2019-12-27 08:09:13,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:13,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697041616] [2019-12-27 08:09:13,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:14,071 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 08:09:14,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697041616] [2019-12-27 08:09:14,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:14,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:09:14,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180489594] [2019-12-27 08:09:14,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:09:14,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:14,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:09:14,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:14,073 INFO L87 Difference]: Start difference. First operand 33417 states and 111616 transitions. Second operand 6 states. [2019-12-27 08:09:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:14,873 INFO L93 Difference]: Finished difference Result 52783 states and 172326 transitions. [2019-12-27 08:09:14,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:09:14,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:09:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:14,968 INFO L225 Difference]: With dead ends: 52783 [2019-12-27 08:09:14,968 INFO L226 Difference]: Without dead ends: 52753 [2019-12-27 08:09:14,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:09:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52753 states. [2019-12-27 08:09:16,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52753 to 36130. [2019-12-27 08:09:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36130 states. [2019-12-27 08:09:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36130 states to 36130 states and 119897 transitions. [2019-12-27 08:09:16,081 INFO L78 Accepts]: Start accepts. Automaton has 36130 states and 119897 transitions. Word has length 22 [2019-12-27 08:09:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:16,081 INFO L462 AbstractCegarLoop]: Abstraction has 36130 states and 119897 transitions. [2019-12-27 08:09:16,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:09:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 36130 states and 119897 transitions. [2019-12-27 08:09:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:09:16,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:16,091 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 08:09:16,091 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:16,092 INFO L82 PathProgramCache]: Analyzing trace with hash -880932147, now seen corresponding path program 1 times [2019-12-27 08:09:16,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:16,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014189646] [2019-12-27 08:09:16,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:16,215 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 08:09:16,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014189646] [2019-12-27 08:09:16,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:16,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:09:16,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523059870] [2019-12-27 08:09:16,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:09:16,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:09:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:16,217 INFO L87 Difference]: Start difference. First operand 36130 states and 119897 transitions. Second operand 6 states. [2019-12-27 08:09:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:17,020 INFO L93 Difference]: Finished difference Result 61139 states and 197009 transitions. [2019-12-27 08:09:17,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:09:17,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:09:17,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:17,131 INFO L225 Difference]: With dead ends: 61139 [2019-12-27 08:09:17,131 INFO L226 Difference]: Without dead ends: 61109 [2019-12-27 08:09:17,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:09:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61109 states. [2019-12-27 08:09:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61109 to 41888. [2019-12-27 08:09:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-27 08:09:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137110 transitions. [2019-12-27 08:09:18,497 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137110 transitions. Word has length 22 [2019-12-27 08:09:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:18,497 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137110 transitions. [2019-12-27 08:09:18,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:09:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137110 transitions. [2019-12-27 08:09:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:09:18,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:18,508 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 08:09:18,508 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:18,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1606912493, now seen corresponding path program 2 times [2019-12-27 08:09:18,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:18,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572620556] [2019-12-27 08:09:18,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:18,586 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 08:09:18,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572620556] [2019-12-27 08:09:18,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:18,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:09:18,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228353953] [2019-12-27 08:09:18,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:09:18,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:18,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:09:18,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:18,588 INFO L87 Difference]: Start difference. First operand 41888 states and 137110 transitions. Second operand 6 states. [2019-12-27 08:09:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:19,377 INFO L93 Difference]: Finished difference Result 59558 states and 191538 transitions. [2019-12-27 08:09:19,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:09:19,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:09:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:19,494 INFO L225 Difference]: With dead ends: 59558 [2019-12-27 08:09:19,495 INFO L226 Difference]: Without dead ends: 59540 [2019-12-27 08:09:19,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:09:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59540 states. [2019-12-27 08:09:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59540 to 39834. [2019-12-27 08:09:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39834 states. [2019-12-27 08:09:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39834 states to 39834 states and 130144 transitions. [2019-12-27 08:09:20,329 INFO L78 Accepts]: Start accepts. Automaton has 39834 states and 130144 transitions. Word has length 22 [2019-12-27 08:09:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:20,330 INFO L462 AbstractCegarLoop]: Abstraction has 39834 states and 130144 transitions. [2019-12-27 08:09:20,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:09:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 39834 states and 130144 transitions. [2019-12-27 08:09:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:09:20,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:20,345 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 08:09:20,345 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:20,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1210888405, now seen corresponding path program 1 times [2019-12-27 08:09:20,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:20,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829464772] [2019-12-27 08:09:20,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:20,390 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 08:09:20,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829464772] [2019-12-27 08:09:20,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:20,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:20,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970106049] [2019-12-27 08:09:20,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:09:20,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:20,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:09:20,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:09:20,392 INFO L87 Difference]: Start difference. First operand 39834 states and 130144 transitions. Second operand 4 states. [2019-12-27 08:09:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:20,465 INFO L93 Difference]: Finished difference Result 15680 states and 47607 transitions. [2019-12-27 08:09:20,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:09:20,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 08:09:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:20,486 INFO L225 Difference]: With dead ends: 15680 [2019-12-27 08:09:20,487 INFO L226 Difference]: Without dead ends: 15680 [2019-12-27 08:09:20,487 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 08:09:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15680 states. [2019-12-27 08:09:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15680 to 15474. [2019-12-27 08:09:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15474 states. [2019-12-27 08:09:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15474 states to 15474 states and 47012 transitions. [2019-12-27 08:09:20,944 INFO L78 Accepts]: Start accepts. Automaton has 15474 states and 47012 transitions. Word has length 25 [2019-12-27 08:09:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:20,944 INFO L462 AbstractCegarLoop]: Abstraction has 15474 states and 47012 transitions. [2019-12-27 08:09:20,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:09:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 15474 states and 47012 transitions. [2019-12-27 08:09:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 08:09:20,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:20,968 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 08:09:20,968 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1136830823, now seen corresponding path program 1 times [2019-12-27 08:09:20,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:20,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875065681] [2019-12-27 08:09:20,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:21,063 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 08:09:21,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875065681] [2019-12-27 08:09:21,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:21,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:21,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334012121] [2019-12-27 08:09:21,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:21,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:21,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:21,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:21,065 INFO L87 Difference]: Start difference. First operand 15474 states and 47012 transitions. Second operand 3 states. [2019-12-27 08:09:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:21,163 INFO L93 Difference]: Finished difference Result 28148 states and 85452 transitions. [2019-12-27 08:09:21,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:21,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 08:09:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:21,186 INFO L225 Difference]: With dead ends: 28148 [2019-12-27 08:09:21,186 INFO L226 Difference]: Without dead ends: 15947 [2019-12-27 08:09:21,187 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 08:09:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15947 states. [2019-12-27 08:09:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15947 to 15806. [2019-12-27 08:09:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15806 states. [2019-12-27 08:09:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15806 states to 15806 states and 47065 transitions. [2019-12-27 08:09:21,409 INFO L78 Accepts]: Start accepts. Automaton has 15806 states and 47065 transitions. Word has length 39 [2019-12-27 08:09:21,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:21,409 INFO L462 AbstractCegarLoop]: Abstraction has 15806 states and 47065 transitions. [2019-12-27 08:09:21,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 15806 states and 47065 transitions. [2019-12-27 08:09:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 08:09:21,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:21,430 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 08:09:21,431 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:21,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:21,431 INFO L82 PathProgramCache]: Analyzing trace with hash -285407363, now seen corresponding path program 1 times [2019-12-27 08:09:21,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:21,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929903592] [2019-12-27 08:09:21,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:21,497 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 08:09:21,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929903592] [2019-12-27 08:09:21,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:21,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:09:21,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239163291] [2019-12-27 08:09:21,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:09:21,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:21,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:09:21,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:21,500 INFO L87 Difference]: Start difference. First operand 15806 states and 47065 transitions. Second operand 5 states. [2019-12-27 08:09:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:21,594 INFO L93 Difference]: Finished difference Result 14360 states and 43443 transitions. [2019-12-27 08:09:21,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:09:21,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 08:09:21,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:21,620 INFO L225 Difference]: With dead ends: 14360 [2019-12-27 08:09:21,620 INFO L226 Difference]: Without dead ends: 12352 [2019-12-27 08:09:21,621 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 08:09:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12352 states. [2019-12-27 08:09:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12352 to 11736. [2019-12-27 08:09:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11736 states. [2019-12-27 08:09:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11736 states to 11736 states and 36252 transitions. [2019-12-27 08:09:21,910 INFO L78 Accepts]: Start accepts. Automaton has 11736 states and 36252 transitions. Word has length 40 [2019-12-27 08:09:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:21,911 INFO L462 AbstractCegarLoop]: Abstraction has 11736 states and 36252 transitions. [2019-12-27 08:09:21,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:09:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 11736 states and 36252 transitions. [2019-12-27 08:09:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:21,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:21,930 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] [2019-12-27 08:09:21,930 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash 72230609, now seen corresponding path program 1 times [2019-12-27 08:09:21,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:21,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393007169] [2019-12-27 08:09:21,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:21,991 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 08:09:21,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393007169] [2019-12-27 08:09:21,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:21,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:21,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214853599] [2019-12-27 08:09:21,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:21,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:21,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:21,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:21,994 INFO L87 Difference]: Start difference. First operand 11736 states and 36252 transitions. Second operand 3 states. [2019-12-27 08:09:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:22,083 INFO L93 Difference]: Finished difference Result 15466 states and 47136 transitions. [2019-12-27 08:09:22,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:22,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 08:09:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:22,104 INFO L225 Difference]: With dead ends: 15466 [2019-12-27 08:09:22,104 INFO L226 Difference]: Without dead ends: 15466 [2019-12-27 08:09:22,104 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 08:09:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2019-12-27 08:09:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 12452. [2019-12-27 08:09:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12452 states. [2019-12-27 08:09:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12452 states to 12452 states and 38494 transitions. [2019-12-27 08:09:22,319 INFO L78 Accepts]: Start accepts. Automaton has 12452 states and 38494 transitions. Word has length 54 [2019-12-27 08:09:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:22,319 INFO L462 AbstractCegarLoop]: Abstraction has 12452 states and 38494 transitions. [2019-12-27 08:09:22,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 12452 states and 38494 transitions. [2019-12-27 08:09:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:22,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:22,334 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] [2019-12-27 08:09:22,335 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1591694771, now seen corresponding path program 1 times [2019-12-27 08:09:22,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:22,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397816746] [2019-12-27 08:09:22,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:22,427 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 08:09:22,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397816746] [2019-12-27 08:09:22,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:22,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:09:22,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560412534] [2019-12-27 08:09:22,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:09:22,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:22,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:09:22,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:22,430 INFO L87 Difference]: Start difference. First operand 12452 states and 38494 transitions. Second operand 6 states. [2019-12-27 08:09:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:22,902 INFO L93 Difference]: Finished difference Result 37107 states and 113202 transitions. [2019-12-27 08:09:22,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:09:22,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 08:09:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:22,941 INFO L225 Difference]: With dead ends: 37107 [2019-12-27 08:09:22,941 INFO L226 Difference]: Without dead ends: 26417 [2019-12-27 08:09:22,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:09:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26417 states. [2019-12-27 08:09:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26417 to 15311. [2019-12-27 08:09:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 08:09:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 47554 transitions. [2019-12-27 08:09:23,267 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 47554 transitions. Word has length 54 [2019-12-27 08:09:23,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:23,268 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 47554 transitions. [2019-12-27 08:09:23,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:09:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 47554 transitions. [2019-12-27 08:09:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:23,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:23,286 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] [2019-12-27 08:09:23,286 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash 944548917, now seen corresponding path program 2 times [2019-12-27 08:09:23,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:23,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889748779] [2019-12-27 08:09:23,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:23,374 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 08:09:23,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889748779] [2019-12-27 08:09:23,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:23,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:09:23,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550347941] [2019-12-27 08:09:23,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:09:23,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:23,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:09:23,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:23,376 INFO L87 Difference]: Start difference. First operand 15311 states and 47554 transitions. Second operand 7 states. [2019-12-27 08:09:23,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:23,899 INFO L93 Difference]: Finished difference Result 36247 states and 110845 transitions. [2019-12-27 08:09:23,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:09:23,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 08:09:23,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:23,953 INFO L225 Difference]: With dead ends: 36247 [2019-12-27 08:09:23,953 INFO L226 Difference]: Without dead ends: 28238 [2019-12-27 08:09:23,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:09:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28238 states. [2019-12-27 08:09:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28238 to 18156. [2019-12-27 08:09:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18156 states. [2019-12-27 08:09:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18156 states to 18156 states and 56517 transitions. [2019-12-27 08:09:24,387 INFO L78 Accepts]: Start accepts. Automaton has 18156 states and 56517 transitions. Word has length 54 [2019-12-27 08:09:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:24,387 INFO L462 AbstractCegarLoop]: Abstraction has 18156 states and 56517 transitions. [2019-12-27 08:09:24,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:09:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 18156 states and 56517 transitions. [2019-12-27 08:09:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:24,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:24,411 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] [2019-12-27 08:09:24,411 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:24,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:24,412 INFO L82 PathProgramCache]: Analyzing trace with hash -472146899, now seen corresponding path program 3 times [2019-12-27 08:09:24,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:24,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345948682] [2019-12-27 08:09:24,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:24,502 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 08:09:24,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345948682] [2019-12-27 08:09:24,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:24,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:09:24,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731329628] [2019-12-27 08:09:24,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:09:24,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:24,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:09:24,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:24,506 INFO L87 Difference]: Start difference. First operand 18156 states and 56517 transitions. Second operand 7 states. [2019-12-27 08:09:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:24,938 INFO L93 Difference]: Finished difference Result 32612 states and 98652 transitions. [2019-12-27 08:09:24,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 08:09:24,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 08:09:24,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:24,996 INFO L225 Difference]: With dead ends: 32612 [2019-12-27 08:09:24,996 INFO L226 Difference]: Without dead ends: 30521 [2019-12-27 08:09:24,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:09:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30521 states. [2019-12-27 08:09:25,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30521 to 18238. [2019-12-27 08:09:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18238 states. [2019-12-27 08:09:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18238 states to 18238 states and 56811 transitions. [2019-12-27 08:09:25,585 INFO L78 Accepts]: Start accepts. Automaton has 18238 states and 56811 transitions. Word has length 54 [2019-12-27 08:09:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:25,585 INFO L462 AbstractCegarLoop]: Abstraction has 18238 states and 56811 transitions. [2019-12-27 08:09:25,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:09:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18238 states and 56811 transitions. [2019-12-27 08:09:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:25,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:25,614 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] [2019-12-27 08:09:25,614 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:25,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1266055375, now seen corresponding path program 1 times [2019-12-27 08:09:25,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:25,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242513665] [2019-12-27 08:09:25,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:25,661 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 08:09:25,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242513665] [2019-12-27 08:09:25,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:25,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:25,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815128240] [2019-12-27 08:09:25,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:25,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:25,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:25,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:25,663 INFO L87 Difference]: Start difference. First operand 18238 states and 56811 transitions. Second operand 3 states. [2019-12-27 08:09:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:25,780 INFO L93 Difference]: Finished difference Result 20067 states and 60827 transitions. [2019-12-27 08:09:25,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:25,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 08:09:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:25,817 INFO L225 Difference]: With dead ends: 20067 [2019-12-27 08:09:25,818 INFO L226 Difference]: Without dead ends: 20067 [2019-12-27 08:09:25,820 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 08:09:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20067 states. [2019-12-27 08:09:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20067 to 16362. [2019-12-27 08:09:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16362 states. [2019-12-27 08:09:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16362 states to 16362 states and 50310 transitions. [2019-12-27 08:09:26,282 INFO L78 Accepts]: Start accepts. Automaton has 16362 states and 50310 transitions. Word has length 54 [2019-12-27 08:09:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:26,283 INFO L462 AbstractCegarLoop]: Abstraction has 16362 states and 50310 transitions. [2019-12-27 08:09:26,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 16362 states and 50310 transitions. [2019-12-27 08:09:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:26,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:26,312 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] [2019-12-27 08:09:26,312 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:26,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1033313199, now seen corresponding path program 4 times [2019-12-27 08:09:26,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:26,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095367255] [2019-12-27 08:09:26,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:26,419 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 08:09:26,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095367255] [2019-12-27 08:09:26,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:26,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:09:26,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013735170] [2019-12-27 08:09:26,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:09:26,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:26,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:09:26,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:26,424 INFO L87 Difference]: Start difference. First operand 16362 states and 50310 transitions. Second operand 7 states. [2019-12-27 08:09:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:26,794 INFO L93 Difference]: Finished difference Result 32735 states and 97743 transitions. [2019-12-27 08:09:26,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:09:26,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 08:09:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:26,831 INFO L225 Difference]: With dead ends: 32735 [2019-12-27 08:09:26,831 INFO L226 Difference]: Without dead ends: 27615 [2019-12-27 08:09:26,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:09:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27615 states. [2019-12-27 08:09:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27615 to 16518. [2019-12-27 08:09:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16518 states. [2019-12-27 08:09:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16518 states to 16518 states and 50740 transitions. [2019-12-27 08:09:27,169 INFO L78 Accepts]: Start accepts. Automaton has 16518 states and 50740 transitions. Word has length 54 [2019-12-27 08:09:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:27,169 INFO L462 AbstractCegarLoop]: Abstraction has 16518 states and 50740 transitions. [2019-12-27 08:09:27,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:09:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 16518 states and 50740 transitions. [2019-12-27 08:09:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:27,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:27,187 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] [2019-12-27 08:09:27,187 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:27,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:27,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1310665995, now seen corresponding path program 5 times [2019-12-27 08:09:27,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:27,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990338319] [2019-12-27 08:09:27,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:27,269 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 08:09:27,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990338319] [2019-12-27 08:09:27,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:27,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:09:27,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682379075] [2019-12-27 08:09:27,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:09:27,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:27,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:09:27,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:27,271 INFO L87 Difference]: Start difference. First operand 16518 states and 50740 transitions. Second operand 5 states. [2019-12-27 08:09:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:27,837 INFO L93 Difference]: Finished difference Result 25110 states and 74778 transitions. [2019-12-27 08:09:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:09:27,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-27 08:09:27,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:27,872 INFO L225 Difference]: With dead ends: 25110 [2019-12-27 08:09:27,873 INFO L226 Difference]: Without dead ends: 25026 [2019-12-27 08:09:27,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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 08:09:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25026 states. [2019-12-27 08:09:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25026 to 19101. [2019-12-27 08:09:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19101 states. [2019-12-27 08:09:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19101 states to 19101 states and 58187 transitions. [2019-12-27 08:09:28,388 INFO L78 Accepts]: Start accepts. Automaton has 19101 states and 58187 transitions. Word has length 54 [2019-12-27 08:09:28,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:28,388 INFO L462 AbstractCegarLoop]: Abstraction has 19101 states and 58187 transitions. [2019-12-27 08:09:28,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:09:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 19101 states and 58187 transitions. [2019-12-27 08:09:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:28,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:28,407 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] [2019-12-27 08:09:28,407 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:28,408 INFO L82 PathProgramCache]: Analyzing trace with hash 454744557, now seen corresponding path program 6 times [2019-12-27 08:09:28,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:28,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323057887] [2019-12-27 08:09:28,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:28,505 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 08:09:28,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323057887] [2019-12-27 08:09:28,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:28,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:09:28,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161486651] [2019-12-27 08:09:28,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:09:28,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:28,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:09:28,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:28,507 INFO L87 Difference]: Start difference. First operand 19101 states and 58187 transitions. Second operand 7 states. [2019-12-27 08:09:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:29,701 INFO L93 Difference]: Finished difference Result 25883 states and 76771 transitions. [2019-12-27 08:09:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:09:29,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 08:09:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:29,738 INFO L225 Difference]: With dead ends: 25883 [2019-12-27 08:09:29,738 INFO L226 Difference]: Without dead ends: 25883 [2019-12-27 08:09:29,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:09:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25883 states. [2019-12-27 08:09:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25883 to 17612. [2019-12-27 08:09:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17612 states. [2019-12-27 08:09:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17612 states to 17612 states and 53903 transitions. [2019-12-27 08:09:30,066 INFO L78 Accepts]: Start accepts. Automaton has 17612 states and 53903 transitions. Word has length 54 [2019-12-27 08:09:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:30,067 INFO L462 AbstractCegarLoop]: Abstraction has 17612 states and 53903 transitions. [2019-12-27 08:09:30,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:09:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 17612 states and 53903 transitions. [2019-12-27 08:09:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:30,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:30,085 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] [2019-12-27 08:09:30,085 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:30,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1507078609, now seen corresponding path program 7 times [2019-12-27 08:09:30,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:30,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276531220] [2019-12-27 08:09:30,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:30,221 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 08:09:30,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276531220] [2019-12-27 08:09:30,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:30,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 08:09:30,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106074755] [2019-12-27 08:09:30,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:09:30,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:30,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:09:30,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:09:30,224 INFO L87 Difference]: Start difference. First operand 17612 states and 53903 transitions. Second operand 9 states. [2019-12-27 08:09:32,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:32,125 INFO L93 Difference]: Finished difference Result 26122 states and 77334 transitions. [2019-12-27 08:09:32,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 08:09:32,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 08:09:32,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:32,188 INFO L225 Difference]: With dead ends: 26122 [2019-12-27 08:09:32,189 INFO L226 Difference]: Without dead ends: 25996 [2019-12-27 08:09:32,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-27 08:09:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25996 states. [2019-12-27 08:09:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25996 to 18690. [2019-12-27 08:09:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18690 states. [2019-12-27 08:09:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 56851 transitions. [2019-12-27 08:09:32,686 INFO L78 Accepts]: Start accepts. Automaton has 18690 states and 56851 transitions. Word has length 54 [2019-12-27 08:09:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:32,687 INFO L462 AbstractCegarLoop]: Abstraction has 18690 states and 56851 transitions. [2019-12-27 08:09:32,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:09:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 18690 states and 56851 transitions. [2019-12-27 08:09:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:32,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:32,709 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] [2019-12-27 08:09:32,709 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:32,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1799112527, now seen corresponding path program 8 times [2019-12-27 08:09:32,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:32,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149309291] [2019-12-27 08:09:32,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:32,885 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 08:09:32,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149309291] [2019-12-27 08:09:32,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:32,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 08:09:32,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697599708] [2019-12-27 08:09:32,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 08:09:32,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:32,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 08:09:32,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:09:32,886 INFO L87 Difference]: Start difference. First operand 18690 states and 56851 transitions. Second operand 10 states. [2019-12-27 08:09:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:34,455 INFO L93 Difference]: Finished difference Result 32212 states and 94517 transitions. [2019-12-27 08:09:34,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 08:09:34,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 08:09:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:34,500 INFO L225 Difference]: With dead ends: 32212 [2019-12-27 08:09:34,501 INFO L226 Difference]: Without dead ends: 31990 [2019-12-27 08:09:34,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 08:09:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31990 states. [2019-12-27 08:09:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31990 to 22271. [2019-12-27 08:09:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22271 states. [2019-12-27 08:09:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22271 states to 22271 states and 66596 transitions. [2019-12-27 08:09:34,959 INFO L78 Accepts]: Start accepts. Automaton has 22271 states and 66596 transitions. Word has length 54 [2019-12-27 08:09:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:34,959 INFO L462 AbstractCegarLoop]: Abstraction has 22271 states and 66596 transitions. [2019-12-27 08:09:34,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 08:09:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 22271 states and 66596 transitions. [2019-12-27 08:09:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:34,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:34,982 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:34,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:34,982 INFO L82 PathProgramCache]: Analyzing trace with hash 83564179, now seen corresponding path program 9 times [2019-12-27 08:09:34,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:34,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643949364] [2019-12-27 08:09:34,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:35,089 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 08:09:35,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643949364] [2019-12-27 08:09:35,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:35,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 08:09:35,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903848248] [2019-12-27 08:09:35,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 08:09:35,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:35,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 08:09:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:09:35,092 INFO L87 Difference]: Start difference. First operand 22271 states and 66596 transitions. Second operand 8 states. [2019-12-27 08:09:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:36,610 INFO L93 Difference]: Finished difference Result 43546 states and 128389 transitions. [2019-12-27 08:09:36,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 08:09:36,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 08:09:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:36,683 INFO L225 Difference]: With dead ends: 43546 [2019-12-27 08:09:36,683 INFO L226 Difference]: Without dead ends: 43322 [2019-12-27 08:09:36,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 08:09:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43322 states. [2019-12-27 08:09:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43322 to 22306. [2019-12-27 08:09:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22306 states. [2019-12-27 08:09:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22306 states to 22306 states and 66857 transitions. [2019-12-27 08:09:37,473 INFO L78 Accepts]: Start accepts. Automaton has 22306 states and 66857 transitions. Word has length 54 [2019-12-27 08:09:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:37,473 INFO L462 AbstractCegarLoop]: Abstraction has 22306 states and 66857 transitions. [2019-12-27 08:09:37,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 08:09:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 22306 states and 66857 transitions. [2019-12-27 08:09:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:37,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:37,497 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] [2019-12-27 08:09:37,497 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:37,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash 367149589, now seen corresponding path program 10 times [2019-12-27 08:09:37,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:37,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367891856] [2019-12-27 08:09:37,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:37,551 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 08:09:37,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367891856] [2019-12-27 08:09:37,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:37,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:37,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945415761] [2019-12-27 08:09:37,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:37,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:37,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:37,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:37,553 INFO L87 Difference]: Start difference. First operand 22306 states and 66857 transitions. Second operand 3 states. [2019-12-27 08:09:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:37,629 INFO L93 Difference]: Finished difference Result 22306 states and 66855 transitions. [2019-12-27 08:09:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:37,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 08:09:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:37,659 INFO L225 Difference]: With dead ends: 22306 [2019-12-27 08:09:37,659 INFO L226 Difference]: Without dead ends: 22306 [2019-12-27 08:09:37,660 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 08:09:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22306 states. [2019-12-27 08:09:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22306 to 18666. [2019-12-27 08:09:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18666 states. [2019-12-27 08:09:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18666 states to 18666 states and 57066 transitions. [2019-12-27 08:09:37,968 INFO L78 Accepts]: Start accepts. Automaton has 18666 states and 57066 transitions. Word has length 54 [2019-12-27 08:09:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:37,969 INFO L462 AbstractCegarLoop]: Abstraction has 18666 states and 57066 transitions. [2019-12-27 08:09:37,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand 18666 states and 57066 transitions. [2019-12-27 08:09:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:09:37,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:37,989 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] [2019-12-27 08:09:37,989 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash -409945417, now seen corresponding path program 1 times [2019-12-27 08:09:37,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:37,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015198962] [2019-12-27 08:09:37,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:38,041 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 08:09:38,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015198962] [2019-12-27 08:09:38,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:38,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:38,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157379460] [2019-12-27 08:09:38,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:38,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:38,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:38,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:38,043 INFO L87 Difference]: Start difference. First operand 18666 states and 57066 transitions. Second operand 3 states. [2019-12-27 08:09:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:38,118 INFO L93 Difference]: Finished difference Result 14343 states and 43229 transitions. [2019-12-27 08:09:38,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:38,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 08:09:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:38,143 INFO L225 Difference]: With dead ends: 14343 [2019-12-27 08:09:38,144 INFO L226 Difference]: Without dead ends: 14343 [2019-12-27 08:09:38,144 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 08:09:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2019-12-27 08:09:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 13786. [2019-12-27 08:09:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13786 states. [2019-12-27 08:09:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13786 states to 13786 states and 41545 transitions. [2019-12-27 08:09:38,374 INFO L78 Accepts]: Start accepts. Automaton has 13786 states and 41545 transitions. Word has length 55 [2019-12-27 08:09:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:38,375 INFO L462 AbstractCegarLoop]: Abstraction has 13786 states and 41545 transitions. [2019-12-27 08:09:38,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 13786 states and 41545 transitions. [2019-12-27 08:09:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 08:09:38,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:38,392 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash -51181904, now seen corresponding path program 1 times [2019-12-27 08:09:38,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:38,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558530669] [2019-12-27 08:09:38,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:09:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:09:38,522 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:09:38,522 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:09:38,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_43 0) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~weak$$choice0~0_8) (= v_~y~0_18 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2519~0.base_19| 4)) (= 0 v_~x$w_buff0_used~0_106) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_21) (= |v_#NULL.offset_3| 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2519~0.base_19|) (= 0 v_~__unbuffered_p0_EAX~0_18) (= v_~x~0_26 0) (= 0 v_~__unbuffered_cnt~0_21) (= v_~x$flush_delayed~0_13 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~x$r_buff1_thd0~0_26 0) (= 0 v_~x$w_buff0~0_26) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$read_delayed~0_6) (= (store .cse0 |v_ULTIMATE.start_main_~#t2519~0.base_19| 1) |v_#valid_54|) (= 0 v_~weak$$choice2~0_33) (= 0 |v_ULTIMATE.start_main_~#t2519~0.offset_16|) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$r_buff0_thd1~0_71) (= 0 v_~x$r_buff0_thd3~0_20) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2519~0.base_19| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2519~0.base_19|) |v_ULTIMATE.start_main_~#t2519~0.offset_16| 0)) |v_#memory_int_23|) (= v_~x$r_buff1_thd3~0_18 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~z~0_17 0) (= v_~x$r_buff1_thd2~0_20 0) (= v_~main$tmp_guard0~0_11 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2519~0.base_19|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ULTIMATE.start_main_~#t2519~0.base=|v_ULTIMATE.start_main_~#t2519~0.base_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_~#t2519~0.offset=|v_ULTIMATE.start_main_~#t2519~0.offset_16|, ULTIMATE.start_main_~#t2521~0.base=|v_ULTIMATE.start_main_~#t2521~0.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, #length=|v_#length_25|, ~y~0=v_~y~0_18, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ULTIMATE.start_main_~#t2520~0.base=|v_ULTIMATE.start_main_~#t2520~0.base_21|, ULTIMATE.start_main_~#t2521~0.offset=|v_ULTIMATE.start_main_~#t2521~0.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106, ULTIMATE.start_main_~#t2520~0.offset=|v_ULTIMATE.start_main_~#t2520~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_17, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_26, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2519~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2519~0.offset, ULTIMATE.start_main_~#t2521~0.base, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2520~0.base, ULTIMATE.start_main_~#t2521~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2520~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 08:09:38,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2520~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2520~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2520~0.base_13| 1)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2520~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2520~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2520~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2520~0.base_13|) |v_ULTIMATE.start_main_~#t2520~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2520~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2520~0.offset=|v_ULTIMATE.start_main_~#t2520~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2520~0.base=|v_ULTIMATE.start_main_~#t2520~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2520~0.offset, ULTIMATE.start_main_~#t2520~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 08:09:38,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_35) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 08:09:38,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2521~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2521~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2521~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2521~0.base_13| 1) |v_#valid_32|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2521~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2521~0.base_13|) |v_ULTIMATE.start_main_~#t2521~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2521~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2521~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2521~0.offset=|v_ULTIMATE.start_main_~#t2521~0.offset_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2521~0.base=|v_ULTIMATE.start_main_~#t2521~0.base_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2521~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2521~0.base, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 08:09:38,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1448227939 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1448227939 256) 0))) (or (and (= ~x~0_In1448227939 |P2Thread1of1ForFork1_#t~ite32_Out1448227939|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out1448227939| ~x$w_buff1~0_In1448227939) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1448227939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1448227939, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1448227939, ~x~0=~x~0_In1448227939} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1448227939|, ~x$w_buff1~0=~x$w_buff1~0_In1448227939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1448227939, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1448227939, ~x~0=~x~0_In1448227939} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 08:09:38,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 08:09:38,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In346099760 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In346099760 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out346099760| ~x$w_buff0_used~0_In346099760)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out346099760| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In346099760, ~x$w_buff0_used~0=~x$w_buff0_used~0_In346099760} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out346099760|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In346099760, ~x$w_buff0_used~0=~x$w_buff0_used~0_In346099760} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 08:09:38,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1871164731 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1871164731 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1871164731 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-1871164731 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1871164731|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1871164731 |P2Thread1of1ForFork1_#t~ite35_Out-1871164731|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1871164731, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1871164731, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1871164731, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1871164731} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1871164731|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1871164731, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1871164731, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1871164731, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1871164731} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 08:09:38,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-724365778 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-724365778 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-724365778| ~x$r_buff0_thd3~0_In-724365778) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-724365778| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-724365778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-724365778} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-724365778|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-724365778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-724365778} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 08:09:38,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-532217266 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-532217266 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-532217266 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-532217266 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-532217266| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite37_Out-532217266| ~x$r_buff1_thd3~0_In-532217266)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-532217266, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-532217266, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-532217266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-532217266} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-532217266|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-532217266, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-532217266, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-532217266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-532217266} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 08:09:38,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_13 |v_P2Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 08:09:38,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-788951506 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_In-788951506| |P0Thread1of1ForFork2_#t~ite11_Out-788951506|) (= |P0Thread1of1ForFork2_#t~ite12_Out-788951506| ~x$w_buff1~0_In-788951506) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite12_Out-788951506| |P0Thread1of1ForFork2_#t~ite11_Out-788951506|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-788951506 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-788951506 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-788951506 256))) (= (mod ~x$w_buff0_used~0_In-788951506 256) 0))) (= ~x$w_buff1~0_In-788951506 |P0Thread1of1ForFork2_#t~ite11_Out-788951506|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-788951506, ~x$w_buff1~0=~x$w_buff1~0_In-788951506, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-788951506, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-788951506, ~weak$$choice2~0=~weak$$choice2~0_In-788951506, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-788951506|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-788951506} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-788951506, ~x$w_buff1~0=~x$w_buff1~0_In-788951506, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-788951506, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-788951506, ~weak$$choice2~0=~weak$$choice2~0_In-788951506, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-788951506|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-788951506|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-788951506} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 08:09:38,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1450437073 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1450437073 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1450437073 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1450437073 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1450437073 256))))) (= |P0Thread1of1ForFork2_#t~ite14_Out1450437073| |P0Thread1of1ForFork2_#t~ite15_Out1450437073|) (= |P0Thread1of1ForFork2_#t~ite14_Out1450437073| ~x$w_buff0_used~0_In1450437073)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out1450437073| ~x$w_buff0_used~0_In1450437073) (= |P0Thread1of1ForFork2_#t~ite14_In1450437073| |P0Thread1of1ForFork2_#t~ite14_Out1450437073|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1450437073, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1450437073, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1450437073, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1450437073|, ~weak$$choice2~0=~weak$$choice2~0_In1450437073, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1450437073} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1450437073, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1450437073, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1450437073|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1450437073, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1450437073|, ~weak$$choice2~0=~weak$$choice2~0_In1450437073, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1450437073} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 08:09:38,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_21, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 08:09:38,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-650697134 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_In-650697134| |P0Thread1of1ForFork2_#t~ite23_Out-650697134|) (= |P0Thread1of1ForFork2_#t~ite24_Out-650697134| ~x$r_buff1_thd1~0_In-650697134) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite24_Out-650697134| |P0Thread1of1ForFork2_#t~ite23_Out-650697134|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-650697134 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-650697134 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-650697134 256))) (= 0 (mod ~x$w_buff0_used~0_In-650697134 256)))) (= ~x$r_buff1_thd1~0_In-650697134 |P0Thread1of1ForFork2_#t~ite23_Out-650697134|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-650697134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-650697134, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-650697134, ~weak$$choice2~0=~weak$$choice2~0_In-650697134, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-650697134|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-650697134} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-650697134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-650697134, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-650697134, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-650697134|, ~weak$$choice2~0=~weak$$choice2~0_In-650697134, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-650697134|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-650697134} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 08:09:38,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_5 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 08:09:38,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-706916695 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-706916695 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-706916695|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-706916695| ~x$w_buff0_used~0_In-706916695)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-706916695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706916695} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-706916695, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-706916695|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706916695} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 08:09:38,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-361006874 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-361006874 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-361006874 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-361006874 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-361006874|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-361006874 |P1Thread1of1ForFork0_#t~ite29_Out-361006874|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-361006874, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-361006874, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-361006874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-361006874} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-361006874, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-361006874, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-361006874, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-361006874|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-361006874} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 08:09:38,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-588880876 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-588880876 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-588880876 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_Out-588880876 ~x$r_buff0_thd2~0_In-588880876)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-588880876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-588880876} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-588880876|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-588880876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-588880876} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 08:09:38,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In-1344805129 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1344805129 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1344805129 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1344805129 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-1344805129| ~x$r_buff1_thd2~0_In-1344805129) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1344805129| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1344805129, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1344805129, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1344805129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1344805129} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1344805129|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1344805129, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1344805129, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1344805129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1344805129} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 08:09:38,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L777-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 08:09:38,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 08:09:38,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out-813657013| |ULTIMATE.start_main_#t~ite42_Out-813657013|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-813657013 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-813657013 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~x$w_buff1~0_In-813657013 |ULTIMATE.start_main_#t~ite41_Out-813657013|)) (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite41_Out-813657013| ~x~0_In-813657013)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-813657013, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-813657013, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-813657013, ~x~0=~x~0_In-813657013} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-813657013|, ~x$w_buff1~0=~x$w_buff1~0_In-813657013, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-813657013, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-813657013, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-813657013|, ~x~0=~x~0_In-813657013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 08:09:38,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In449975590 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In449975590 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out449975590| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out449975590| ~x$w_buff0_used~0_In449975590) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In449975590, ~x$w_buff0_used~0=~x$w_buff0_used~0_In449975590} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In449975590, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out449975590|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In449975590} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 08:09:38,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1847232697 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1847232697 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1847232697 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1847232697 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1847232697|)) (and (= ~x$w_buff1_used~0_In-1847232697 |ULTIMATE.start_main_#t~ite44_Out-1847232697|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1847232697, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1847232697, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1847232697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1847232697} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1847232697, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1847232697, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1847232697, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1847232697|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1847232697} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 08:09:38,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In958724882 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In958724882 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In958724882 |ULTIMATE.start_main_#t~ite45_Out958724882|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out958724882|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In958724882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In958724882} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In958724882, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out958724882|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In958724882} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 08:09:38,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-890872761 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-890872761 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-890872761 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-890872761 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-890872761|)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-890872761 |ULTIMATE.start_main_#t~ite46_Out-890872761|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-890872761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-890872761, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-890872761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-890872761} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-890872761, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-890872761|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-890872761, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-890872761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-890872761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 08:09:38,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_19 |v_ULTIMATE.start_main_#t~ite46_13|) (= 2 v_~z~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_10 2) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~z~0=v_~z~0_9, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_9, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:09:38,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:09:38 BasicIcfg [2019-12-27 08:09:38,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:09:38,647 INFO L168 Benchmark]: Toolchain (without parser) took 75989.88 ms. Allocated memory was 144.2 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 08:09:38,647 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 08:09:38,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.08 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 154.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:38,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.82 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:38,648 INFO L168 Benchmark]: Boogie Preprocessor took 44.80 ms. Allocated memory is still 201.3 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:38,651 INFO L168 Benchmark]: RCFGBuilder took 783.94 ms. Allocated memory is still 201.3 MB. Free memory was 150.0 MB in the beginning and 103.3 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:38,651 INFO L168 Benchmark]: TraceAbstraction took 74258.22 ms. Allocated memory was 201.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 103.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 08:09:38,659 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.08 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 154.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.82 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.80 ms. Allocated memory is still 201.3 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 783.94 ms. Allocated memory is still 201.3 MB. Free memory was 150.0 MB in the beginning and 103.3 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 74258.22 ms. Allocated memory was 201.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 103.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 162 ProgramPointsBefore, 85 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 6364 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75290 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2519, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2520, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2521, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 73.9s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4599 SDtfs, 4778 SDslu, 11650 SDs, 0 SdLazy, 7687 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 58 SyntacticMatches, 17 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120798occurred 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: 28.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 182243 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 974 NumberOfCodeBlocks, 974 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 895 ConstructedInterpolants, 0 QuantifiedInterpolants, 147057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...