/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:32:18,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:32:18,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:32:18,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:32:18,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:32:18,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:32:18,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:32:18,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:32:18,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:32:18,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:32:18,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:32:18,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:32:18,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:32:18,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:32:18,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:32:18,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:32:18,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:32:18,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:32:18,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:32:18,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:32:18,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:32:18,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:32:18,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:32:18,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:32:18,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:32:18,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:32:18,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:32:18,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:32:18,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:32:18,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:32:18,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:32:18,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:32:18,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:32:18,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:32:18,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:32:18,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:32:18,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:32:18,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:32:18,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:32:18,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:32:18,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:32:18,304 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:32:18,318 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:32:18,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:32:18,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:32:18,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:32:18,320 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:32:18,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:32:18,320 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:32:18,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:32:18,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:32:18,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:32:18,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:32:18,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:32:18,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:32:18,322 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:32:18,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:32:18,322 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:32:18,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:32:18,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:32:18,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:32:18,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:32:18,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:32:18,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:32:18,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:32:18,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:32:18,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:32:18,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:32:18,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:32:18,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:32:18,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:32:18,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:32:18,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:32:18,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:32:18,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:32:18,673 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:32:18,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2019-12-27 01:32:18,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc8c83fa/85fac0276bc44291ab03e39fe4a7769b/FLAG713e9932a [2019-12-27 01:32:19,262 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:32:19,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2019-12-27 01:32:19,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc8c83fa/85fac0276bc44291ab03e39fe4a7769b/FLAG713e9932a [2019-12-27 01:32:19,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc8c83fa/85fac0276bc44291ab03e39fe4a7769b [2019-12-27 01:32:19,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:32:19,564 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:32:19,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:32:19,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:32:19,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:32:19,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:32:19" (1/1) ... [2019-12-27 01:32:19,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79dc7cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:19, skipping insertion in model container [2019-12-27 01:32:19,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:32:19" (1/1) ... [2019-12-27 01:32:19,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:32:19,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:32:20,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:32:20,269 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:32:20,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:32:20,433 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:32:20,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20 WrapperNode [2019-12-27 01:32:20,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:32:20,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:32:20,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:32:20,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:32:20,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (1/1) ... [2019-12-27 01:32:20,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (1/1) ... [2019-12-27 01:32:20,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:32:20,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:32:20,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:32:20,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:32:20,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (1/1) ... [2019-12-27 01:32:20,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (1/1) ... [2019-12-27 01:32:20,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (1/1) ... [2019-12-27 01:32:20,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (1/1) ... [2019-12-27 01:32:20,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (1/1) ... [2019-12-27 01:32:20,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (1/1) ... [2019-12-27 01:32:20,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (1/1) ... [2019-12-27 01:32:20,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:32:20,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:32:20,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:32:20,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:32:20,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:32:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:32:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:32:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:32:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:32:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:32:20,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:32:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:32:20,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:32:20,604 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:32:20,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:32:20,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:32:20,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:32:20,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:32:20,610 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:32:21,454 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:32:21,455 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:32:21,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:32:21 BoogieIcfgContainer [2019-12-27 01:32:21,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:32:21,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:32:21,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:32:21,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:32:21,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:32:19" (1/3) ... [2019-12-27 01:32:21,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657f3d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:32:21, skipping insertion in model container [2019-12-27 01:32:21,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:32:20" (2/3) ... [2019-12-27 01:32:21,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657f3d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:32:21, skipping insertion in model container [2019-12-27 01:32:21,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:32:21" (3/3) ... [2019-12-27 01:32:21,464 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_power.oepc.i [2019-12-27 01:32:21,473 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:32:21,473 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:32:21,483 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:32:21,484 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:32:21,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,534 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,534 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,562 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,562 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,606 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,609 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,618 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:32:21,644 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:32:21,664 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:32:21,664 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:32:21,665 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:32:21,665 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:32:21,665 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:32:21,665 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:32:21,665 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:32:21,665 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:32:21,682 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 01:32:21,684 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 01:32:21,791 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 01:32:21,791 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:32:21,807 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:32:21,832 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 01:32:21,888 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 01:32:21,888 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:32:21,896 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:32:21,917 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:32:21,919 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:32:26,550 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-27 01:32:27,302 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 01:32:27,455 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 01:32:27,594 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-27 01:32:27,594 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 01:32:27,598 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-27 01:32:46,314 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-27 01:32:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-27 01:32:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:32:46,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:32:46,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:32:46,322 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:32:46,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:32:46,328 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-27 01:32:46,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:32:46,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636416967] [2019-12-27 01:32:46,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:32:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:32:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:32:46,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636416967] [2019-12-27 01:32:46,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:32:46,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:32:46,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233160759] [2019-12-27 01:32:46,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:32:46,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:32:46,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:32:46,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:32:46,594 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-27 01:32:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:32:49,952 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-27 01:32:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:32:49,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:32:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:32:50,613 INFO L225 Difference]: With dead ends: 116858 [2019-12-27 01:32:50,613 INFO L226 Difference]: Without dead ends: 110138 [2019-12-27 01:32:50,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:32:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-27 01:33:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-27 01:33:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-27 01:33:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-27 01:33:00,974 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-27 01:33:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:00,974 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-27 01:33:00,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:33:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-27 01:33:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:33:00,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:00,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:00,978 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-27 01:33:00,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:00,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313092916] [2019-12-27 01:33:00,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:01,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313092916] [2019-12-27 01:33:01,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:01,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:33:01,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750674664] [2019-12-27 01:33:01,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:33:01,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:01,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:33:01,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:33:01,084 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-27 01:33:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:07,067 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-27 01:33:07,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:33:07,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:33:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:07,682 INFO L225 Difference]: With dead ends: 170904 [2019-12-27 01:33:07,683 INFO L226 Difference]: Without dead ends: 170855 [2019-12-27 01:33:07,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:33:13,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-27 01:33:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-27 01:33:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-27 01:33:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-27 01:33:17,558 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-27 01:33:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:17,559 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-27 01:33:17,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:33:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-27 01:33:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:33:17,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:17,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:17,567 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:17,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:17,567 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-27 01:33:17,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:17,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521087452] [2019-12-27 01:33:17,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:17,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521087452] [2019-12-27 01:33:17,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:17,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:33:17,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69777866] [2019-12-27 01:33:17,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:33:17,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:33:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:17,644 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-27 01:33:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:17,762 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-27 01:33:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:33:17,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:33:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:17,826 INFO L225 Difference]: With dead ends: 33673 [2019-12-27 01:33:17,826 INFO L226 Difference]: Without dead ends: 33673 [2019-12-27 01:33:17,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-27 01:33:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-27 01:33:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-27 01:33:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-27 01:33:23,274 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-27 01:33:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:23,275 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-27 01:33:23,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:33:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-27 01:33:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:33:23,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:23,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:23,281 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-27 01:33:23,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:23,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893097998] [2019-12-27 01:33:23,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:23,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893097998] [2019-12-27 01:33:23,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:23,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:33:23,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189089261] [2019-12-27 01:33:23,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:33:23,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:23,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:33:23,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:33:23,366 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-27 01:33:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:23,749 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-27 01:33:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:33:23,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:33:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:23,818 INFO L225 Difference]: With dead ends: 42056 [2019-12-27 01:33:23,818 INFO L226 Difference]: Without dead ends: 42056 [2019-12-27 01:33:23,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:33:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-27 01:33:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-27 01:33:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-27 01:33:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-27 01:33:25,031 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-27 01:33:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:25,034 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-27 01:33:25,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:33:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-27 01:33:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:33:25,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:25,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:25,043 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-27 01:33:25,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:25,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748390433] [2019-12-27 01:33:25,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:25,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748390433] [2019-12-27 01:33:25,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:25,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:33:25,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586031172] [2019-12-27 01:33:25,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:33:25,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:25,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:33:25,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:33:25,155 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-27 01:33:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:25,804 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-27 01:33:25,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:33:25,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:33:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:25,891 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 01:33:25,891 INFO L226 Difference]: Without dead ends: 48530 [2019-12-27 01:33:25,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:33:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-27 01:33:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-27 01:33:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-27 01:33:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-27 01:33:26,668 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-27 01:33:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:26,668 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-27 01:33:26,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:33:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-27 01:33:26,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:33:26,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:26,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:26,681 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:26,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:26,681 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-27 01:33:26,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:26,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127047224] [2019-12-27 01:33:26,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:26,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127047224] [2019-12-27 01:33:26,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:26,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:33:26,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923409590] [2019-12-27 01:33:26,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:33:26,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:33:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:33:26,739 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 4 states. [2019-12-27 01:33:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:26,799 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-27 01:33:26,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:33:26,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:33:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:26,820 INFO L225 Difference]: With dead ends: 14576 [2019-12-27 01:33:26,820 INFO L226 Difference]: Without dead ends: 14576 [2019-12-27 01:33:26,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:33:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-27 01:33:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-27 01:33:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-27 01:33:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-27 01:33:27,040 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-27 01:33:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:27,040 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-27 01:33:27,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:33:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-27 01:33:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:33:27,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:27,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:27,051 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:27,051 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-27 01:33:27,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:27,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854602851] [2019-12-27 01:33:27,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:27,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854602851] [2019-12-27 01:33:27,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:27,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:33:27,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210448325] [2019-12-27 01:33:27,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:33:27,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:27,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:33:27,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:27,106 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-27 01:33:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:27,206 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-27 01:33:27,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:33:27,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 01:33:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:27,236 INFO L225 Difference]: With dead ends: 22367 [2019-12-27 01:33:27,236 INFO L226 Difference]: Without dead ends: 22367 [2019-12-27 01:33:27,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-27 01:33:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-27 01:33:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 01:33:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-27 01:33:27,763 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-27 01:33:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:27,763 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-27 01:33:27,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:33:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-27 01:33:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:33:27,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:27,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:27,775 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:27,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:27,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-27 01:33:27,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:27,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454010866] [2019-12-27 01:33:27,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:27,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454010866] [2019-12-27 01:33:27,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:27,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:33:27,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179007375] [2019-12-27 01:33:27,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:33:27,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:27,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:33:27,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:27,830 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-27 01:33:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:27,935 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-27 01:33:27,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:33:27,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 01:33:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:27,964 INFO L225 Difference]: With dead ends: 22367 [2019-12-27 01:33:27,965 INFO L226 Difference]: Without dead ends: 22367 [2019-12-27 01:33:27,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-27 01:33:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-27 01:33:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 01:33:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-27 01:33:28,252 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-27 01:33:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:28,252 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-27 01:33:28,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:33:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-27 01:33:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:33:28,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:28,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:28,265 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:28,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-27 01:33:28,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:28,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059933820] [2019-12-27 01:33:28,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:28,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059933820] [2019-12-27 01:33:28,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:28,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:33:28,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749870122] [2019-12-27 01:33:28,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:33:28,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:28,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:33:28,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:33:28,363 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-27 01:33:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:28,968 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-27 01:33:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:33:28,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:33:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:29,013 INFO L225 Difference]: With dead ends: 31275 [2019-12-27 01:33:29,013 INFO L226 Difference]: Without dead ends: 31275 [2019-12-27 01:33:29,014 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-27 01:33:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-27 01:33:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-27 01:33:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-27 01:33:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-27 01:33:29,384 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-27 01:33:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:29,384 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-27 01:33:29,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:33:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-27 01:33:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:33:29,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:29,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:29,399 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-27 01:33:29,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:29,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727274404] [2019-12-27 01:33:29,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:29,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-27 01:33:29,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727274404] [2019-12-27 01:33:29,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:29,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:33:29,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195493529] [2019-12-27 01:33:29,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:33:29,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:29,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:33:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:33:29,490 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-27 01:33:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:30,150 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-27 01:33:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:33:30,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 01:33:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:30,194 INFO L225 Difference]: With dead ends: 30618 [2019-12-27 01:33:30,194 INFO L226 Difference]: Without dead ends: 30618 [2019-12-27 01:33:30,195 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-27 01:33:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-27 01:33:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-27 01:33:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-27 01:33:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-27 01:33:30,865 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-27 01:33:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:30,865 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-27 01:33:30,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:33:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-27 01:33:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:33:30,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:30,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:30,886 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:30,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-27 01:33:30,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:30,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699798142] [2019-12-27 01:33:30,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:30,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699798142] [2019-12-27 01:33:30,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:30,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:33:30,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468139310] [2019-12-27 01:33:30,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:33:30,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:33:30,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:33:30,959 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 5 states. [2019-12-27 01:33:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:31,358 INFO L93 Difference]: Finished difference Result 23829 states and 70169 transitions. [2019-12-27 01:33:31,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:33:31,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 01:33:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:31,402 INFO L225 Difference]: With dead ends: 23829 [2019-12-27 01:33:31,403 INFO L226 Difference]: Without dead ends: 23829 [2019-12-27 01:33:31,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:33:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2019-12-27 01:33:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 20047. [2019-12-27 01:33:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20047 states. [2019-12-27 01:33:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20047 states to 20047 states and 59899 transitions. [2019-12-27 01:33:31,739 INFO L78 Accepts]: Start accepts. Automaton has 20047 states and 59899 transitions. Word has length 33 [2019-12-27 01:33:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:31,740 INFO L462 AbstractCegarLoop]: Abstraction has 20047 states and 59899 transitions. [2019-12-27 01:33:31,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:33:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20047 states and 59899 transitions. [2019-12-27 01:33:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:33:31,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:31,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:31,760 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:31,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-27 01:33:31,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:31,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136511594] [2019-12-27 01:33:31,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:31,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136511594] [2019-12-27 01:33:31,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:31,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:33:31,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252333965] [2019-12-27 01:33:31,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:33:31,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:31,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:33:31,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:33:31,867 INFO L87 Difference]: Start difference. First operand 20047 states and 59899 transitions. Second operand 7 states. [2019-12-27 01:33:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:33,285 INFO L93 Difference]: Finished difference Result 39715 states and 116920 transitions. [2019-12-27 01:33:33,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:33:33,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 01:33:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:33,341 INFO L225 Difference]: With dead ends: 39715 [2019-12-27 01:33:33,341 INFO L226 Difference]: Without dead ends: 39715 [2019-12-27 01:33:33,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:33:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2019-12-27 01:33:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 21295. [2019-12-27 01:33:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21295 states. [2019-12-27 01:33:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 63643 transitions. [2019-12-27 01:33:33,782 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 63643 transitions. Word has length 33 [2019-12-27 01:33:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:33,783 INFO L462 AbstractCegarLoop]: Abstraction has 21295 states and 63643 transitions. [2019-12-27 01:33:33,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:33:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 63643 transitions. [2019-12-27 01:33:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:33:33,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:33,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:33,799 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-27 01:33:33,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:33,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758622026] [2019-12-27 01:33:33,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:33,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758622026] [2019-12-27 01:33:33,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:33,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:33:33,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065012835] [2019-12-27 01:33:33,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:33:33,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:33,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:33:33,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:33:33,948 INFO L87 Difference]: Start difference. First operand 21295 states and 63643 transitions. Second operand 9 states. [2019-12-27 01:33:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:35,758 INFO L93 Difference]: Finished difference Result 31740 states and 93574 transitions. [2019-12-27 01:33:35,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:33:35,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 01:33:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:35,801 INFO L225 Difference]: With dead ends: 31740 [2019-12-27 01:33:35,802 INFO L226 Difference]: Without dead ends: 31740 [2019-12-27 01:33:35,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:33:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31740 states. [2019-12-27 01:33:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31740 to 20792. [2019-12-27 01:33:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2019-12-27 01:33:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 62165 transitions. [2019-12-27 01:33:36,156 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 62165 transitions. Word has length 33 [2019-12-27 01:33:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:36,156 INFO L462 AbstractCegarLoop]: Abstraction has 20792 states and 62165 transitions. [2019-12-27 01:33:36,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:33:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 62165 transitions. [2019-12-27 01:33:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:33:36,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:36,172 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-27 01:33:36,172 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:36,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:36,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-27 01:33:36,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:36,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323077833] [2019-12-27 01:33:36,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:36,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323077833] [2019-12-27 01:33:36,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:36,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:33:36,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261060557] [2019-12-27 01:33:36,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:33:36,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:36,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:33:36,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:33:36,273 INFO L87 Difference]: Start difference. First operand 20792 states and 62165 transitions. Second operand 7 states. [2019-12-27 01:33:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:37,670 INFO L93 Difference]: Finished difference Result 36282 states and 106307 transitions. [2019-12-27 01:33:37,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:33:37,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 01:33:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:37,720 INFO L225 Difference]: With dead ends: 36282 [2019-12-27 01:33:37,720 INFO L226 Difference]: Without dead ends: 36282 [2019-12-27 01:33:37,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:33:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36282 states. [2019-12-27 01:33:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36282 to 19630. [2019-12-27 01:33:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19630 states. [2019-12-27 01:33:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19630 states to 19630 states and 58823 transitions. [2019-12-27 01:33:38,158 INFO L78 Accepts]: Start accepts. Automaton has 19630 states and 58823 transitions. Word has length 34 [2019-12-27 01:33:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:38,158 INFO L462 AbstractCegarLoop]: Abstraction has 19630 states and 58823 transitions. [2019-12-27 01:33:38,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:33:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 19630 states and 58823 transitions. [2019-12-27 01:33:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:33:38,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:38,175 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-27 01:33:38,175 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:38,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-27 01:33:38,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:38,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906887566] [2019-12-27 01:33:38,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:38,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906887566] [2019-12-27 01:33:38,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:38,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:33:38,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130792266] [2019-12-27 01:33:38,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:33:38,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:38,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:33:38,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:33:38,265 INFO L87 Difference]: Start difference. First operand 19630 states and 58823 transitions. Second operand 8 states. [2019-12-27 01:33:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:40,065 INFO L93 Difference]: Finished difference Result 41307 states and 119689 transitions. [2019-12-27 01:33:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:33:40,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 01:33:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:40,134 INFO L225 Difference]: With dead ends: 41307 [2019-12-27 01:33:40,134 INFO L226 Difference]: Without dead ends: 41307 [2019-12-27 01:33:40,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:33:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41307 states. [2019-12-27 01:33:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41307 to 17930. [2019-12-27 01:33:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17930 states. [2019-12-27 01:33:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17930 states to 17930 states and 53783 transitions. [2019-12-27 01:33:40,871 INFO L78 Accepts]: Start accepts. Automaton has 17930 states and 53783 transitions. Word has length 34 [2019-12-27 01:33:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:40,872 INFO L462 AbstractCegarLoop]: Abstraction has 17930 states and 53783 transitions. [2019-12-27 01:33:40,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:33:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 17930 states and 53783 transitions. [2019-12-27 01:33:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:33:40,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:40,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:40,897 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:40,897 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-27 01:33:40,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:40,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311909312] [2019-12-27 01:33:40,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:40,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311909312] [2019-12-27 01:33:40,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:40,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:33:40,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751799972] [2019-12-27 01:33:40,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:33:40,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:40,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:33:40,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:33:40,963 INFO L87 Difference]: Start difference. First operand 17930 states and 53783 transitions. Second operand 4 states. [2019-12-27 01:33:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:41,066 INFO L93 Difference]: Finished difference Result 30507 states and 91836 transitions. [2019-12-27 01:33:41,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:33:41,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 01:33:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:41,092 INFO L225 Difference]: With dead ends: 30507 [2019-12-27 01:33:41,092 INFO L226 Difference]: Without dead ends: 15439 [2019-12-27 01:33:41,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:33:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15439 states. [2019-12-27 01:33:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15439 to 15355. [2019-12-27 01:33:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15355 states. [2019-12-27 01:33:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15355 states to 15355 states and 45258 transitions. [2019-12-27 01:33:41,337 INFO L78 Accepts]: Start accepts. Automaton has 15355 states and 45258 transitions. Word has length 39 [2019-12-27 01:33:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:41,337 INFO L462 AbstractCegarLoop]: Abstraction has 15355 states and 45258 transitions. [2019-12-27 01:33:41,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:33:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 15355 states and 45258 transitions. [2019-12-27 01:33:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:33:41,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:41,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:41,353 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:41,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:41,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-27 01:33:41,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:41,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698726863] [2019-12-27 01:33:41,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:41,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698726863] [2019-12-27 01:33:41,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:41,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:33:41,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617173627] [2019-12-27 01:33:41,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:33:41,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:41,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:33:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:41,405 INFO L87 Difference]: Start difference. First operand 15355 states and 45258 transitions. Second operand 3 states. [2019-12-27 01:33:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:41,468 INFO L93 Difference]: Finished difference Result 15354 states and 45256 transitions. [2019-12-27 01:33:41,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:33:41,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:33:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:41,497 INFO L225 Difference]: With dead ends: 15354 [2019-12-27 01:33:41,497 INFO L226 Difference]: Without dead ends: 15354 [2019-12-27 01:33:41,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15354 states. [2019-12-27 01:33:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15354 to 15354. [2019-12-27 01:33:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15354 states. [2019-12-27 01:33:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15354 states to 15354 states and 45256 transitions. [2019-12-27 01:33:41,745 INFO L78 Accepts]: Start accepts. Automaton has 15354 states and 45256 transitions. Word has length 39 [2019-12-27 01:33:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:41,745 INFO L462 AbstractCegarLoop]: Abstraction has 15354 states and 45256 transitions. [2019-12-27 01:33:41,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:33:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 15354 states and 45256 transitions. [2019-12-27 01:33:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:33:41,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:41,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:41,760 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-27 01:33:41,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:41,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717880355] [2019-12-27 01:33:41,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:41,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717880355] [2019-12-27 01:33:41,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:41,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:33:41,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097745733] [2019-12-27 01:33:41,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:33:41,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:41,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:33:41,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:33:41,808 INFO L87 Difference]: Start difference. First operand 15354 states and 45256 transitions. Second operand 4 states. [2019-12-27 01:33:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:41,902 INFO L93 Difference]: Finished difference Result 24489 states and 72527 transitions. [2019-12-27 01:33:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:33:41,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 01:33:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:41,919 INFO L225 Difference]: With dead ends: 24489 [2019-12-27 01:33:41,919 INFO L226 Difference]: Without dead ends: 11193 [2019-12-27 01:33:41,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:33:41,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2019-12-27 01:33:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 11100. [2019-12-27 01:33:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11100 states. [2019-12-27 01:33:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11100 states to 11100 states and 31843 transitions. [2019-12-27 01:33:42,100 INFO L78 Accepts]: Start accepts. Automaton has 11100 states and 31843 transitions. Word has length 40 [2019-12-27 01:33:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:42,100 INFO L462 AbstractCegarLoop]: Abstraction has 11100 states and 31843 transitions. [2019-12-27 01:33:42,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:33:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 11100 states and 31843 transitions. [2019-12-27 01:33:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:33:42,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:42,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:42,112 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-27 01:33:42,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:42,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672522853] [2019-12-27 01:33:42,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:42,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672522853] [2019-12-27 01:33:42,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:42,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:33:42,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999097008] [2019-12-27 01:33:42,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:33:42,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:33:42,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:33:42,169 INFO L87 Difference]: Start difference. First operand 11100 states and 31843 transitions. Second operand 5 states. [2019-12-27 01:33:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:42,230 INFO L93 Difference]: Finished difference Result 10138 states and 29702 transitions. [2019-12-27 01:33:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:33:42,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:33:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:42,243 INFO L225 Difference]: With dead ends: 10138 [2019-12-27 01:33:42,244 INFO L226 Difference]: Without dead ends: 7230 [2019-12-27 01:33:42,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:33:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-27 01:33:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7230. [2019-12-27 01:33:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-12-27 01:33:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 23189 transitions. [2019-12-27 01:33:42,478 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 23189 transitions. Word has length 40 [2019-12-27 01:33:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:42,478 INFO L462 AbstractCegarLoop]: Abstraction has 7230 states and 23189 transitions. [2019-12-27 01:33:42,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:33:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 23189 transitions. [2019-12-27 01:33:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:33:42,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:42,491 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-27 01:33:42,491 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash -101932291, now seen corresponding path program 1 times [2019-12-27 01:33:42,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:42,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026899243] [2019-12-27 01:33:42,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:42,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026899243] [2019-12-27 01:33:42,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:42,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:33:42,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118094569] [2019-12-27 01:33:42,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:33:42,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:42,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:33:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:33:42,602 INFO L87 Difference]: Start difference. First operand 7230 states and 23189 transitions. Second operand 7 states. [2019-12-27 01:33:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:42,867 INFO L93 Difference]: Finished difference Result 14425 states and 45327 transitions. [2019-12-27 01:33:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:33:42,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:33:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:42,883 INFO L225 Difference]: With dead ends: 14425 [2019-12-27 01:33:42,883 INFO L226 Difference]: Without dead ends: 10624 [2019-12-27 01:33:42,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:33:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10624 states. [2019-12-27 01:33:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10624 to 8673. [2019-12-27 01:33:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8673 states. [2019-12-27 01:33:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 27719 transitions. [2019-12-27 01:33:43,040 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 27719 transitions. Word has length 64 [2019-12-27 01:33:43,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:43,040 INFO L462 AbstractCegarLoop]: Abstraction has 8673 states and 27719 transitions. [2019-12-27 01:33:43,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:33:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 27719 transitions. [2019-12-27 01:33:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:33:43,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:43,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-27 01:33:43,049 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:43,049 INFO L82 PathProgramCache]: Analyzing trace with hash -244237027, now seen corresponding path program 2 times [2019-12-27 01:33:43,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:43,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461755577] [2019-12-27 01:33:43,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:43,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461755577] [2019-12-27 01:33:43,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:43,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:33:43,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146501613] [2019-12-27 01:33:43,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:33:43,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:43,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:33:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:33:43,138 INFO L87 Difference]: Start difference. First operand 8673 states and 27719 transitions. Second operand 7 states. [2019-12-27 01:33:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:43,495 INFO L93 Difference]: Finished difference Result 16977 states and 52978 transitions. [2019-12-27 01:33:43,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:33:43,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:33:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:43,526 INFO L225 Difference]: With dead ends: 16977 [2019-12-27 01:33:43,526 INFO L226 Difference]: Without dead ends: 12608 [2019-12-27 01:33:43,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:33:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2019-12-27 01:33:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 10249. [2019-12-27 01:33:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10249 states. [2019-12-27 01:33:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 32525 transitions. [2019-12-27 01:33:44,110 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 32525 transitions. Word has length 64 [2019-12-27 01:33:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:44,110 INFO L462 AbstractCegarLoop]: Abstraction has 10249 states and 32525 transitions. [2019-12-27 01:33:44,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:33:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 32525 transitions. [2019-12-27 01:33:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:33:44,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:44,126 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-27 01:33:44,126 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash 407961531, now seen corresponding path program 3 times [2019-12-27 01:33:44,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:44,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12303415] [2019-12-27 01:33:44,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:44,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12303415] [2019-12-27 01:33:44,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:44,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:33:44,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854989996] [2019-12-27 01:33:44,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:33:44,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:44,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:33:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:33:44,259 INFO L87 Difference]: Start difference. First operand 10249 states and 32525 transitions. Second operand 9 states. [2019-12-27 01:33:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:45,249 INFO L93 Difference]: Finished difference Result 29742 states and 92736 transitions. [2019-12-27 01:33:45,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:33:45,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:33:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:45,291 INFO L225 Difference]: With dead ends: 29742 [2019-12-27 01:33:45,291 INFO L226 Difference]: Without dead ends: 27534 [2019-12-27 01:33:45,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:33:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27534 states. [2019-12-27 01:33:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27534 to 10384. [2019-12-27 01:33:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10384 states. [2019-12-27 01:33:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 33017 transitions. [2019-12-27 01:33:45,590 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 33017 transitions. Word has length 64 [2019-12-27 01:33:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:45,590 INFO L462 AbstractCegarLoop]: Abstraction has 10384 states and 33017 transitions. [2019-12-27 01:33:45,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:33:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 33017 transitions. [2019-12-27 01:33:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:33:45,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:45,601 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-27 01:33:45,601 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:45,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:45,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1263766943, now seen corresponding path program 4 times [2019-12-27 01:33:45,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:45,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244630391] [2019-12-27 01:33:45,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:45,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244630391] [2019-12-27 01:33:45,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:45,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:33:45,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274722199] [2019-12-27 01:33:45,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:33:45,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:45,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:33:45,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:33:45,718 INFO L87 Difference]: Start difference. First operand 10384 states and 33017 transitions. Second operand 9 states. [2019-12-27 01:33:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:46,676 INFO L93 Difference]: Finished difference Result 23762 states and 74154 transitions. [2019-12-27 01:33:46,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:33:46,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:33:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:46,708 INFO L225 Difference]: With dead ends: 23762 [2019-12-27 01:33:46,709 INFO L226 Difference]: Without dead ends: 22008 [2019-12-27 01:33:46,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:33:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22008 states. [2019-12-27 01:33:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22008 to 10264. [2019-12-27 01:33:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10264 states. [2019-12-27 01:33:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 32661 transitions. [2019-12-27 01:33:46,954 INFO L78 Accepts]: Start accepts. Automaton has 10264 states and 32661 transitions. Word has length 64 [2019-12-27 01:33:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:46,954 INFO L462 AbstractCegarLoop]: Abstraction has 10264 states and 32661 transitions. [2019-12-27 01:33:46,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:33:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 10264 states and 32661 transitions. [2019-12-27 01:33:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:33:46,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:46,970 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-27 01:33:46,970 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-27 01:33:46,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:46,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1739892295, now seen corresponding path program 5 times [2019-12-27 01:33:46,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:46,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591554578] [2019-12-27 01:33:46,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:47,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591554578] [2019-12-27 01:33:47,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:47,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:33:47,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074320137] [2019-12-27 01:33:47,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:33:47,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:47,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:33:47,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:47,060 INFO L87 Difference]: Start difference. First operand 10264 states and 32661 transitions. Second operand 3 states. [2019-12-27 01:33:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:47,102 INFO L93 Difference]: Finished difference Result 8225 states and 25321 transitions. [2019-12-27 01:33:47,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:33:47,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:33:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:47,117 INFO L225 Difference]: With dead ends: 8225 [2019-12-27 01:33:47,118 INFO L226 Difference]: Without dead ends: 8225 [2019-12-27 01:33:47,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:47,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8225 states. [2019-12-27 01:33:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8225 to 8225. [2019-12-27 01:33:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8225 states. [2019-12-27 01:33:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8225 states to 8225 states and 25321 transitions. [2019-12-27 01:33:47,274 INFO L78 Accepts]: Start accepts. Automaton has 8225 states and 25321 transitions. Word has length 64 [2019-12-27 01:33:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:47,274 INFO L462 AbstractCegarLoop]: Abstraction has 8225 states and 25321 transitions. [2019-12-27 01:33:47,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:33:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8225 states and 25321 transitions. [2019-12-27 01:33:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:33:47,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:47,283 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-27 01:33:47,283 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-27 01:33:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:47,284 INFO L82 PathProgramCache]: Analyzing trace with hash 415532239, now seen corresponding path program 1 times [2019-12-27 01:33:47,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:47,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642141719] [2019-12-27 01:33:47,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:47,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642141719] [2019-12-27 01:33:47,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:47,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:33:47,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106725844] [2019-12-27 01:33:47,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:33:47,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:47,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:33:47,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:33:47,389 INFO L87 Difference]: Start difference. First operand 8225 states and 25321 transitions. Second operand 7 states. [2019-12-27 01:33:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:48,756 INFO L93 Difference]: Finished difference Result 22752 states and 67979 transitions. [2019-12-27 01:33:48,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:33:48,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:33:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:48,785 INFO L225 Difference]: With dead ends: 22752 [2019-12-27 01:33:48,785 INFO L226 Difference]: Without dead ends: 22584 [2019-12-27 01:33:48,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:33:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22584 states. [2019-12-27 01:33:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22584 to 13142. [2019-12-27 01:33:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13142 states. [2019-12-27 01:33:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13142 states to 13142 states and 39619 transitions. [2019-12-27 01:33:49,280 INFO L78 Accepts]: Start accepts. Automaton has 13142 states and 39619 transitions. Word has length 65 [2019-12-27 01:33:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:49,281 INFO L462 AbstractCegarLoop]: Abstraction has 13142 states and 39619 transitions. [2019-12-27 01:33:49,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:33:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 13142 states and 39619 transitions. [2019-12-27 01:33:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:33:49,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:49,295 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-27 01:33:49,295 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-27 01:33:49,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:49,295 INFO L82 PathProgramCache]: Analyzing trace with hash 568214969, now seen corresponding path program 2 times [2019-12-27 01:33:49,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:49,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765686240] [2019-12-27 01:33:49,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:49,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765686240] [2019-12-27 01:33:49,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:49,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:33:49,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095623022] [2019-12-27 01:33:49,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:33:49,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:49,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:33:49,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:33:49,497 INFO L87 Difference]: Start difference. First operand 13142 states and 39619 transitions. Second operand 10 states. [2019-12-27 01:33:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:52,317 INFO L93 Difference]: Finished difference Result 33327 states and 98068 transitions. [2019-12-27 01:33:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:33:52,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 01:33:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:52,362 INFO L225 Difference]: With dead ends: 33327 [2019-12-27 01:33:52,362 INFO L226 Difference]: Without dead ends: 33111 [2019-12-27 01:33:52,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-12-27 01:33:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33111 states. [2019-12-27 01:33:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33111 to 15976. [2019-12-27 01:33:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15976 states. [2019-12-27 01:33:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15976 states to 15976 states and 47957 transitions. [2019-12-27 01:33:52,729 INFO L78 Accepts]: Start accepts. Automaton has 15976 states and 47957 transitions. Word has length 65 [2019-12-27 01:33:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:52,730 INFO L462 AbstractCegarLoop]: Abstraction has 15976 states and 47957 transitions. [2019-12-27 01:33:52,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:33:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 15976 states and 47957 transitions. [2019-12-27 01:33:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:33:52,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:52,745 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-27 01:33:52,746 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-27 01:33:52,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1787345667, now seen corresponding path program 3 times [2019-12-27 01:33:52,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:52,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466331759] [2019-12-27 01:33:52,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:52,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466331759] [2019-12-27 01:33:52,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:52,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:33:52,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363847057] [2019-12-27 01:33:52,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:33:52,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:52,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:33:52,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:52,833 INFO L87 Difference]: Start difference. First operand 15976 states and 47957 transitions. Second operand 3 states. [2019-12-27 01:33:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:52,931 INFO L93 Difference]: Finished difference Result 18589 states and 55768 transitions. [2019-12-27 01:33:52,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:33:52,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:33:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:52,955 INFO L225 Difference]: With dead ends: 18589 [2019-12-27 01:33:52,955 INFO L226 Difference]: Without dead ends: 18589 [2019-12-27 01:33:52,955 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-27 01:33:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18589 states. [2019-12-27 01:33:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18589 to 15253. [2019-12-27 01:33:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15253 states. [2019-12-27 01:33:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15253 states to 15253 states and 45994 transitions. [2019-12-27 01:33:53,231 INFO L78 Accepts]: Start accepts. Automaton has 15253 states and 45994 transitions. Word has length 65 [2019-12-27 01:33:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:53,232 INFO L462 AbstractCegarLoop]: Abstraction has 15253 states and 45994 transitions. [2019-12-27 01:33:53,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:33:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 15253 states and 45994 transitions. [2019-12-27 01:33:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:33:53,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:53,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:53,249 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-27 01:33:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:53,250 INFO L82 PathProgramCache]: Analyzing trace with hash -436961782, now seen corresponding path program 1 times [2019-12-27 01:33:53,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:53,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053573308] [2019-12-27 01:33:53,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:53,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053573308] [2019-12-27 01:33:53,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:53,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:33:53,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255916239] [2019-12-27 01:33:53,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:33:53,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:53,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:33:53,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:33:53,406 INFO L87 Difference]: Start difference. First operand 15253 states and 45994 transitions. Second operand 7 states. [2019-12-27 01:33:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:54,691 INFO L93 Difference]: Finished difference Result 26199 states and 76732 transitions. [2019-12-27 01:33:54,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 01:33:54,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 01:33:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:54,725 INFO L225 Difference]: With dead ends: 26199 [2019-12-27 01:33:54,726 INFO L226 Difference]: Without dead ends: 26199 [2019-12-27 01:33:54,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:33:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26199 states. [2019-12-27 01:33:55,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26199 to 16345. [2019-12-27 01:33:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16345 states. [2019-12-27 01:33:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16345 states to 16345 states and 48926 transitions. [2019-12-27 01:33:55,331 INFO L78 Accepts]: Start accepts. Automaton has 16345 states and 48926 transitions. Word has length 66 [2019-12-27 01:33:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:55,331 INFO L462 AbstractCegarLoop]: Abstraction has 16345 states and 48926 transitions. [2019-12-27 01:33:55,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:33:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 16345 states and 48926 transitions. [2019-12-27 01:33:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:33:55,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:55,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:55,348 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-27 01:33:55,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:55,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1291053854, now seen corresponding path program 1 times [2019-12-27 01:33:55,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:55,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34754365] [2019-12-27 01:33:55,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:55,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34754365] [2019-12-27 01:33:55,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:55,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:33:55,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258792744] [2019-12-27 01:33:55,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:33:55,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:55,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:33:55,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:33:55,423 INFO L87 Difference]: Start difference. First operand 16345 states and 48926 transitions. Second operand 4 states. [2019-12-27 01:33:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:55,558 INFO L93 Difference]: Finished difference Result 16144 states and 48158 transitions. [2019-12-27 01:33:55,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:33:55,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 01:33:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:55,597 INFO L225 Difference]: With dead ends: 16144 [2019-12-27 01:33:55,598 INFO L226 Difference]: Without dead ends: 16144 [2019-12-27 01:33:55,600 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-27 01:33:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16144 states. [2019-12-27 01:33:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16144 to 15121. [2019-12-27 01:33:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15121 states. [2019-12-27 01:33:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15121 states to 15121 states and 45042 transitions. [2019-12-27 01:33:56,029 INFO L78 Accepts]: Start accepts. Automaton has 15121 states and 45042 transitions. Word has length 66 [2019-12-27 01:33:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:56,029 INFO L462 AbstractCegarLoop]: Abstraction has 15121 states and 45042 transitions. [2019-12-27 01:33:56,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:33:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15121 states and 45042 transitions. [2019-12-27 01:33:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:33:56,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:56,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:56,050 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-27 01:33:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2137686651, now seen corresponding path program 1 times [2019-12-27 01:33:56,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:56,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577209490] [2019-12-27 01:33:56,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:56,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577209490] [2019-12-27 01:33:56,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:56,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:33:56,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519971120] [2019-12-27 01:33:56,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:33:56,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:56,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:33:56,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:56,145 INFO L87 Difference]: Start difference. First operand 15121 states and 45042 transitions. Second operand 3 states. [2019-12-27 01:33:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:56,207 INFO L93 Difference]: Finished difference Result 15120 states and 45040 transitions. [2019-12-27 01:33:56,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:33:56,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:33:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:56,235 INFO L225 Difference]: With dead ends: 15120 [2019-12-27 01:33:56,236 INFO L226 Difference]: Without dead ends: 15120 [2019-12-27 01:33:56,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15120 states. [2019-12-27 01:33:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15120 to 13141. [2019-12-27 01:33:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13141 states. [2019-12-27 01:33:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13141 states to 13141 states and 39416 transitions. [2019-12-27 01:33:56,661 INFO L78 Accepts]: Start accepts. Automaton has 13141 states and 39416 transitions. Word has length 66 [2019-12-27 01:33:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:56,662 INFO L462 AbstractCegarLoop]: Abstraction has 13141 states and 39416 transitions. [2019-12-27 01:33:56,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:33:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 13141 states and 39416 transitions. [2019-12-27 01:33:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:33:56,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:56,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:56,688 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2078724657, now seen corresponding path program 1 times [2019-12-27 01:33:56,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:56,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999228073] [2019-12-27 01:33:56,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:56,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999228073] [2019-12-27 01:33:56,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:56,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:33:56,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938741078] [2019-12-27 01:33:56,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:33:56,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:56,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:33:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:33:56,887 INFO L87 Difference]: Start difference. First operand 13141 states and 39416 transitions. Second operand 9 states. [2019-12-27 01:33:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:58,196 INFO L93 Difference]: Finished difference Result 25246 states and 74751 transitions. [2019-12-27 01:33:58,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:33:58,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 01:33:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:58,238 INFO L225 Difference]: With dead ends: 25246 [2019-12-27 01:33:58,238 INFO L226 Difference]: Without dead ends: 18208 [2019-12-27 01:33:58,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:33:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18208 states. [2019-12-27 01:33:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18208 to 13911. [2019-12-27 01:33:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13911 states. [2019-12-27 01:33:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13911 states to 13911 states and 41303 transitions. [2019-12-27 01:33:58,693 INFO L78 Accepts]: Start accepts. Automaton has 13911 states and 41303 transitions. Word has length 67 [2019-12-27 01:33:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:58,693 INFO L462 AbstractCegarLoop]: Abstraction has 13911 states and 41303 transitions. [2019-12-27 01:33:58,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:33:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 13911 states and 41303 transitions. [2019-12-27 01:33:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:33:58,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:58,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:58,715 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:33:58,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash 721495091, now seen corresponding path program 2 times [2019-12-27 01:33:58,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:58,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476698785] [2019-12-27 01:33:58,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:58,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476698785] [2019-12-27 01:33:58,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:58,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:33:58,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241996052] [2019-12-27 01:33:58,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:33:58,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:58,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:33:58,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:33:58,870 INFO L87 Difference]: Start difference. First operand 13911 states and 41303 transitions. Second operand 10 states. [2019-12-27 01:34:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:00,309 INFO L93 Difference]: Finished difference Result 22853 states and 66129 transitions. [2019-12-27 01:34:00,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:34:00,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:34:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:00,335 INFO L225 Difference]: With dead ends: 22853 [2019-12-27 01:34:00,335 INFO L226 Difference]: Without dead ends: 19984 [2019-12-27 01:34:00,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:34:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19984 states. [2019-12-27 01:34:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19984 to 14178. [2019-12-27 01:34:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14178 states. [2019-12-27 01:34:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14178 states to 14178 states and 41913 transitions. [2019-12-27 01:34:00,590 INFO L78 Accepts]: Start accepts. Automaton has 14178 states and 41913 transitions. Word has length 67 [2019-12-27 01:34:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:00,590 INFO L462 AbstractCegarLoop]: Abstraction has 14178 states and 41913 transitions. [2019-12-27 01:34:00,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:34:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 14178 states and 41913 transitions. [2019-12-27 01:34:00,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:00,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:00,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:00,605 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:34:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:00,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1716057561, now seen corresponding path program 3 times [2019-12-27 01:34:00,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:00,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686793713] [2019-12-27 01:34:00,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:00,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686793713] [2019-12-27 01:34:00,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:00,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:34:00,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167855381] [2019-12-27 01:34:00,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:34:00,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:34:00,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:34:00,808 INFO L87 Difference]: Start difference. First operand 14178 states and 41913 transitions. Second operand 11 states. [2019-12-27 01:34:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:02,819 INFO L93 Difference]: Finished difference Result 21038 states and 60794 transitions. [2019-12-27 01:34:02,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:34:02,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:34:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:02,846 INFO L225 Difference]: With dead ends: 21038 [2019-12-27 01:34:02,846 INFO L226 Difference]: Without dead ends: 19975 [2019-12-27 01:34:02,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:34:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19975 states. [2019-12-27 01:34:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19975 to 13974. [2019-12-27 01:34:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13974 states. [2019-12-27 01:34:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13974 states to 13974 states and 41368 transitions. [2019-12-27 01:34:03,103 INFO L78 Accepts]: Start accepts. Automaton has 13974 states and 41368 transitions. Word has length 67 [2019-12-27 01:34:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:03,103 INFO L462 AbstractCegarLoop]: Abstraction has 13974 states and 41368 transitions. [2019-12-27 01:34:03,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:34:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 13974 states and 41368 transitions. [2019-12-27 01:34:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:03,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:03,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:03,117 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:34:03,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:03,118 INFO L82 PathProgramCache]: Analyzing trace with hash 88464887, now seen corresponding path program 4 times [2019-12-27 01:34:03,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:03,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299384097] [2019-12-27 01:34:03,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:03,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299384097] [2019-12-27 01:34:03,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:03,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:34:03,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886895525] [2019-12-27 01:34:03,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:34:03,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:03,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:34:03,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:34:03,277 INFO L87 Difference]: Start difference. First operand 13974 states and 41368 transitions. Second operand 12 states. [2019-12-27 01:34:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:05,642 INFO L93 Difference]: Finished difference Result 27095 states and 78619 transitions. [2019-12-27 01:34:05,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:34:05,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:34:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:05,670 INFO L225 Difference]: With dead ends: 27095 [2019-12-27 01:34:05,671 INFO L226 Difference]: Without dead ends: 19091 [2019-12-27 01:34:05,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:34:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19091 states. [2019-12-27 01:34:05,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19091 to 13768. [2019-12-27 01:34:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13768 states. [2019-12-27 01:34:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13768 states to 13768 states and 40616 transitions. [2019-12-27 01:34:05,919 INFO L78 Accepts]: Start accepts. Automaton has 13768 states and 40616 transitions. Word has length 67 [2019-12-27 01:34:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:05,920 INFO L462 AbstractCegarLoop]: Abstraction has 13768 states and 40616 transitions. [2019-12-27 01:34:05,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:34:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 13768 states and 40616 transitions. [2019-12-27 01:34:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:05,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:05,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:05,934 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:34:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:05,934 INFO L82 PathProgramCache]: Analyzing trace with hash 575406353, now seen corresponding path program 5 times [2019-12-27 01:34:05,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:05,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793216263] [2019-12-27 01:34:05,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:06,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793216263] [2019-12-27 01:34:06,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:06,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:34:06,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554618172] [2019-12-27 01:34:06,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:34:06,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:34:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:34:06,245 INFO L87 Difference]: Start difference. First operand 13768 states and 40616 transitions. Second operand 12 states. [2019-12-27 01:34:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:07,263 INFO L93 Difference]: Finished difference Result 20132 states and 59183 transitions. [2019-12-27 01:34:07,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 01:34:07,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:34:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:07,288 INFO L225 Difference]: With dead ends: 20132 [2019-12-27 01:34:07,288 INFO L226 Difference]: Without dead ends: 19113 [2019-12-27 01:34:07,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-27 01:34:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19113 states. [2019-12-27 01:34:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19113 to 16139. [2019-12-27 01:34:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16139 states. [2019-12-27 01:34:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16139 states to 16139 states and 47696 transitions. [2019-12-27 01:34:07,565 INFO L78 Accepts]: Start accepts. Automaton has 16139 states and 47696 transitions. Word has length 67 [2019-12-27 01:34:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:07,566 INFO L462 AbstractCegarLoop]: Abstraction has 16139 states and 47696 transitions. [2019-12-27 01:34:07,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:34:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 47696 transitions. [2019-12-27 01:34:07,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:07,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:07,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:07,581 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:34:07,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:07,581 INFO L82 PathProgramCache]: Analyzing trace with hash -600013973, now seen corresponding path program 6 times [2019-12-27 01:34:07,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:07,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979166265] [2019-12-27 01:34:07,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:07,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979166265] [2019-12-27 01:34:07,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:07,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:34:07,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884072895] [2019-12-27 01:34:07,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:34:07,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:07,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:34:07,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:34:07,818 INFO L87 Difference]: Start difference. First operand 16139 states and 47696 transitions. Second operand 11 states. [2019-12-27 01:34:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:08,958 INFO L93 Difference]: Finished difference Result 19935 states and 57875 transitions. [2019-12-27 01:34:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:34:08,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:34:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:08,981 INFO L225 Difference]: With dead ends: 19935 [2019-12-27 01:34:08,981 INFO L226 Difference]: Without dead ends: 16860 [2019-12-27 01:34:08,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:34:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16860 states. [2019-12-27 01:34:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16860 to 13571. [2019-12-27 01:34:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13571 states. [2019-12-27 01:34:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13571 states to 13571 states and 40117 transitions. [2019-12-27 01:34:09,206 INFO L78 Accepts]: Start accepts. Automaton has 13571 states and 40117 transitions. Word has length 67 [2019-12-27 01:34:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:09,206 INFO L462 AbstractCegarLoop]: Abstraction has 13571 states and 40117 transitions. [2019-12-27 01:34:09,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:34:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 13571 states and 40117 transitions. [2019-12-27 01:34:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:09,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:09,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:09,221 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:34:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash 975038819, now seen corresponding path program 7 times [2019-12-27 01:34:09,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:09,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766490210] [2019-12-27 01:34:09,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:09,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766490210] [2019-12-27 01:34:09,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:09,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:34:09,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653448715] [2019-12-27 01:34:09,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:34:09,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:09,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:34:09,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:34:09,393 INFO L87 Difference]: Start difference. First operand 13571 states and 40117 transitions. Second operand 10 states. [2019-12-27 01:34:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:10,559 INFO L93 Difference]: Finished difference Result 16980 states and 48998 transitions. [2019-12-27 01:34:10,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:34:10,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:34:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:10,581 INFO L225 Difference]: With dead ends: 16980 [2019-12-27 01:34:10,581 INFO L226 Difference]: Without dead ends: 15839 [2019-12-27 01:34:10,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:34:10,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15839 states. [2019-12-27 01:34:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15839 to 13111. [2019-12-27 01:34:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13111 states. [2019-12-27 01:34:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13111 states to 13111 states and 38826 transitions. [2019-12-27 01:34:10,792 INFO L78 Accepts]: Start accepts. Automaton has 13111 states and 38826 transitions. Word has length 67 [2019-12-27 01:34:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:10,792 INFO L462 AbstractCegarLoop]: Abstraction has 13111 states and 38826 transitions. [2019-12-27 01:34:10,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:34:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 13111 states and 38826 transitions. [2019-12-27 01:34:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:10,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:10,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:10,805 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:34:10,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:10,805 INFO L82 PathProgramCache]: Analyzing trace with hash -478785703, now seen corresponding path program 8 times [2019-12-27 01:34:10,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:10,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804080928] [2019-12-27 01:34:10,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:10,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804080928] [2019-12-27 01:34:10,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:10,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:34:10,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095521453] [2019-12-27 01:34:10,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:34:10,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:10,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:34:10,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:34:10,944 INFO L87 Difference]: Start difference. First operand 13111 states and 38826 transitions. Second operand 10 states. [2019-12-27 01:34:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:11,975 INFO L93 Difference]: Finished difference Result 16495 states and 47911 transitions. [2019-12-27 01:34:11,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:34:11,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:34:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:11,998 INFO L225 Difference]: With dead ends: 16495 [2019-12-27 01:34:11,998 INFO L226 Difference]: Without dead ends: 16028 [2019-12-27 01:34:11,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:34:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16028 states. [2019-12-27 01:34:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16028 to 13119. [2019-12-27 01:34:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13119 states. [2019-12-27 01:34:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13119 states to 13119 states and 38840 transitions. [2019-12-27 01:34:12,225 INFO L78 Accepts]: Start accepts. Automaton has 13119 states and 38840 transitions. Word has length 67 [2019-12-27 01:34:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:12,225 INFO L462 AbstractCegarLoop]: Abstraction has 13119 states and 38840 transitions. [2019-12-27 01:34:12,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:34:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 13119 states and 38840 transitions. [2019-12-27 01:34:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:12,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:12,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:12,239 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:34:12,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1516551711, now seen corresponding path program 9 times [2019-12-27 01:34:12,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:12,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073399159] [2019-12-27 01:34:12,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:12,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073399159] [2019-12-27 01:34:12,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:12,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:34:12,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072217576] [2019-12-27 01:34:12,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:34:12,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:12,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:34:12,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:34:12,438 INFO L87 Difference]: Start difference. First operand 13119 states and 38840 transitions. Second operand 12 states. [2019-12-27 01:34:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:13,886 INFO L93 Difference]: Finished difference Result 17373 states and 50238 transitions. [2019-12-27 01:34:13,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:34:13,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:34:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:13,910 INFO L225 Difference]: With dead ends: 17373 [2019-12-27 01:34:13,910 INFO L226 Difference]: Without dead ends: 16890 [2019-12-27 01:34:13,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:34:13,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16890 states. [2019-12-27 01:34:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16890 to 12743. [2019-12-27 01:34:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12743 states. [2019-12-27 01:34:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12743 states to 12743 states and 37862 transitions. [2019-12-27 01:34:14,132 INFO L78 Accepts]: Start accepts. Automaton has 12743 states and 37862 transitions. Word has length 67 [2019-12-27 01:34:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:14,132 INFO L462 AbstractCegarLoop]: Abstraction has 12743 states and 37862 transitions. [2019-12-27 01:34:14,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:34:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 12743 states and 37862 transitions. [2019-12-27 01:34:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:14,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:14,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:14,145 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:34:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 10 times [2019-12-27 01:34:14,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:14,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540018169] [2019-12-27 01:34:14,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:34:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:34:14,298 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:34:14,299 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:34:14,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~a$r_buff1_thd0~0_132 0) (= 0 v_~a$w_buff0_used~0_689) (= 0 v_~a$w_buff1_used~0_376) (= v_~a$r_buff0_thd3~0_328 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t385~0.base_29| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t385~0.base_29|) |v_ULTIMATE.start_main_~#t385~0.offset_22| 0)) |v_#memory_int_21|) (= |v_#NULL.offset_6| 0) (= v_~y~0_79 0) (= 0 v_~a$r_buff1_thd1~0_125) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t385~0.base_29|)) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~x~0_69 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t385~0.base_29| 4)) (= 0 v_~a$r_buff1_thd2~0_129) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p0_EBX~0_92 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t385~0.base_29| 1)) (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd3~0_224 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~__unbuffered_cnt~0_98) (= 0 |v_ULTIMATE.start_main_~#t385~0.offset_22|) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~a$r_buff0_thd2~0_124) (= v_~a~0_181 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~a$r_buff0_thd1~0_195) (= v_~a$mem_tmp~0_12 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~a$w_buff1~0_172) (= v_~a$r_buff0_thd0~0_144 0) (= v_~a$w_buff0~0_228 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t385~0.base_29|) (= v_~weak$$choice2~0_107 0) (= v_~z~0_20 0) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_129, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_281|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ~a~0=v_~a~0_181, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_67|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t386~0.base=|v_ULTIMATE.start_main_~#t386~0.base_29|, ULTIMATE.start_main_~#t387~0.offset=|v_ULTIMATE.start_main_~#t387~0.offset_15|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_224, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_689, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ULTIMATE.start_main_~#t386~0.offset=|v_ULTIMATE.start_main_~#t386~0.offset_22|, ULTIMATE.start_main_~#t385~0.offset=|v_ULTIMATE.start_main_~#t385~0.offset_22|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t385~0.base=|v_ULTIMATE.start_main_~#t385~0.base_29|, ~a$w_buff0~0=v_~a$w_buff0~0_228, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_69, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_124, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_55|, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_172, ~y~0=v_~y~0_79, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_125, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_328, ULTIMATE.start_main_~#t387~0.base=|v_ULTIMATE.start_main_~#t387~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_376, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t386~0.base, ULTIMATE.start_main_~#t387~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t386~0.offset, ULTIMATE.start_main_~#t385~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t385~0.base, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~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, ULTIMATE.start_main_~#t387~0.base, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 01:34:14,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t386~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t386~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t386~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t386~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t386~0.base_12|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t386~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t386~0.base_12|) |v_ULTIMATE.start_main_~#t386~0.offset_10| 1))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t386~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t386~0.base=|v_ULTIMATE.start_main_~#t386~0.base_12|, ULTIMATE.start_main_~#t386~0.offset=|v_ULTIMATE.start_main_~#t386~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t386~0.base, ULTIMATE.start_main_~#t386~0.offset] because there is no mapped edge [2019-12-27 01:34:14,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L839-1-->L841: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t387~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t387~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t387~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t387~0.base_13| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t387~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t387~0.base_13|) |v_ULTIMATE.start_main_~#t387~0.offset_11| 2))) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t387~0.base_13| 1) |v_#valid_36|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t387~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t387~0.base=|v_ULTIMATE.start_main_~#t387~0.base_13|, ULTIMATE.start_main_~#t387~0.offset=|v_ULTIMATE.start_main_~#t387~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t387~0.base, ULTIMATE.start_main_~#t387~0.offset] because there is no mapped edge [2019-12-27 01:34:14,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= ~a$r_buff0_thd3~0_In-1748894179 ~a$r_buff1_thd3~0_Out-1748894179) (= ~x~0_Out-1748894179 1) (= ~a$r_buff1_thd1~0_Out-1748894179 ~a$r_buff0_thd1~0_In-1748894179) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1748894179 0)) (= ~a$r_buff0_thd0~0_In-1748894179 ~a$r_buff1_thd0~0_Out-1748894179) (= ~a$r_buff0_thd1~0_Out-1748894179 1) (= ~a$r_buff1_thd2~0_Out-1748894179 ~a$r_buff0_thd2~0_In-1748894179) (= ~__unbuffered_p0_EBX~0_Out-1748894179 ~y~0_In-1748894179) (= ~x~0_Out-1748894179 ~__unbuffered_p0_EAX~0_Out-1748894179)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1748894179, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1748894179, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1748894179, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1748894179, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1748894179, ~y~0=~y~0_In-1748894179} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out-1748894179, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1748894179, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1748894179, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1748894179, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1748894179, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1748894179, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1748894179, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1748894179, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1748894179, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1748894179, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1748894179, ~y~0=~y~0_In-1748894179, ~x~0=~x~0_Out-1748894179} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~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, ~x~0] because there is no mapped edge [2019-12-27 01:34:14,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1472144724 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1472144724 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1472144724|)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-1472144724 |P0Thread1of1ForFork1_#t~ite5_Out-1472144724|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1472144724, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1472144724} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1472144724|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1472144724, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1472144724} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:34:14,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1013211954 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1013211954 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-1013211954 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-1013211954 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1013211954| ~a$w_buff1_used~0_In-1013211954) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1013211954| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1013211954, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1013211954, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1013211954, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1013211954} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1013211954|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1013211954, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1013211954, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1013211954, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1013211954} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:34:14,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-2055285420 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2055285420 256)))) (or (and (= ~a~0_In-2055285420 |P1Thread1of1ForFork2_#t~ite9_Out-2055285420|) (or .cse0 .cse1)) (and (not .cse0) (= ~a$w_buff1~0_In-2055285420 |P1Thread1of1ForFork2_#t~ite9_Out-2055285420|) (not .cse1)))) InVars {~a~0=~a~0_In-2055285420, ~a$w_buff1~0=~a$w_buff1~0_In-2055285420, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2055285420, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2055285420} OutVars{~a~0=~a~0_In-2055285420, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2055285420|, ~a$w_buff1~0=~a$w_buff1~0_In-2055285420, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2055285420, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2055285420} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:34:14,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~a~0_28) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{~a~0=v_~a~0_28, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:34:14,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-23100575 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-23100575 256) 0))) (or (and (= ~a$r_buff0_thd1~0_In-23100575 ~a$r_buff0_thd1~0_Out-23100575) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-23100575)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-23100575, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-23100575} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-23100575|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-23100575, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-23100575} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:34:14,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In860023093 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In860023093 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In860023093 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In860023093 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out860023093| ~a$r_buff1_thd1~0_In860023093)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out860023093| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In860023093, ~a$w_buff0_used~0=~a$w_buff0_used~0_In860023093, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In860023093, ~a$w_buff1_used~0=~a$w_buff1_used~0_In860023093} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out860023093|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In860023093, ~a$w_buff0_used~0=~a$w_buff0_used~0_In860023093, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In860023093, ~a$w_buff1_used~0=~a$w_buff1_used~0_In860023093} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:34:14,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:34:14,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In604872486 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In604872486 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out604872486| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In604872486 |P1Thread1of1ForFork2_#t~ite11_Out604872486|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In604872486, ~a$w_buff0_used~0=~a$w_buff0_used~0_In604872486} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In604872486, ~a$w_buff0_used~0=~a$w_buff0_used~0_In604872486, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out604872486|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:34:14,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1754692131 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1754692131| ~a$w_buff0~0_In-1754692131) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-1754692131| |P2Thread1of1ForFork0_#t~ite20_Out-1754692131|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1754692131 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1754692131 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1754692131 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1754692131 256))))) (= |P2Thread1of1ForFork0_#t~ite21_Out-1754692131| |P2Thread1of1ForFork0_#t~ite20_Out-1754692131|) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-1754692131| ~a$w_buff0~0_In-1754692131)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1754692131, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1754692131, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1754692131, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1754692131, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1754692131, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1754692131|, ~weak$$choice2~0=~weak$$choice2~0_In-1754692131} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1754692131|, ~a$w_buff0~0=~a$w_buff0~0_In-1754692131, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1754692131, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1754692131, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1754692131, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1754692131|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1754692131, ~weak$$choice2~0=~weak$$choice2~0_In-1754692131} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:34:14,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1296027285 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out1296027285| |P2Thread1of1ForFork0_#t~ite24_Out1296027285|) (= |P2Thread1of1ForFork0_#t~ite23_Out1296027285| ~a$w_buff1~0_In1296027285) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1296027285 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In1296027285 256)) .cse0) (and (= (mod ~a$r_buff1_thd3~0_In1296027285 256) 0) .cse0) (= 0 (mod ~a$w_buff0_used~0_In1296027285 256)))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite23_In1296027285| |P2Thread1of1ForFork0_#t~ite23_Out1296027285|) (= ~a$w_buff1~0_In1296027285 |P2Thread1of1ForFork0_#t~ite24_Out1296027285|) (not .cse1)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1296027285, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1296027285|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1296027285, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1296027285, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1296027285, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1296027285, ~weak$$choice2~0=~weak$$choice2~0_In1296027285} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1296027285, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1296027285|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1296027285|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1296027285, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1296027285, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1296027285, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1296027285, ~weak$$choice2~0=~weak$$choice2~0_In1296027285} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:34:14,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1240338723 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out-1240338723| |P2Thread1of1ForFork0_#t~ite26_Out-1240338723|) (= ~a$w_buff0_used~0_In-1240338723 |P2Thread1of1ForFork0_#t~ite26_Out-1240338723|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1240338723 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1240338723 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-1240338723 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1240338723 256) 0))))) (and (= |P2Thread1of1ForFork0_#t~ite26_In-1240338723| |P2Thread1of1ForFork0_#t~ite26_Out-1240338723|) (= ~a$w_buff0_used~0_In-1240338723 |P2Thread1of1ForFork0_#t~ite27_Out-1240338723|) (not .cse0)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1240338723|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1240338723, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1240338723, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1240338723, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1240338723, ~weak$$choice2~0=~weak$$choice2~0_In-1240338723} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1240338723|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1240338723|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1240338723, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1240338723, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1240338723, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1240338723, ~weak$$choice2~0=~weak$$choice2~0_In-1240338723} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:34:14,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_53 v_~a$r_buff0_thd3~0_52) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:34:14,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 01:34:14,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-820506560 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-820506560 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-820506560 |P2Thread1of1ForFork0_#t~ite38_Out-820506560|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-820506560| ~a~0_In-820506560)))) InVars {~a~0=~a~0_In-820506560, ~a$w_buff1~0=~a$w_buff1~0_In-820506560, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-820506560, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-820506560} OutVars{~a~0=~a~0_In-820506560, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-820506560|, ~a$w_buff1~0=~a$w_buff1~0_In-820506560, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-820506560, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-820506560} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:34:14,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_36 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_36, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:34:14,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1895802153 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1895802153 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1895802153 |P2Thread1of1ForFork0_#t~ite40_Out-1895802153|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1895802153|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1895802153, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1895802153} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1895802153|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1895802153, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1895802153} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:34:14,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In1175508072 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1175508072 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1175508072 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1175508072 256)))) (or (and (= ~a$w_buff1_used~0_In1175508072 |P2Thread1of1ForFork0_#t~ite41_Out1175508072|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1175508072|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1175508072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1175508072, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1175508072, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1175508072} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1175508072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1175508072, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1175508072, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1175508072, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1175508072|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:34:14,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2140222563 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2140222563 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out2140222563|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In2140222563 |P2Thread1of1ForFork0_#t~ite42_Out2140222563|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2140222563, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2140222563} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2140222563, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2140222563, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out2140222563|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:34:14,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd3~0_In1884851305 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1884851305 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1884851305 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1884851305 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1884851305|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In1884851305 |P2Thread1of1ForFork0_#t~ite43_Out1884851305|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1884851305, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1884851305, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1884851305, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1884851305} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1884851305|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1884851305, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1884851305, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1884851305, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1884851305} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:34:14,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In961952464 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In961952464 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In961952464 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In961952464 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In961952464 |P1Thread1of1ForFork2_#t~ite12_Out961952464|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out961952464|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In961952464, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In961952464, ~a$w_buff0_used~0=~a$w_buff0_used~0_In961952464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In961952464} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In961952464, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In961952464, ~a$w_buff0_used~0=~a$w_buff0_used~0_In961952464, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out961952464|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In961952464} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:34:14,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1934147036 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1934147036 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1934147036|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In1934147036 |P1Thread1of1ForFork2_#t~ite13_Out1934147036|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1934147036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1934147036} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1934147036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1934147036, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1934147036|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:34:14,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1504864953 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1504864953 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1504864953 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1504864953 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1504864953| ~a$r_buff1_thd2~0_In1504864953)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1504864953| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1504864953, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1504864953, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1504864953, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1504864953} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1504864953, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1504864953, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1504864953, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1504864953, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1504864953|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:34:14,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~a$r_buff1_thd3~0_123 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:34:14,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_44| v_~a$r_buff1_thd2~0_99) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_44|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_43|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:34:14,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:34:14,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-815238874 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-815238874 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In-815238874 |ULTIMATE.start_main_#t~ite47_Out-815238874|)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-815238874 |ULTIMATE.start_main_#t~ite47_Out-815238874|)))) InVars {~a~0=~a~0_In-815238874, ~a$w_buff1~0=~a$w_buff1~0_In-815238874, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-815238874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-815238874} OutVars{~a~0=~a~0_In-815238874, ~a$w_buff1~0=~a$w_buff1~0_In-815238874, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-815238874|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-815238874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-815238874} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:34:14,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_44 |v_ULTIMATE.start_main_#t~ite47_19|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|} OutVars{~a~0=v_~a~0_44, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:34:14,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1172733633 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1172733633 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1172733633| ~a$w_buff0_used~0_In1172733633)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1172733633| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1172733633, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1172733633} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1172733633, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1172733633|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1172733633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:34:14,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1075898824 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1075898824 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1075898824 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1075898824 256)))) (or (and (= ~a$w_buff1_used~0_In1075898824 |ULTIMATE.start_main_#t~ite50_Out1075898824|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1075898824|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1075898824, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1075898824, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1075898824, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1075898824} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1075898824|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1075898824, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1075898824, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1075898824, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1075898824} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:34:14,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1641752390 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1641752390 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1641752390|)) (and (= ~a$r_buff0_thd0~0_In-1641752390 |ULTIMATE.start_main_#t~ite51_Out-1641752390|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1641752390, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1641752390} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1641752390|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1641752390, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1641752390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:34:14,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-938086588 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-938086588 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-938086588 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-938086588 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In-938086588 |ULTIMATE.start_main_#t~ite52_Out-938086588|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-938086588|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-938086588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-938086588, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-938086588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-938086588} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-938086588|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-938086588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-938086588, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-938086588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-938086588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:34:14,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~a$r_buff1_thd0~0_125 |v_ULTIMATE.start_main_#t~ite52_55|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~__unbuffered_p2_EBX~0_29 0) (= 0 v_~__unbuffered_p1_EAX~0_28) (= 1 v_~__unbuffered_p2_EAX~0_26) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~main$tmp_guard1~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= 1 v_~__unbuffered_p0_EAX~0_85)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_55|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_125, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:34:14,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:34:14 BasicIcfg [2019-12-27 01:34:14,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:34:14,441 INFO L168 Benchmark]: Toolchain (without parser) took 114878.34 ms. Allocated memory was 144.7 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.5 MB in the beginning and 916.7 MB in the end (delta: -815.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 01:34:14,442 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:34:14,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.79 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 155.4 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:34:14,443 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.21 ms. Allocated memory is still 201.9 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:34:14,443 INFO L168 Benchmark]: Boogie Preprocessor took 40.13 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:34:14,444 INFO L168 Benchmark]: RCFGBuilder took 913.04 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 99.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:34:14,445 INFO L168 Benchmark]: TraceAbstraction took 112981.84 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.9 MB in the beginning and 916.7 MB in the end (delta: -817.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-27 01:34:14,447 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.76 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 868.79 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 155.4 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.21 ms. Allocated memory is still 201.9 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.13 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 913.04 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 99.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112981.84 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.9 MB in the beginning and 916.7 MB in the end (delta: -817.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 179 ProgramPointsBefore, 94 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 7151 VarBasedMoverChecksPositive, 221 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 258 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 80759 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, 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=8, weak$$choice2=7, x=1, y=1, z=1] [L802] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, 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=8, weak$$choice2=7, x=1, y=1, z=1] [L758] 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) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 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 [L802] 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) [L803] 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)) [L804] 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)) [L805] 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)) [L806] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, 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=1, z=1] [L806] 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)) [L808] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 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)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=1, z=1] [L814] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 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 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 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 [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 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 [L850] 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, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 112.6s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 43.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9025 SDtfs, 12708 SDslu, 30918 SDs, 0 SdLazy, 20979 SolverSat, 726 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 566 GetRequests, 85 SyntacticMatches, 28 SemanticMatches, 453 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156295occurred 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: 39.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 250837 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1907 NumberOfCodeBlocks, 1907 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1801 ConstructedInterpolants, 0 QuantifiedInterpolants, 437720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...