/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:31:15,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:31:15,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:31:15,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:31:15,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:31:15,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:31:15,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:31:15,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:31:15,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:31:15,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:31:15,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:31:15,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:31:15,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:31:15,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:31:15,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:31:15,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:31:15,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:31:15,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:31:15,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:31:15,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:31:15,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:31:15,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:31:15,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:31:15,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:31:15,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:31:15,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:31:15,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:31:15,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:31:15,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:31:15,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:31:15,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:31:15,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:31:15,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:31:15,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:31:15,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:31:15,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:31:15,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:31:15,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:31:15,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:31:15,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:31:15,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:31:15,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:31:15,551 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:31:15,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:31:15,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:31:15,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:31:15,554 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:31:15,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:31:15,554 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:31:15,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:31:15,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:31:15,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:31:15,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:31:15,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:31:15,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:31:15,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:31:15,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:31:15,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:31:15,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:31:15,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:31:15,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:31:15,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:31:15,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:31:15,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:31:15,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:31:15,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:31:15,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:31:15,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:31:15,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:31:15,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:31:15,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:31:15,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:31:15,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:31:15,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:31:15,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:31:15,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:31:15,854 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:31:15,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i [2019-12-18 13:31:15,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739c756f7/3d06881a4a5a4e97b3989731cb2130c8/FLAG198510243 [2019-12-18 13:31:16,465 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:31:16,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i [2019-12-18 13:31:16,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739c756f7/3d06881a4a5a4e97b3989731cb2130c8/FLAG198510243 [2019-12-18 13:31:16,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739c756f7/3d06881a4a5a4e97b3989731cb2130c8 [2019-12-18 13:31:16,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:31:16,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:31:16,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:16,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:31:16,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:31:16,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:16" (1/1) ... [2019-12-18 13:31:16,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a840ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:16, skipping insertion in model container [2019-12-18 13:31:16,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:16" (1/1) ... [2019-12-18 13:31:16,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:31:16,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:31:17,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:17,365 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:31:17,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:17,553 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:31:17,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17 WrapperNode [2019-12-18 13:31:17,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:17,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:17,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:31:17,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:31:17,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (1/1) ... [2019-12-18 13:31:17,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (1/1) ... [2019-12-18 13:31:17,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:17,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:31:17,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:31:17,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:31:17,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (1/1) ... [2019-12-18 13:31:17,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (1/1) ... [2019-12-18 13:31:17,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (1/1) ... [2019-12-18 13:31:17,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (1/1) ... [2019-12-18 13:31:17,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (1/1) ... [2019-12-18 13:31:17,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (1/1) ... [2019-12-18 13:31:17,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (1/1) ... [2019-12-18 13:31:17,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:31:17,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:31:17,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:31:17,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:31:17,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (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-18 13:31:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:31:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:31:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:31:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:31:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:31:17,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:31:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:31:17,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:31:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:31:17,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:31:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:31:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:31:17,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:31:17,730 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:31:18,489 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:31:18,490 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:31:18,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:18 BoogieIcfgContainer [2019-12-18 13:31:18,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:31:18,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:31:18,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:31:18,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:31:18,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:31:16" (1/3) ... [2019-12-18 13:31:18,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89d8609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:18, skipping insertion in model container [2019-12-18 13:31:18,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:17" (2/3) ... [2019-12-18 13:31:18,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89d8609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:18, skipping insertion in model container [2019-12-18 13:31:18,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:18" (3/3) ... [2019-12-18 13:31:18,500 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.oepc.i [2019-12-18 13:31:18,511 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:31:18,511 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:31:18,519 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:31:18,520 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:31:18,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,564 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,564 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,573 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,573 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,598 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,598 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,626 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,628 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,635 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,636 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,636 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,638 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,638 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:18,655 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:31:18,676 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:31:18,676 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:31:18,676 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:31:18,676 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:31:18,676 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:31:18,676 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:31:18,677 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:31:18,677 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:31:18,694 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 13:31:18,696 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:31:18,784 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:31:18,785 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:18,803 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:31:18,831 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:31:18,888 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:31:18,888 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:18,899 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:31:18,920 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:31:18,921 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:31:24,341 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 13:31:24,756 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:31:24,888 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:31:24,915 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-18 13:31:24,915 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 13:31:24,919 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 13:31:38,239 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 13:31:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 13:31:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:31:38,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:38,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:31:38,246 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:38,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-18 13:31:38,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:38,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681612825] [2019-12-18 13:31:38,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:38,473 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-18 13:31:38,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681612825] [2019-12-18 13:31:38,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:38,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:31:38,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867976578] [2019-12-18 13:31:38,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:38,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:38,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:38,495 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 13:31:41,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:41,632 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-18 13:31:41,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:41,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:31:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:42,232 INFO L225 Difference]: With dead ends: 101544 [2019-12-18 13:31:42,232 INFO L226 Difference]: Without dead ends: 95304 [2019-12-18 13:31:42,233 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-18 13:31:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-18 13:31:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-18 13:31:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-18 13:31:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-18 13:31:53,866 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-18 13:31:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:53,866 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-18 13:31:53,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-18 13:31:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:31:53,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:53,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:53,871 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:53,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-18 13:31:53,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:53,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239747563] [2019-12-18 13:31:53,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:54,013 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-18 13:31:54,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239747563] [2019-12-18 13:31:54,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:54,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:54,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815238682] [2019-12-18 13:31:54,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:54,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:54,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:54,016 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-18 13:31:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:55,057 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-18 13:31:55,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:55,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:31:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:59,947 INFO L225 Difference]: With dead ends: 152040 [2019-12-18 13:31:59,947 INFO L226 Difference]: Without dead ends: 151991 [2019-12-18 13:31:59,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-18 13:32:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-18 13:32:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-18 13:32:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-18 13:32:08,225 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-18 13:32:08,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:08,226 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-18 13:32:08,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-18 13:32:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:32:08,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:08,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:08,241 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:08,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-18 13:32:08,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:08,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894687668] [2019-12-18 13:32:08,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:08,335 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-18 13:32:08,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894687668] [2019-12-18 13:32:08,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:08,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:08,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159840681] [2019-12-18 13:32:08,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:08,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:08,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:08,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:08,337 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-18 13:32:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:08,465 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-18 13:32:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:08,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:32:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:12,621 INFO L225 Difference]: With dead ends: 30915 [2019-12-18 13:32:12,622 INFO L226 Difference]: Without dead ends: 30915 [2019-12-18 13:32:12,623 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-18 13:32:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-18 13:32:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-18 13:32:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-18 13:32:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-18 13:32:13,397 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-18 13:32:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:13,397 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-18 13:32:13,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-18 13:32:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:32:13,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:13,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:13,403 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-18 13:32:13,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:13,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176792011] [2019-12-18 13:32:13,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:13,517 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-18 13:32:13,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176792011] [2019-12-18 13:32:13,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:13,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:13,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588809613] [2019-12-18 13:32:13,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:13,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:13,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:13,522 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-18 13:32:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:13,912 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-18 13:32:13,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:13,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:32:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:14,013 INFO L225 Difference]: With dead ends: 38538 [2019-12-18 13:32:14,013 INFO L226 Difference]: Without dead ends: 38538 [2019-12-18 13:32:14,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-18 13:32:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-18 13:32:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-18 13:32:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-18 13:32:15,115 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-18 13:32:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:15,116 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-18 13:32:15,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-18 13:32:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:32:15,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:15,125 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-18 13:32:15,125 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:15,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-18 13:32:15,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:15,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623976188] [2019-12-18 13:32:15,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:15,224 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-18 13:32:15,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623976188] [2019-12-18 13:32:15,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:15,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:15,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564930791] [2019-12-18 13:32:15,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:15,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:15,226 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-18 13:32:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:15,817 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-18 13:32:15,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:32:15,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:32:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:15,902 INFO L225 Difference]: With dead ends: 44779 [2019-12-18 13:32:15,903 INFO L226 Difference]: Without dead ends: 44772 [2019-12-18 13:32:15,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-18 13:32:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-18 13:32:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-18 13:32:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-18 13:32:16,538 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-18 13:32:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:16,539 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-18 13:32:16,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-18 13:32:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:32:16,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:16,550 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-18 13:32:16,551 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:16,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:16,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-18 13:32:16,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:16,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009115985] [2019-12-18 13:32:16,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:16,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009115985] [2019-12-18 13:32:16,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:16,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:16,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988733596] [2019-12-18 13:32:16,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:16,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:16,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:16,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:16,615 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-18 13:32:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:16,677 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-18 13:32:16,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:32:16,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:32:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:16,696 INFO L225 Difference]: With dead ends: 13768 [2019-12-18 13:32:16,697 INFO L226 Difference]: Without dead ends: 13768 [2019-12-18 13:32:16,697 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-18 13:32:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-18 13:32:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-18 13:32:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-18 13:32:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-18 13:32:16,893 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-18 13:32:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:16,893 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-18 13:32:16,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-18 13:32:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:32:16,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:16,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:16,904 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:16,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-18 13:32:16,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:16,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159720479] [2019-12-18 13:32:16,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:16,944 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-18 13:32:16,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159720479] [2019-12-18 13:32:16,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:16,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:16,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126881077] [2019-12-18 13:32:16,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:16,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:16,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:16,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:16,946 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-18 13:32:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:17,027 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-18 13:32:17,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:17,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:32:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:17,053 INFO L225 Difference]: With dead ends: 19309 [2019-12-18 13:32:17,053 INFO L226 Difference]: Without dead ends: 19309 [2019-12-18 13:32:17,054 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-18 13:32:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-18 13:32:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-18 13:32:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-18 13:32:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-18 13:32:17,370 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-18 13:32:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:17,370 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-18 13:32:17,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-18 13:32:17,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:32:17,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:17,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:17,380 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:17,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:17,380 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-18 13:32:17,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:17,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581553421] [2019-12-18 13:32:17,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:17,422 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-18 13:32:17,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581553421] [2019-12-18 13:32:17,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:17,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:17,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519614776] [2019-12-18 13:32:17,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:17,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:17,425 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-18 13:32:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:17,548 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-18 13:32:17,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:17,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:32:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:17,586 INFO L225 Difference]: With dead ends: 21037 [2019-12-18 13:32:17,586 INFO L226 Difference]: Without dead ends: 21037 [2019-12-18 13:32:17,587 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-18 13:32:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-18 13:32:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-18 13:32:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-18 13:32:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-18 13:32:17,857 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-18 13:32:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:17,858 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-18 13:32:17,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-18 13:32:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:32:17,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:17,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:17,874 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:17,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-18 13:32:17,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:17,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233424714] [2019-12-18 13:32:17,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:17,952 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-18 13:32:17,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233424714] [2019-12-18 13:32:17,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:17,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:17,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276362607] [2019-12-18 13:32:17,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:32:17,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:17,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:32:17,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:17,954 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-18 13:32:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:18,524 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-18 13:32:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:32:18,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:32:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:18,585 INFO L225 Difference]: With dead ends: 29609 [2019-12-18 13:32:18,585 INFO L226 Difference]: Without dead ends: 29609 [2019-12-18 13:32:18,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-18 13:32:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-18 13:32:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-18 13:32:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-18 13:32:18,913 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-18 13:32:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:18,914 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-18 13:32:18,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:32:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-18 13:32:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:32:18,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:18,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:18,928 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-18 13:32:18,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:18,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424306842] [2019-12-18 13:32:18,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:19,002 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-18 13:32:19,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424306842] [2019-12-18 13:32:19,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:19,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:19,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370629601] [2019-12-18 13:32:19,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:32:19,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:19,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:32:19,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:19,004 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-18 13:32:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:19,559 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-18 13:32:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:32:19,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 13:32:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:19,598 INFO L225 Difference]: With dead ends: 28968 [2019-12-18 13:32:19,598 INFO L226 Difference]: Without dead ends: 28968 [2019-12-18 13:32:19,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-18 13:32:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-18 13:32:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-18 13:32:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-18 13:32:20,053 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-18 13:32:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:20,053 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-18 13:32:20,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:32:20,053 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-18 13:32:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:32:20,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:20,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:20,072 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:20,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-18 13:32:20,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:20,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314975650] [2019-12-18 13:32:20,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:20,181 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-18 13:32:20,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314975650] [2019-12-18 13:32:20,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:20,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:20,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008500921] [2019-12-18 13:32:20,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:20,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:20,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:20,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:20,184 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-18 13:32:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:21,402 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-18 13:32:21,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:32:21,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:32:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:21,456 INFO L225 Difference]: With dead ends: 38372 [2019-12-18 13:32:21,456 INFO L226 Difference]: Without dead ends: 38372 [2019-12-18 13:32:21,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:32:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-18 13:32:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-18 13:32:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-18 13:32:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-18 13:32:21,872 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-18 13:32:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:21,872 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-18 13:32:21,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-18 13:32:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:32:21,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:21,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:21,892 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:21,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-18 13:32:21,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:21,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906346451] [2019-12-18 13:32:21,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:22,021 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-18 13:32:22,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906346451] [2019-12-18 13:32:22,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:22,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:22,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408020026] [2019-12-18 13:32:22,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:32:22,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:32:22,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:32:22,025 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-18 13:32:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:23,823 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-18 13:32:23,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:32:23,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 13:32:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:23,883 INFO L225 Difference]: With dead ends: 45317 [2019-12-18 13:32:23,883 INFO L226 Difference]: Without dead ends: 45317 [2019-12-18 13:32:23,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:32:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-18 13:32:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-18 13:32:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-18 13:32:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-18 13:32:24,483 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-18 13:32:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:24,483 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-18 13:32:24,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:32:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-18 13:32:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:32:24,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:24,502 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] [2019-12-18 13:32:24,502 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-18 13:32:24,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:24,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132001683] [2019-12-18 13:32:24,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:24,619 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-18 13:32:24,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132001683] [2019-12-18 13:32:24,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:24,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:24,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852638268] [2019-12-18 13:32:24,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:24,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:24,622 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-18 13:32:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:25,949 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-18 13:32:25,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:32:25,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:32:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:26,027 INFO L225 Difference]: With dead ends: 34977 [2019-12-18 13:32:26,027 INFO L226 Difference]: Without dead ends: 34977 [2019-12-18 13:32:26,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:32:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-18 13:32:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-18 13:32:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-18 13:32:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-18 13:32:26,456 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-18 13:32:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:26,457 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-18 13:32:26,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-18 13:32:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:32:26,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:26,475 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] [2019-12-18 13:32:26,475 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:26,476 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-18 13:32:26,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:26,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213540545] [2019-12-18 13:32:26,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:26,633 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-18 13:32:26,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213540545] [2019-12-18 13:32:26,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:26,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:26,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766774465] [2019-12-18 13:32:26,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:32:26,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:32:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:32:26,635 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 8 states. [2019-12-18 13:32:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:27,922 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-18 13:32:27,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:32:27,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 13:32:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:27,980 INFO L225 Difference]: With dead ends: 43257 [2019-12-18 13:32:27,980 INFO L226 Difference]: Without dead ends: 43257 [2019-12-18 13:32:27,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:32:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-18 13:32:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-18 13:32:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-18 13:32:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-18 13:32:28,532 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-18 13:32:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:28,532 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-18 13:32:28,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:32:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-18 13:32:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:32:28,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:28,549 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] [2019-12-18 13:32:28,549 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:28,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-18 13:32:28,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:28,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573776084] [2019-12-18 13:32:28,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:28,674 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-18 13:32:28,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573776084] [2019-12-18 13:32:28,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:28,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:28,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941665715] [2019-12-18 13:32:28,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:32:28,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:32:28,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:32:28,676 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 8 states. [2019-12-18 13:32:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:30,292 INFO L93 Difference]: Finished difference Result 39307 states and 113638 transitions. [2019-12-18 13:32:30,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:32:30,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 13:32:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:30,357 INFO L225 Difference]: With dead ends: 39307 [2019-12-18 13:32:30,357 INFO L226 Difference]: Without dead ends: 39307 [2019-12-18 13:32:30,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:32:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39307 states. [2019-12-18 13:32:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39307 to 16673. [2019-12-18 13:32:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-18 13:32:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 49752 transitions. [2019-12-18 13:32:30,732 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 49752 transitions. Word has length 34 [2019-12-18 13:32:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:30,732 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 49752 transitions. [2019-12-18 13:32:30,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:32:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 49752 transitions. [2019-12-18 13:32:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:32:30,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:30,754 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-18 13:32:30,754 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:30,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:30,755 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-18 13:32:30,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:30,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692707997] [2019-12-18 13:32:30,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:30,821 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-18 13:32:30,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692707997] [2019-12-18 13:32:30,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:30,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:32:30,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554580828] [2019-12-18 13:32:30,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:30,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:30,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:30,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:30,823 INFO L87 Difference]: Start difference. First operand 16673 states and 49752 transitions. Second operand 3 states. [2019-12-18 13:32:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:30,888 INFO L93 Difference]: Finished difference Result 16672 states and 49750 transitions. [2019-12-18 13:32:30,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:30,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:32:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:30,921 INFO L225 Difference]: With dead ends: 16672 [2019-12-18 13:32:30,921 INFO L226 Difference]: Without dead ends: 16672 [2019-12-18 13:32:30,921 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-18 13:32:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-18 13:32:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-18 13:32:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-18 13:32:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 49750 transitions. [2019-12-18 13:32:31,337 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 49750 transitions. Word has length 39 [2019-12-18 13:32:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:31,338 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 49750 transitions. [2019-12-18 13:32:31,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 49750 transitions. [2019-12-18 13:32:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:32:31,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:31,372 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-18 13:32:31,372 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:31,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:31,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-18 13:32:31,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:31,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968463651] [2019-12-18 13:32:31,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:31,445 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-18 13:32:31,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968463651] [2019-12-18 13:32:31,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:31,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:31,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386013811] [2019-12-18 13:32:31,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:31,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:31,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:31,448 INFO L87 Difference]: Start difference. First operand 16672 states and 49750 transitions. Second operand 5 states. [2019-12-18 13:32:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:32,028 INFO L93 Difference]: Finished difference Result 24748 states and 73091 transitions. [2019-12-18 13:32:32,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:32:32,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:32:32,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:32,063 INFO L225 Difference]: With dead ends: 24748 [2019-12-18 13:32:32,063 INFO L226 Difference]: Without dead ends: 24748 [2019-12-18 13:32:32,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24748 states. [2019-12-18 13:32:32,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24748 to 22823. [2019-12-18 13:32:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22823 states. [2019-12-18 13:32:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22823 states to 22823 states and 67863 transitions. [2019-12-18 13:32:32,502 INFO L78 Accepts]: Start accepts. Automaton has 22823 states and 67863 transitions. Word has length 40 [2019-12-18 13:32:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:32,502 INFO L462 AbstractCegarLoop]: Abstraction has 22823 states and 67863 transitions. [2019-12-18 13:32:32,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:32,503 INFO L276 IsEmpty]: Start isEmpty. Operand 22823 states and 67863 transitions. [2019-12-18 13:32:32,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:32:32,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:32,533 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-18 13:32:32,533 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 2 times [2019-12-18 13:32:32,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:32,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220392065] [2019-12-18 13:32:32,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:32,583 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-18 13:32:32,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220392065] [2019-12-18 13:32:32,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:32,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:32,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317661598] [2019-12-18 13:32:32,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:32,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:32,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:32,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:32,585 INFO L87 Difference]: Start difference. First operand 22823 states and 67863 transitions. Second operand 5 states. [2019-12-18 13:32:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:32,695 INFO L93 Difference]: Finished difference Result 21512 states and 64877 transitions. [2019-12-18 13:32:32,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:32,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:32:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:32,729 INFO L225 Difference]: With dead ends: 21512 [2019-12-18 13:32:32,729 INFO L226 Difference]: Without dead ends: 21512 [2019-12-18 13:32:32,729 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-18 13:32:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21512 states. [2019-12-18 13:32:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21512 to 20553. [2019-12-18 13:32:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20553 states. [2019-12-18 13:32:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20553 states to 20553 states and 62291 transitions. [2019-12-18 13:32:33,026 INFO L78 Accepts]: Start accepts. Automaton has 20553 states and 62291 transitions. Word has length 40 [2019-12-18 13:32:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:33,026 INFO L462 AbstractCegarLoop]: Abstraction has 20553 states and 62291 transitions. [2019-12-18 13:32:33,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 20553 states and 62291 transitions. [2019-12-18 13:32:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:33,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:33,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:33,049 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:33,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1274465795, now seen corresponding path program 1 times [2019-12-18 13:32:33,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:33,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152376565] [2019-12-18 13:32:33,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:33,171 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-18 13:32:33,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152376565] [2019-12-18 13:32:33,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:33,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:33,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153640234] [2019-12-18 13:32:33,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:33,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:33,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:33,173 INFO L87 Difference]: Start difference. First operand 20553 states and 62291 transitions. Second operand 9 states. [2019-12-18 13:32:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:34,668 INFO L93 Difference]: Finished difference Result 113167 states and 338070 transitions. [2019-12-18 13:32:34,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:32:34,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:32:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:34,819 INFO L225 Difference]: With dead ends: 113167 [2019-12-18 13:32:34,819 INFO L226 Difference]: Without dead ends: 102388 [2019-12-18 13:32:34,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:32:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102388 states. [2019-12-18 13:32:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102388 to 22199. [2019-12-18 13:32:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22199 states. [2019-12-18 13:32:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22199 states to 22199 states and 67466 transitions. [2019-12-18 13:32:35,950 INFO L78 Accepts]: Start accepts. Automaton has 22199 states and 67466 transitions. Word has length 64 [2019-12-18 13:32:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:35,951 INFO L462 AbstractCegarLoop]: Abstraction has 22199 states and 67466 transitions. [2019-12-18 13:32:35,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 22199 states and 67466 transitions. [2019-12-18 13:32:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:35,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:35,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:35,975 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:35,976 INFO L82 PathProgramCache]: Analyzing trace with hash 977977381, now seen corresponding path program 2 times [2019-12-18 13:32:35,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:35,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623717429] [2019-12-18 13:32:35,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:36,224 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-18 13:32:36,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623717429] [2019-12-18 13:32:36,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:36,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:36,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316995859] [2019-12-18 13:32:36,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:36,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:36,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:36,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:36,227 INFO L87 Difference]: Start difference. First operand 22199 states and 67466 transitions. Second operand 9 states. [2019-12-18 13:32:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:38,065 INFO L93 Difference]: Finished difference Result 124401 states and 369385 transitions. [2019-12-18 13:32:38,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 13:32:38,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:32:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:38,197 INFO L225 Difference]: With dead ends: 124401 [2019-12-18 13:32:38,197 INFO L226 Difference]: Without dead ends: 85486 [2019-12-18 13:32:38,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 13:32:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85486 states. [2019-12-18 13:32:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85486 to 24242. [2019-12-18 13:32:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24242 states. [2019-12-18 13:32:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24242 states to 24242 states and 73548 transitions. [2019-12-18 13:32:39,363 INFO L78 Accepts]: Start accepts. Automaton has 24242 states and 73548 transitions. Word has length 64 [2019-12-18 13:32:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:39,363 INFO L462 AbstractCegarLoop]: Abstraction has 24242 states and 73548 transitions. [2019-12-18 13:32:39,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 24242 states and 73548 transitions. [2019-12-18 13:32:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:39,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:39,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:39,396 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:39,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2145716829, now seen corresponding path program 3 times [2019-12-18 13:32:39,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:39,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994584391] [2019-12-18 13:32:39,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:39,487 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-18 13:32:39,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994584391] [2019-12-18 13:32:39,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:39,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:39,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726741929] [2019-12-18 13:32:39,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:39,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:39,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:39,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:39,489 INFO L87 Difference]: Start difference. First operand 24242 states and 73548 transitions. Second operand 7 states. [2019-12-18 13:32:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:40,068 INFO L93 Difference]: Finished difference Result 65697 states and 196530 transitions. [2019-12-18 13:32:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:32:40,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:32:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:40,143 INFO L225 Difference]: With dead ends: 65697 [2019-12-18 13:32:40,143 INFO L226 Difference]: Without dead ends: 48931 [2019-12-18 13:32:40,143 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-18 13:32:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48931 states. [2019-12-18 13:32:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48931 to 28935. [2019-12-18 13:32:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28935 states. [2019-12-18 13:32:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28935 states to 28935 states and 87711 transitions. [2019-12-18 13:32:40,755 INFO L78 Accepts]: Start accepts. Automaton has 28935 states and 87711 transitions. Word has length 64 [2019-12-18 13:32:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:40,755 INFO L462 AbstractCegarLoop]: Abstraction has 28935 states and 87711 transitions. [2019-12-18 13:32:40,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 28935 states and 87711 transitions. [2019-12-18 13:32:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:40,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:40,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:40,788 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1938623561, now seen corresponding path program 4 times [2019-12-18 13:32:40,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:40,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925501613] [2019-12-18 13:32:40,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:40,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925501613] [2019-12-18 13:32:40,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:40,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:40,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236957624] [2019-12-18 13:32:40,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:40,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:40,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:40,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:40,868 INFO L87 Difference]: Start difference. First operand 28935 states and 87711 transitions. Second operand 7 states. [2019-12-18 13:32:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:41,555 INFO L93 Difference]: Finished difference Result 60534 states and 179399 transitions. [2019-12-18 13:32:41,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:32:41,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:32:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:41,688 INFO L225 Difference]: With dead ends: 60534 [2019-12-18 13:32:41,689 INFO L226 Difference]: Without dead ends: 50677 [2019-12-18 13:32:41,689 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-18 13:32:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50677 states. [2019-12-18 13:32:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50677 to 28971. [2019-12-18 13:32:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28971 states. [2019-12-18 13:32:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28971 states to 28971 states and 87768 transitions. [2019-12-18 13:32:42,778 INFO L78 Accepts]: Start accepts. Automaton has 28971 states and 87768 transitions. Word has length 64 [2019-12-18 13:32:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:42,778 INFO L462 AbstractCegarLoop]: Abstraction has 28971 states and 87768 transitions. [2019-12-18 13:32:42,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 28971 states and 87768 transitions. [2019-12-18 13:32:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:42,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:42,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:32:42,810 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:42,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash 987860387, now seen corresponding path program 5 times [2019-12-18 13:32:42,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:42,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130919990] [2019-12-18 13:32:42,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:42,870 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-18 13:32:42,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130919990] [2019-12-18 13:32:42,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:42,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:42,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231144545] [2019-12-18 13:32:42,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:42,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:42,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:42,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:42,873 INFO L87 Difference]: Start difference. First operand 28971 states and 87768 transitions. Second operand 3 states. [2019-12-18 13:32:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:43,031 INFO L93 Difference]: Finished difference Result 33655 states and 101965 transitions. [2019-12-18 13:32:43,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:43,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:32:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:43,077 INFO L225 Difference]: With dead ends: 33655 [2019-12-18 13:32:43,077 INFO L226 Difference]: Without dead ends: 33655 [2019-12-18 13:32:43,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 13:32:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33655 states. [2019-12-18 13:32:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33655 to 29400. [2019-12-18 13:32:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29400 states. [2019-12-18 13:32:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29400 states to 29400 states and 89486 transitions. [2019-12-18 13:32:43,572 INFO L78 Accepts]: Start accepts. Automaton has 29400 states and 89486 transitions. Word has length 64 [2019-12-18 13:32:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:43,573 INFO L462 AbstractCegarLoop]: Abstraction has 29400 states and 89486 transitions. [2019-12-18 13:32:43,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 29400 states and 89486 transitions. [2019-12-18 13:32:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:32:43,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:43,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:43,613 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1658299500, now seen corresponding path program 1 times [2019-12-18 13:32:43,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:43,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760309589] [2019-12-18 13:32:43,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:43,665 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-18 13:32:43,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760309589] [2019-12-18 13:32:43,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:43,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:43,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241606367] [2019-12-18 13:32:43,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:43,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:43,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:43,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:43,668 INFO L87 Difference]: Start difference. First operand 29400 states and 89486 transitions. Second operand 3 states. [2019-12-18 13:32:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:43,903 INFO L93 Difference]: Finished difference Result 38998 states and 119012 transitions. [2019-12-18 13:32:43,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:43,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:32:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:43,962 INFO L225 Difference]: With dead ends: 38998 [2019-12-18 13:32:43,962 INFO L226 Difference]: Without dead ends: 38998 [2019-12-18 13:32:43,962 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-18 13:32:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38998 states. [2019-12-18 13:32:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38998 to 30000. [2019-12-18 13:32:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30000 states. [2019-12-18 13:32:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30000 states to 30000 states and 91395 transitions. [2019-12-18 13:32:44,482 INFO L78 Accepts]: Start accepts. Automaton has 30000 states and 91395 transitions. Word has length 65 [2019-12-18 13:32:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:44,482 INFO L462 AbstractCegarLoop]: Abstraction has 30000 states and 91395 transitions. [2019-12-18 13:32:44,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 30000 states and 91395 transitions. [2019-12-18 13:32:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:32:44,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:44,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:44,517 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:44,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1628140134, now seen corresponding path program 1 times [2019-12-18 13:32:44,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:44,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051120374] [2019-12-18 13:32:44,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:44,631 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-18 13:32:44,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051120374] [2019-12-18 13:32:44,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:44,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:44,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172755584] [2019-12-18 13:32:44,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:44,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:44,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:44,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:44,632 INFO L87 Difference]: Start difference. First operand 30000 states and 91395 transitions. Second operand 9 states. [2019-12-18 13:32:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:46,361 INFO L93 Difference]: Finished difference Result 102344 states and 302426 transitions. [2019-12-18 13:32:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:32:46,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:32:46,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:46,501 INFO L225 Difference]: With dead ends: 102344 [2019-12-18 13:32:46,501 INFO L226 Difference]: Without dead ends: 92281 [2019-12-18 13:32:46,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:32:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92281 states. [2019-12-18 13:32:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92281 to 30925. [2019-12-18 13:32:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30925 states. [2019-12-18 13:32:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30925 states to 30925 states and 94032 transitions. [2019-12-18 13:32:47,449 INFO L78 Accepts]: Start accepts. Automaton has 30925 states and 94032 transitions. Word has length 65 [2019-12-18 13:32:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:47,449 INFO L462 AbstractCegarLoop]: Abstraction has 30925 states and 94032 transitions. [2019-12-18 13:32:47,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 30925 states and 94032 transitions. [2019-12-18 13:32:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:32:47,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:47,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:47,485 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2044306796, now seen corresponding path program 2 times [2019-12-18 13:32:47,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:47,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131390739] [2019-12-18 13:32:47,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:47,635 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-18 13:32:47,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131390739] [2019-12-18 13:32:47,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:47,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:47,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251771247] [2019-12-18 13:32:47,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:47,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:47,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:47,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:47,638 INFO L87 Difference]: Start difference. First operand 30925 states and 94032 transitions. Second operand 9 states. [2019-12-18 13:32:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:48,920 INFO L93 Difference]: Finished difference Result 87072 states and 257707 transitions. [2019-12-18 13:32:48,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:32:48,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:32:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:49,049 INFO L225 Difference]: With dead ends: 87072 [2019-12-18 13:32:49,049 INFO L226 Difference]: Without dead ends: 82634 [2019-12-18 13:32:49,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:32:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82634 states. [2019-12-18 13:32:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82634 to 29489. [2019-12-18 13:32:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29489 states. [2019-12-18 13:32:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29489 states to 29489 states and 89558 transitions. [2019-12-18 13:32:50,144 INFO L78 Accepts]: Start accepts. Automaton has 29489 states and 89558 transitions. Word has length 65 [2019-12-18 13:32:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:50,145 INFO L462 AbstractCegarLoop]: Abstraction has 29489 states and 89558 transitions. [2019-12-18 13:32:50,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 29489 states and 89558 transitions. [2019-12-18 13:32:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:32:50,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:50,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:50,181 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1227831362, now seen corresponding path program 3 times [2019-12-18 13:32:50,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:50,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538117370] [2019-12-18 13:32:50,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:50,241 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-18 13:32:50,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538117370] [2019-12-18 13:32:50,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:50,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:50,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752405421] [2019-12-18 13:32:50,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:50,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:50,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:50,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:50,243 INFO L87 Difference]: Start difference. First operand 29489 states and 89558 transitions. Second operand 4 states. [2019-12-18 13:32:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:50,406 INFO L93 Difference]: Finished difference Result 29176 states and 88431 transitions. [2019-12-18 13:32:50,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:32:50,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:32:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:50,448 INFO L225 Difference]: With dead ends: 29176 [2019-12-18 13:32:50,448 INFO L226 Difference]: Without dead ends: 29176 [2019-12-18 13:32:50,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29176 states. [2019-12-18 13:32:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29176 to 27319. [2019-12-18 13:32:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27319 states. [2019-12-18 13:32:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27319 states to 27319 states and 82548 transitions. [2019-12-18 13:32:50,884 INFO L78 Accepts]: Start accepts. Automaton has 27319 states and 82548 transitions. Word has length 65 [2019-12-18 13:32:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:50,885 INFO L462 AbstractCegarLoop]: Abstraction has 27319 states and 82548 transitions. [2019-12-18 13:32:50,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 27319 states and 82548 transitions. [2019-12-18 13:32:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:32:50,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:50,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:50,914 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1591414325, now seen corresponding path program 1 times [2019-12-18 13:32:50,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:50,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735343766] [2019-12-18 13:32:50,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:50,968 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-18 13:32:50,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735343766] [2019-12-18 13:32:50,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:50,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:50,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767254507] [2019-12-18 13:32:50,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:50,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:50,969 INFO L87 Difference]: Start difference. First operand 27319 states and 82548 transitions. Second operand 3 states. [2019-12-18 13:32:51,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:51,084 INFO L93 Difference]: Finished difference Result 27319 states and 82547 transitions. [2019-12-18 13:32:51,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:51,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:32:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:51,123 INFO L225 Difference]: With dead ends: 27319 [2019-12-18 13:32:51,123 INFO L226 Difference]: Without dead ends: 27319 [2019-12-18 13:32:51,123 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-18 13:32:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27319 states. [2019-12-18 13:32:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27319 to 22916. [2019-12-18 13:32:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22916 states. [2019-12-18 13:32:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22916 states to 22916 states and 70400 transitions. [2019-12-18 13:32:51,503 INFO L78 Accepts]: Start accepts. Automaton has 22916 states and 70400 transitions. Word has length 65 [2019-12-18 13:32:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:51,504 INFO L462 AbstractCegarLoop]: Abstraction has 22916 states and 70400 transitions. [2019-12-18 13:32:51,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 22916 states and 70400 transitions. [2019-12-18 13:32:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:32:51,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:51,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:51,529 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:51,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1016088422, now seen corresponding path program 1 times [2019-12-18 13:32:51,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:51,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761492454] [2019-12-18 13:32:51,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:51,577 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-18 13:32:51,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761492454] [2019-12-18 13:32:51,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:51,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:51,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368652173] [2019-12-18 13:32:51,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:51,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:51,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:51,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:51,579 INFO L87 Difference]: Start difference. First operand 22916 states and 70400 transitions. Second operand 3 states. [2019-12-18 13:32:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:51,754 INFO L93 Difference]: Finished difference Result 19993 states and 60264 transitions. [2019-12-18 13:32:51,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:51,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:32:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:51,782 INFO L225 Difference]: With dead ends: 19993 [2019-12-18 13:32:51,783 INFO L226 Difference]: Without dead ends: 19993 [2019-12-18 13:32:51,783 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-18 13:32:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19993 states. [2019-12-18 13:32:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19993 to 18183. [2019-12-18 13:32:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18183 states. [2019-12-18 13:32:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18183 states to 18183 states and 54770 transitions. [2019-12-18 13:32:52,074 INFO L78 Accepts]: Start accepts. Automaton has 18183 states and 54770 transitions. Word has length 66 [2019-12-18 13:32:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:52,074 INFO L462 AbstractCegarLoop]: Abstraction has 18183 states and 54770 transitions. [2019-12-18 13:32:52,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 18183 states and 54770 transitions. [2019-12-18 13:32:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:32:52,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:52,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:52,093 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-18 13:32:52,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:52,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405352078] [2019-12-18 13:32:52,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:32:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:32:52,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:32:52,234 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:32:52,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 |v_ULTIMATE.start_main_~#t1105~0.offset_34|) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1105~0.base_55|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1105~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1105~0.base_55|) |v_ULTIMATE.start_main_~#t1105~0.offset_34| 0)) |v_#memory_int_21|) (= v_~a$r_buff0_thd3~0_364 0) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= |v_#valid_91| (store .cse0 |v_ULTIMATE.start_main_~#t1105~0.base_55| 1)) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (= 0 |v_#NULL.base_4|) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1105~0.base_55| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1105~0.base_55|) 0) (= v_~x~0_91 0) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1107~0.offset=|v_ULTIMATE.start_main_~#t1107~0.offset_20|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ULTIMATE.start_main_~#t1106~0.base=|v_ULTIMATE.start_main_~#t1106~0.base_41|, ULTIMATE.start_main_~#t1105~0.base=|v_ULTIMATE.start_main_~#t1105~0.base_55|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1105~0.offset=|v_ULTIMATE.start_main_~#t1105~0.offset_34|, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ULTIMATE.start_main_~#t1106~0.offset=|v_ULTIMATE.start_main_~#t1106~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_~#t1107~0.base=|v_ULTIMATE.start_main_~#t1107~0.base_28|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_75, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1107~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1106~0.base, ULTIMATE.start_main_~#t1105~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1105~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t1106~0.offset, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1107~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 13:32:52,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff1_thd3~0_Out380714775 ~a$r_buff0_thd3~0_In380714775) (= ~a$r_buff1_thd1~0_Out380714775 ~a$r_buff0_thd1~0_In380714775) (= ~a$r_buff0_thd1~0_Out380714775 1) (= ~a$r_buff0_thd0~0_In380714775 ~a$r_buff1_thd0~0_Out380714775) (= ~a$r_buff1_thd2~0_Out380714775 ~a$r_buff0_thd2~0_In380714775) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In380714775 0)) (= ~x~0_In380714775 ~__unbuffered_p0_EAX~0_Out380714775)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In380714775, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In380714775, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In380714775, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In380714775, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In380714775, ~x~0=~x~0_In380714775} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out380714775, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out380714775, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out380714775, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out380714775, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out380714775, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In380714775, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In380714775, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In380714775, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out380714775, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In380714775, ~x~0=~x~0_In380714775} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:32:52,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1106~0.base_9| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1106~0.base_9| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1106~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1106~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1106~0.base_9|) |v_ULTIMATE.start_main_~#t1106~0.offset_7| 1))) (= |v_ULTIMATE.start_main_~#t1106~0.offset_7| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1106~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1106~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1106~0.offset=|v_ULTIMATE.start_main_~#t1106~0.offset_7|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1106~0.base=|v_ULTIMATE.start_main_~#t1106~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1106~0.offset, #length, ULTIMATE.start_main_~#t1106~0.base] because there is no mapped edge [2019-12-18 13:32:52,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t1107~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1107~0.base_9|)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1107~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1107~0.base_9|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1107~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1107~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1107~0.base_9|) |v_ULTIMATE.start_main_~#t1107~0.offset_8| 2))) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1107~0.base_9| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1107~0.offset=|v_ULTIMATE.start_main_~#t1107~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1107~0.base=|v_ULTIMATE.start_main_~#t1107~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1107~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1107~0.base] because there is no mapped edge [2019-12-18 13:32:52,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out-494240283| |P1Thread1of1ForFork2_#t~ite9_Out-494240283|)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-494240283 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-494240283 256) 0))) (or (and (not .cse0) .cse1 (= ~a$w_buff1~0_In-494240283 |P1Thread1of1ForFork2_#t~ite9_Out-494240283|) (not .cse2)) (and .cse1 (= ~a~0_In-494240283 |P1Thread1of1ForFork2_#t~ite9_Out-494240283|) (or .cse2 .cse0)))) InVars {~a~0=~a~0_In-494240283, ~a$w_buff1~0=~a$w_buff1~0_In-494240283, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-494240283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-494240283} OutVars{~a~0=~a~0_In-494240283, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-494240283|, ~a$w_buff1~0=~a$w_buff1~0_In-494240283, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-494240283, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-494240283|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-494240283} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 13:32:52,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In91546019 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In91546019 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out91546019| ~a$w_buff0_used~0_In91546019)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out91546019| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In91546019, ~a$w_buff0_used~0=~a$w_buff0_used~0_In91546019} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In91546019, ~a$w_buff0_used~0=~a$w_buff0_used~0_In91546019, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out91546019|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:32:52,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In467789190 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In467789190 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In467789190 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In467789190 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out467789190| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out467789190| ~a$w_buff1_used~0_In467789190) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In467789190, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In467789190, ~a$w_buff0_used~0=~a$w_buff0_used~0_In467789190, ~a$w_buff1_used~0=~a$w_buff1_used~0_In467789190} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In467789190, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In467789190, ~a$w_buff0_used~0=~a$w_buff0_used~0_In467789190, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out467789190|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In467789190} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:32:52,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2034466814 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out2034466814| ~a$w_buff0~0_In2034466814) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In2034466814| |P2Thread1of1ForFork0_#t~ite20_Out2034466814|)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out2034466814| |P2Thread1of1ForFork0_#t~ite21_Out2034466814|) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out2034466814| ~a$w_buff0~0_In2034466814) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2034466814 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In2034466814 256) 0)) (and .cse1 (= (mod ~a$w_buff1_used~0_In2034466814 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In2034466814 256))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In2034466814, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2034466814, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2034466814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2034466814, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2034466814, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In2034466814|, ~weak$$choice2~0=~weak$$choice2~0_In2034466814} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out2034466814|, ~a$w_buff0~0=~a$w_buff0~0_In2034466814, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2034466814, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2034466814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2034466814, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out2034466814|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2034466814, ~weak$$choice2~0=~weak$$choice2~0_In2034466814} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 13:32:52,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-386168452 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-386168452 256)))) (or (and (= ~a$r_buff0_thd2~0_In-386168452 |P1Thread1of1ForFork2_#t~ite13_Out-386168452|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-386168452|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-386168452, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-386168452} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-386168452, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-386168452, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-386168452|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:32:52,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-247113926 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-247113926 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-247113926 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-247113926 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-247113926| ~a$r_buff1_thd2~0_In-247113926)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-247113926| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-247113926, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-247113926, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-247113926, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-247113926} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-247113926, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-247113926, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-247113926, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-247113926, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-247113926|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:32:52,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:32:52,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2124216118 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-2124216118| |P2Thread1of1ForFork0_#t~ite23_Out-2124216118|) (= ~a$w_buff1~0_In-2124216118 |P2Thread1of1ForFork0_#t~ite24_Out-2124216118|)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out-2124216118| |P2Thread1of1ForFork0_#t~ite23_Out-2124216118|) .cse0 (= ~a$w_buff1~0_In-2124216118 |P2Thread1of1ForFork0_#t~ite23_Out-2124216118|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-2124216118 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In-2124216118 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In-2124216118 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In-2124216118 256) 0) .cse1)))))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-2124216118, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-2124216118|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2124216118, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2124216118, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2124216118, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2124216118, ~weak$$choice2~0=~weak$$choice2~0_In-2124216118} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-2124216118, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-2124216118|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-2124216118|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2124216118, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2124216118, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2124216118, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2124216118, ~weak$$choice2~0=~weak$$choice2~0_In-2124216118} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 13:32:52,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2142051816 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-2142051816| |P2Thread1of1ForFork0_#t~ite26_Out-2142051816|) .cse0 (= ~a$w_buff0_used~0_In-2142051816 |P2Thread1of1ForFork0_#t~ite26_Out-2142051816|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-2142051816 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-2142051816 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-2142051816 256))) (= 0 (mod ~a$w_buff0_used~0_In-2142051816 256))))) (and (= ~a$w_buff0_used~0_In-2142051816 |P2Thread1of1ForFork0_#t~ite27_Out-2142051816|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-2142051816| |P2Thread1of1ForFork0_#t~ite26_Out-2142051816|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-2142051816|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2142051816, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2142051816, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2142051816, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2142051816, ~weak$$choice2~0=~weak$$choice2~0_In-2142051816} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-2142051816|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-2142051816|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2142051816, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2142051816, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2142051816, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2142051816, ~weak$$choice2~0=~weak$$choice2~0_In-2142051816} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 13:32:52,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:32:52,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 13:32:52,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1108939919 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1108939919 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1108939919| ~a$w_buff1~0_In-1108939919)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1108939919| ~a~0_In-1108939919) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-1108939919, ~a$w_buff1~0=~a$w_buff1~0_In-1108939919, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1108939919, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1108939919} OutVars{~a~0=~a~0_In-1108939919, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1108939919|, ~a$w_buff1~0=~a$w_buff1~0_In-1108939919, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1108939919, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1108939919} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:32:52,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:32:52,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-57959045 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-57959045 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-57959045|) (not .cse1)) (and (= ~a$w_buff0_used~0_In-57959045 |P2Thread1of1ForFork0_#t~ite40_Out-57959045|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-57959045, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-57959045} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-57959045|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-57959045, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-57959045} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:32:52,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1980040914 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1980040914 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1980040914|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1980040914 |P0Thread1of1ForFork1_#t~ite5_Out-1980040914|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1980040914, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1980040914} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1980040914|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1980040914, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1980040914} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:32:52,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-2105613132 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-2105613132 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-2105613132 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-2105613132 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-2105613132| ~a$w_buff1_used~0_In-2105613132) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-2105613132|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2105613132, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2105613132, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2105613132, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2105613132} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2105613132|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2105613132, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2105613132, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2105613132, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2105613132} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:32:52,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-388182011 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-388182011 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out-388182011 ~a$r_buff0_thd1~0_In-388182011) (or .cse0 .cse1)) (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-388182011 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-388182011, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-388182011} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-388182011|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-388182011, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-388182011} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:32:52,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-576776579 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-576776579 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-576776579 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-576776579 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-576776579| ~a$r_buff1_thd1~0_In-576776579) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-576776579| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-576776579, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-576776579, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-576776579, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-576776579} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-576776579|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-576776579, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-576776579, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-576776579, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-576776579} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:32:52,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:32:52,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1493621512 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In1493621512 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1493621512 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1493621512 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1493621512|)) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1493621512 |P2Thread1of1ForFork0_#t~ite41_Out1493621512|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1493621512, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1493621512, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1493621512, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1493621512} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1493621512, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1493621512, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1493621512, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1493621512, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1493621512|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:32:52,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1777738785 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-1777738785 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1777738785| ~a$r_buff0_thd3~0_In-1777738785)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1777738785| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1777738785, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1777738785} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1777738785, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1777738785, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1777738785|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:32:52,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd3~0_In2119007598 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In2119007598 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2119007598 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2119007598 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out2119007598|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$r_buff1_thd3~0_In2119007598 |P2Thread1of1ForFork0_#t~ite43_Out2119007598|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2119007598, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2119007598, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2119007598, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2119007598} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2119007598|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2119007598, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2119007598, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2119007598, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2119007598} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:32:52,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:32:52,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:32:52,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In116130106 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out116130106| |ULTIMATE.start_main_#t~ite47_Out116130106|)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In116130106 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In116130106 |ULTIMATE.start_main_#t~ite47_Out116130106|) .cse2) (and (= ~a$w_buff1~0_In116130106 |ULTIMATE.start_main_#t~ite47_Out116130106|) (not .cse1) .cse2 (not .cse0)))) InVars {~a~0=~a~0_In116130106, ~a$w_buff1~0=~a$w_buff1~0_In116130106, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In116130106, ~a$w_buff1_used~0=~a$w_buff1_used~0_In116130106} OutVars{~a~0=~a~0_In116130106, ~a$w_buff1~0=~a$w_buff1~0_In116130106, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out116130106|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In116130106, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out116130106|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In116130106} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:32:52,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In117522236 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In117522236 256)))) (or (and (= ~a$w_buff0_used~0_In117522236 |ULTIMATE.start_main_#t~ite49_Out117522236|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out117522236|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In117522236, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In117522236} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In117522236, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out117522236|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In117522236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:32:52,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd0~0_In2104893378 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In2104893378 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In2104893378 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In2104893378 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In2104893378 |ULTIMATE.start_main_#t~ite50_Out2104893378|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out2104893378| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2104893378, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2104893378, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2104893378, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2104893378} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2104893378|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2104893378, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2104893378, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2104893378, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2104893378} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:32:52,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-681108308 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-681108308 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-681108308| 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-681108308 |ULTIMATE.start_main_#t~ite51_Out-681108308|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-681108308, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-681108308} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-681108308|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-681108308, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-681108308} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:32:52,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In524211337 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In524211337 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In524211337 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In524211337 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out524211337| ~a$r_buff1_thd0~0_In524211337) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out524211337| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In524211337, ~a$w_buff0_used~0=~a$w_buff0_used~0_In524211337, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In524211337, ~a$w_buff1_used~0=~a$w_buff1_used~0_In524211337} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out524211337|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In524211337, ~a$w_buff0_used~0=~a$w_buff0_used~0_In524211337, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In524211337, ~a$w_buff1_used~0=~a$w_buff1_used~0_In524211337} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:32:52,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:32:52,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:32:52 BasicIcfg [2019-12-18 13:32:52,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:32:52,388 INFO L168 Benchmark]: Toolchain (without parser) took 95634.36 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 102.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 13:32:52,388 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:32:52,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.47 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 156.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:52,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.56 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:52,390 INFO L168 Benchmark]: Boogie Preprocessor took 39.11 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:52,390 INFO L168 Benchmark]: RCFGBuilder took 837.65 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 101.1 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:52,391 INFO L168 Benchmark]: TraceAbstraction took 93884.67 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:32:52,399 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.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 801.47 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 156.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.56 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.11 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.65 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 101.1 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93884.67 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7302 VarBasedMoverChecksPositive, 250 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 93.5s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 34.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6840 SDtfs, 9756 SDslu, 18776 SDs, 0 SdLazy, 10128 SolverSat, 559 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 48 SyntacticMatches, 13 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred 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: 35.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 491991 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1264 NumberOfCodeBlocks, 1264 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 193663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...