/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:32:50,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:32:50,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:32:50,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:32:50,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:32:50,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:32:50,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:32:50,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:32:50,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:32:50,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:32:50,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:32:50,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:32:50,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:32:50,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:32:50,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:32:50,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:32:50,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:32:50,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:32:50,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:32:50,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:32:50,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:32:50,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:32:50,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:32:50,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:32:50,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:32:50,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:32:50,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:32:50,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:32:50,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:32:50,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:32:50,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:32:50,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:32:50,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:32:50,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:32:50,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:32:50,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:32:50,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:32:50,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:32:50,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:32:50,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:32:50,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:32:50,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:32:50,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:32:50,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:32:50,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:32:50,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:32:50,398 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:32:50,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:32:50,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:32:50,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:32:50,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:32:50,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:32:50,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:32:50,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:32:50,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:32:50,403 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:32:50,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:32:50,403 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:32:50,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:32:50,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:32:50,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:32:50,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:32:50,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:32:50,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:32:50,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:32:50,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:32:50,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:32:50,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:32:50,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:32:50,407 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:32:50,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:32:50,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:32:50,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:32:50,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:32:50,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:32:50,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:32:50,742 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:32:50,743 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i [2019-12-18 22:32:50,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4593908b/6f91d46c9c794bda97c12a1b4caff55a/FLAG653502ae3 [2019-12-18 22:32:51,394 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:32:51,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i [2019-12-18 22:32:51,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4593908b/6f91d46c9c794bda97c12a1b4caff55a/FLAG653502ae3 [2019-12-18 22:32:51,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4593908b/6f91d46c9c794bda97c12a1b4caff55a [2019-12-18 22:32:51,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:32:51,678 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:32:51,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:32:51,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:32:51,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:32:51,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:32:51" (1/1) ... [2019-12-18 22:32:51,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:51, skipping insertion in model container [2019-12-18 22:32:51,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:32:51" (1/1) ... [2019-12-18 22:32:51,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:32:51,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:32:52,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:32:52,243 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:32:52,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:32:52,386 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:32:52,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52 WrapperNode [2019-12-18 22:32:52,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:32:52,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:32:52,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:32:52,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:32:52,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (1/1) ... [2019-12-18 22:32:52,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (1/1) ... [2019-12-18 22:32:52,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:32:52,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:32:52,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:32:52,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:32:52,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (1/1) ... [2019-12-18 22:32:52,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (1/1) ... [2019-12-18 22:32:52,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (1/1) ... [2019-12-18 22:32:52,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (1/1) ... [2019-12-18 22:32:52,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (1/1) ... [2019-12-18 22:32:52,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (1/1) ... [2019-12-18 22:32:52,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (1/1) ... [2019-12-18 22:32:52,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:32:52,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:32:52,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:32:52,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:32:52,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:32:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:32:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:32:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:32:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:32:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:32:52,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:32:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:32:52,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:32:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:32:52,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:32:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:32:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:32:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:32:52,580 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:32:53,310 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:32:53,310 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:32:53,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:32:53 BoogieIcfgContainer [2019-12-18 22:32:53,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:32:53,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:32:53,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:32:53,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:32:53,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:32:51" (1/3) ... [2019-12-18 22:32:53,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497b4a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:32:53, skipping insertion in model container [2019-12-18 22:32:53,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:32:52" (2/3) ... [2019-12-18 22:32:53,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497b4a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:32:53, skipping insertion in model container [2019-12-18 22:32:53,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:32:53" (3/3) ... [2019-12-18 22:32:53,327 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc.i [2019-12-18 22:32:53,339 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:32:53,339 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:32:53,353 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:32:53,354 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:32:53,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,425 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,426 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,463 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,464 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,464 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,465 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,466 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,487 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,487 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,538 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,538 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:32:53,564 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:32:53,582 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:32:53,583 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:32:53,583 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:32:53,583 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:32:53,583 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:32:53,583 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:32:53,583 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:32:53,583 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:32:53,600 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 22:32:53,601 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 22:32:53,686 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 22:32:53,686 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:32:53,706 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:32:53,733 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 22:32:53,777 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 22:32:53,777 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:32:53,785 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:32:53,804 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:32:53,806 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:32:57,587 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 22:32:57,726 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 22:32:57,798 INFO L206 etLargeBlockEncoding]: Checked pairs total: 67273 [2019-12-18 22:32:57,799 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 22:32:57,802 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 89 transitions [2019-12-18 22:33:08,293 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-18 22:33:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-18 22:33:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:33:08,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:08,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:33:08,302 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash 800242347, now seen corresponding path program 1 times [2019-12-18 22:33:08,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:08,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288477174] [2019-12-18 22:33:08,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:08,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288477174] [2019-12-18 22:33:08,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:08,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:33:08,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947185292] [2019-12-18 22:33:08,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:08,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:08,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:08,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:08,643 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-18 22:33:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:11,697 INFO L93 Difference]: Finished difference Result 84146 states and 359873 transitions. [2019-12-18 22:33:11,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:11,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:33:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:12,376 INFO L225 Difference]: With dead ends: 84146 [2019-12-18 22:33:12,376 INFO L226 Difference]: Without dead ends: 79232 [2019-12-18 22:33:12,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79232 states. [2019-12-18 22:33:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79232 to 79232. [2019-12-18 22:33:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79232 states. [2019-12-18 22:33:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79232 states to 79232 states and 338383 transitions. [2019-12-18 22:33:22,458 INFO L78 Accepts]: Start accepts. Automaton has 79232 states and 338383 transitions. Word has length 5 [2019-12-18 22:33:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:22,458 INFO L462 AbstractCegarLoop]: Abstraction has 79232 states and 338383 transitions. [2019-12-18 22:33:22,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 79232 states and 338383 transitions. [2019-12-18 22:33:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:33:22,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:22,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:22,468 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash 438269963, now seen corresponding path program 1 times [2019-12-18 22:33:22,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:22,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852487540] [2019-12-18 22:33:22,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:22,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852487540] [2019-12-18 22:33:22,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:22,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:22,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935709589] [2019-12-18 22:33:22,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:33:22,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:22,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:33:22,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:33:22,564 INFO L87 Difference]: Start difference. First operand 79232 states and 338383 transitions. Second operand 4 states. [2019-12-18 22:33:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:23,488 INFO L93 Difference]: Finished difference Result 121026 states and 493729 transitions. [2019-12-18 22:33:23,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:33:23,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:33:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:24,999 INFO L225 Difference]: With dead ends: 121026 [2019-12-18 22:33:24,999 INFO L226 Difference]: Without dead ends: 120935 [2019-12-18 22:33:25,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:33:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120935 states. [2019-12-18 22:33:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120935 to 109733. [2019-12-18 22:33:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109733 states. [2019-12-18 22:33:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109733 states to 109733 states and 453798 transitions. [2019-12-18 22:33:34,382 INFO L78 Accepts]: Start accepts. Automaton has 109733 states and 453798 transitions. Word has length 13 [2019-12-18 22:33:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:34,383 INFO L462 AbstractCegarLoop]: Abstraction has 109733 states and 453798 transitions. [2019-12-18 22:33:34,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:33:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 109733 states and 453798 transitions. [2019-12-18 22:33:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:33:34,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:34,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:34,388 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:34,389 INFO L82 PathProgramCache]: Analyzing trace with hash 777110306, now seen corresponding path program 1 times [2019-12-18 22:33:34,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:34,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608265539] [2019-12-18 22:33:34,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:34,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608265539] [2019-12-18 22:33:34,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:34,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:34,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474388751] [2019-12-18 22:33:34,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:33:34,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:33:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:33:34,476 INFO L87 Difference]: Start difference. First operand 109733 states and 453798 transitions. Second operand 4 states. [2019-12-18 22:33:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:35,474 INFO L93 Difference]: Finished difference Result 151774 states and 613241 transitions. [2019-12-18 22:33:35,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:33:35,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:33:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:41,059 INFO L225 Difference]: With dead ends: 151774 [2019-12-18 22:33:41,060 INFO L226 Difference]: Without dead ends: 151670 [2019-12-18 22:33:41,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:33:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151670 states. [2019-12-18 22:33:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151670 to 127872. [2019-12-18 22:33:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127872 states. [2019-12-18 22:33:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127872 states to 127872 states and 526262 transitions. [2019-12-18 22:33:47,014 INFO L78 Accepts]: Start accepts. Automaton has 127872 states and 526262 transitions. Word has length 13 [2019-12-18 22:33:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:47,014 INFO L462 AbstractCegarLoop]: Abstraction has 127872 states and 526262 transitions. [2019-12-18 22:33:47,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:33:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 127872 states and 526262 transitions. [2019-12-18 22:33:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:33:47,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:47,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:47,018 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2011904106, now seen corresponding path program 1 times [2019-12-18 22:33:47,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:47,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274814875] [2019-12-18 22:33:47,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:47,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274814875] [2019-12-18 22:33:47,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:47,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:33:47,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598712570] [2019-12-18 22:33:47,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:33:47,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:47,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:33:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:33:47,161 INFO L87 Difference]: Start difference. First operand 127872 states and 526262 transitions. Second operand 5 states. [2019-12-18 22:33:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:49,354 INFO L93 Difference]: Finished difference Result 172642 states and 696404 transitions. [2019-12-18 22:33:49,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:33:49,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 22:33:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:49,837 INFO L225 Difference]: With dead ends: 172642 [2019-12-18 22:33:49,837 INFO L226 Difference]: Without dead ends: 172506 [2019-12-18 22:33:49,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:33:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172506 states. [2019-12-18 22:34:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172506 to 133126. [2019-12-18 22:34:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133126 states. [2019-12-18 22:34:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133126 states to 133126 states and 547571 transitions. [2019-12-18 22:34:03,158 INFO L78 Accepts]: Start accepts. Automaton has 133126 states and 547571 transitions. Word has length 14 [2019-12-18 22:34:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:03,159 INFO L462 AbstractCegarLoop]: Abstraction has 133126 states and 547571 transitions. [2019-12-18 22:34:03,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:34:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 133126 states and 547571 transitions. [2019-12-18 22:34:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 22:34:03,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:03,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:03,181 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash 548423730, now seen corresponding path program 1 times [2019-12-18 22:34:03,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:03,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29553721] [2019-12-18 22:34:03,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:03,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-18 22:34:03,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29553721] [2019-12-18 22:34:03,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:03,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:34:03,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524439906] [2019-12-18 22:34:03,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:34:03,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:03,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:34:03,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:03,265 INFO L87 Difference]: Start difference. First operand 133126 states and 547571 transitions. Second operand 3 states. [2019-12-18 22:34:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:03,891 INFO L93 Difference]: Finished difference Result 132731 states and 546022 transitions. [2019-12-18 22:34:03,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:34:03,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 22:34:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:04,230 INFO L225 Difference]: With dead ends: 132731 [2019-12-18 22:34:04,230 INFO L226 Difference]: Without dead ends: 132731 [2019-12-18 22:34:04,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132731 states. [2019-12-18 22:34:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132731 to 132731. [2019-12-18 22:34:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132731 states. [2019-12-18 22:34:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132731 states to 132731 states and 546022 transitions. [2019-12-18 22:34:15,189 INFO L78 Accepts]: Start accepts. Automaton has 132731 states and 546022 transitions. Word has length 18 [2019-12-18 22:34:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:15,189 INFO L462 AbstractCegarLoop]: Abstraction has 132731 states and 546022 transitions. [2019-12-18 22:34:15,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 132731 states and 546022 transitions. [2019-12-18 22:34:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:34:15,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:15,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:15,211 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:15,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash -300265676, now seen corresponding path program 1 times [2019-12-18 22:34:15,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:15,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488019598] [2019-12-18 22:34:15,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:15,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488019598] [2019-12-18 22:34:15,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:15,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:34:15,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348126276] [2019-12-18 22:34:15,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:34:15,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:34:15,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:15,261 INFO L87 Difference]: Start difference. First operand 132731 states and 546022 transitions. Second operand 3 states. [2019-12-18 22:34:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:16,944 INFO L93 Difference]: Finished difference Result 132024 states and 543090 transitions. [2019-12-18 22:34:16,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:34:16,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 22:34:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:17,380 INFO L225 Difference]: With dead ends: 132024 [2019-12-18 22:34:17,380 INFO L226 Difference]: Without dead ends: 132024 [2019-12-18 22:34:17,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132024 states. [2019-12-18 22:34:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132024 to 132024. [2019-12-18 22:34:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132024 states. [2019-12-18 22:34:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132024 states to 132024 states and 543090 transitions. [2019-12-18 22:34:29,332 INFO L78 Accepts]: Start accepts. Automaton has 132024 states and 543090 transitions. Word has length 19 [2019-12-18 22:34:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:29,332 INFO L462 AbstractCegarLoop]: Abstraction has 132024 states and 543090 transitions. [2019-12-18 22:34:29,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 132024 states and 543090 transitions. [2019-12-18 22:34:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:34:29,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:29,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:29,351 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:29,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:29,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1452908293, now seen corresponding path program 1 times [2019-12-18 22:34:29,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:29,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626712655] [2019-12-18 22:34:29,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:29,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626712655] [2019-12-18 22:34:29,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:29,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:34:29,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805853355] [2019-12-18 22:34:29,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:34:29,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:29,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:34:29,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:29,435 INFO L87 Difference]: Start difference. First operand 132024 states and 543090 transitions. Second operand 5 states. [2019-12-18 22:34:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:35,718 INFO L93 Difference]: Finished difference Result 180078 states and 725535 transitions. [2019-12-18 22:34:35,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:34:35,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:34:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:36,247 INFO L225 Difference]: With dead ends: 180078 [2019-12-18 22:34:36,247 INFO L226 Difference]: Without dead ends: 179909 [2019-12-18 22:34:36,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:34:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179909 states. [2019-12-18 22:34:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179909 to 135986. [2019-12-18 22:34:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135986 states. [2019-12-18 22:34:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135986 states to 135986 states and 558627 transitions. [2019-12-18 22:34:43,099 INFO L78 Accepts]: Start accepts. Automaton has 135986 states and 558627 transitions. Word has length 19 [2019-12-18 22:34:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:43,100 INFO L462 AbstractCegarLoop]: Abstraction has 135986 states and 558627 transitions. [2019-12-18 22:34:43,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:34:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 135986 states and 558627 transitions. [2019-12-18 22:34:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 22:34:43,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:43,121 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] [2019-12-18 22:34:43,122 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash -587248710, now seen corresponding path program 1 times [2019-12-18 22:34:43,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:43,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091290325] [2019-12-18 22:34:43,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:43,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091290325] [2019-12-18 22:34:43,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:43,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:43,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703167511] [2019-12-18 22:34:43,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:43,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:43,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:43,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:43,178 INFO L87 Difference]: Start difference. First operand 135986 states and 558627 transitions. Second operand 4 states. [2019-12-18 22:34:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:45,125 INFO L93 Difference]: Finished difference Result 215909 states and 890723 transitions. [2019-12-18 22:34:45,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:34:45,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-18 22:34:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:45,427 INFO L225 Difference]: With dead ends: 215909 [2019-12-18 22:34:45,427 INFO L226 Difference]: Without dead ends: 105433 [2019-12-18 22:34:45,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105433 states. [2019-12-18 22:34:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105433 to 105432. [2019-12-18 22:34:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105432 states. [2019-12-18 22:34:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105432 states to 105432 states and 429848 transitions. [2019-12-18 22:34:56,481 INFO L78 Accepts]: Start accepts. Automaton has 105432 states and 429848 transitions. Word has length 20 [2019-12-18 22:34:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:56,482 INFO L462 AbstractCegarLoop]: Abstraction has 105432 states and 429848 transitions. [2019-12-18 22:34:56,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 105432 states and 429848 transitions. [2019-12-18 22:34:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 22:34:56,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:56,507 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] [2019-12-18 22:34:56,507 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:56,508 INFO L82 PathProgramCache]: Analyzing trace with hash 402034233, now seen corresponding path program 1 times [2019-12-18 22:34:56,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:56,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435298504] [2019-12-18 22:34:56,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:56,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435298504] [2019-12-18 22:34:56,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:56,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:56,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851724275] [2019-12-18 22:34:56,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:56,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:56,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:56,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:56,570 INFO L87 Difference]: Start difference. First operand 105432 states and 429848 transitions. Second operand 4 states. [2019-12-18 22:34:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:58,446 INFO L93 Difference]: Finished difference Result 180669 states and 738829 transitions. [2019-12-18 22:34:58,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:34:58,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 22:34:58,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:58,711 INFO L225 Difference]: With dead ends: 180669 [2019-12-18 22:34:58,711 INFO L226 Difference]: Without dead ends: 93245 [2019-12-18 22:34:58,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93245 states. [2019-12-18 22:35:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93245 to 86281. [2019-12-18 22:35:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86281 states. [2019-12-18 22:35:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86281 states to 86281 states and 352873 transitions. [2019-12-18 22:35:08,046 INFO L78 Accepts]: Start accepts. Automaton has 86281 states and 352873 transitions. Word has length 21 [2019-12-18 22:35:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:08,046 INFO L462 AbstractCegarLoop]: Abstraction has 86281 states and 352873 transitions. [2019-12-18 22:35:08,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:35:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 86281 states and 352873 transitions. [2019-12-18 22:35:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 22:35:08,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:08,061 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] [2019-12-18 22:35:08,061 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:08,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1125330895, now seen corresponding path program 2 times [2019-12-18 22:35:08,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:08,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057392938] [2019-12-18 22:35:08,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:08,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057392938] [2019-12-18 22:35:08,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:08,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:35:08,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427328203] [2019-12-18 22:35:08,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:35:08,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:08,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:35:08,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:35:08,120 INFO L87 Difference]: Start difference. First operand 86281 states and 352873 transitions. Second operand 4 states. [2019-12-18 22:35:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:08,234 INFO L93 Difference]: Finished difference Result 21255 states and 73968 transitions. [2019-12-18 22:35:08,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:35:08,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 22:35:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:08,264 INFO L225 Difference]: With dead ends: 21255 [2019-12-18 22:35:08,264 INFO L226 Difference]: Without dead ends: 17290 [2019-12-18 22:35:08,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2019-12-18 22:35:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17289. [2019-12-18 22:35:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17289 states. [2019-12-18 22:35:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17289 states to 17289 states and 57966 transitions. [2019-12-18 22:35:08,565 INFO L78 Accepts]: Start accepts. Automaton has 17289 states and 57966 transitions. Word has length 21 [2019-12-18 22:35:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:08,565 INFO L462 AbstractCegarLoop]: Abstraction has 17289 states and 57966 transitions. [2019-12-18 22:35:08,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:35:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 17289 states and 57966 transitions. [2019-12-18 22:35:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:35:08,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:08,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:08,568 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash 308223967, now seen corresponding path program 1 times [2019-12-18 22:35:08,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:08,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60729083] [2019-12-18 22:35:08,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:08,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60729083] [2019-12-18 22:35:08,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:08,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:35:08,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825178189] [2019-12-18 22:35:08,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:35:08,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:35:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:35:08,642 INFO L87 Difference]: Start difference. First operand 17289 states and 57966 transitions. Second operand 6 states. [2019-12-18 22:35:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:09,127 INFO L93 Difference]: Finished difference Result 17791 states and 58588 transitions. [2019-12-18 22:35:09,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:35:09,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 22:35:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:09,169 INFO L225 Difference]: With dead ends: 17791 [2019-12-18 22:35:09,169 INFO L226 Difference]: Without dead ends: 17166 [2019-12-18 22:35:09,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:35:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17166 states. [2019-12-18 22:35:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17166 to 16399. [2019-12-18 22:35:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16399 states. [2019-12-18 22:35:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16399 states to 16399 states and 55269 transitions. [2019-12-18 22:35:10,188 INFO L78 Accepts]: Start accepts. Automaton has 16399 states and 55269 transitions. Word has length 22 [2019-12-18 22:35:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:10,189 INFO L462 AbstractCegarLoop]: Abstraction has 16399 states and 55269 transitions. [2019-12-18 22:35:10,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:35:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 16399 states and 55269 transitions. [2019-12-18 22:35:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 22:35:10,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:10,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:10,196 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash 436815580, now seen corresponding path program 1 times [2019-12-18 22:35:10,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:10,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016475766] [2019-12-18 22:35:10,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:10,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016475766] [2019-12-18 22:35:10,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:10,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:35:10,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528742570] [2019-12-18 22:35:10,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:35:10,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:10,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:35:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:10,273 INFO L87 Difference]: Start difference. First operand 16399 states and 55269 transitions. Second operand 5 states. [2019-12-18 22:35:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:10,355 INFO L93 Difference]: Finished difference Result 6210 states and 19104 transitions. [2019-12-18 22:35:10,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:35:10,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 22:35:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:10,365 INFO L225 Difference]: With dead ends: 6210 [2019-12-18 22:35:10,365 INFO L226 Difference]: Without dead ends: 5284 [2019-12-18 22:35:10,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:35:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5284 states. [2019-12-18 22:35:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5284 to 5284. [2019-12-18 22:35:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5284 states. [2019-12-18 22:35:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5284 states to 5284 states and 16086 transitions. [2019-12-18 22:35:10,472 INFO L78 Accepts]: Start accepts. Automaton has 5284 states and 16086 transitions. Word has length 28 [2019-12-18 22:35:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:10,473 INFO L462 AbstractCegarLoop]: Abstraction has 5284 states and 16086 transitions. [2019-12-18 22:35:10,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:35:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 5284 states and 16086 transitions. [2019-12-18 22:35:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:35:10,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:10,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:10,480 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:10,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:10,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1811345120, now seen corresponding path program 1 times [2019-12-18 22:35:10,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:10,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553196979] [2019-12-18 22:35:10,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:10,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553196979] [2019-12-18 22:35:10,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:10,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:35:10,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035093025] [2019-12-18 22:35:10,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:35:10,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:10,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:35:10,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:35:10,607 INFO L87 Difference]: Start difference. First operand 5284 states and 16086 transitions. Second operand 7 states. [2019-12-18 22:35:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:11,035 INFO L93 Difference]: Finished difference Result 5396 states and 16287 transitions. [2019-12-18 22:35:11,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:35:11,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 22:35:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:11,047 INFO L225 Difference]: With dead ends: 5396 [2019-12-18 22:35:11,047 INFO L226 Difference]: Without dead ends: 4826 [2019-12-18 22:35:11,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:35:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4826 states. [2019-12-18 22:35:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4826 to 4826. [2019-12-18 22:35:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4826 states. [2019-12-18 22:35:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 15164 transitions. [2019-12-18 22:35:11,166 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 15164 transitions. Word has length 40 [2019-12-18 22:35:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:11,166 INFO L462 AbstractCegarLoop]: Abstraction has 4826 states and 15164 transitions. [2019-12-18 22:35:11,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:35:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 15164 transitions. [2019-12-18 22:35:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:35:11,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:11,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:11,181 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:11,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash 659059963, now seen corresponding path program 1 times [2019-12-18 22:35:11,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:11,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505916881] [2019-12-18 22:35:11,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:11,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505916881] [2019-12-18 22:35:11,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:11,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:35:11,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354801403] [2019-12-18 22:35:11,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:35:11,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:11,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:35:11,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:11,267 INFO L87 Difference]: Start difference. First operand 4826 states and 15164 transitions. Second operand 5 states. [2019-12-18 22:35:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:11,771 INFO L93 Difference]: Finished difference Result 8784 states and 26754 transitions. [2019-12-18 22:35:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:35:11,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 22:35:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:11,792 INFO L225 Difference]: With dead ends: 8784 [2019-12-18 22:35:11,792 INFO L226 Difference]: Without dead ends: 8784 [2019-12-18 22:35:11,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:35:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8784 states. [2019-12-18 22:35:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8784 to 8095. [2019-12-18 22:35:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-18 22:35:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 24870 transitions. [2019-12-18 22:35:11,983 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 24870 transitions. Word has length 40 [2019-12-18 22:35:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:11,984 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 24870 transitions. [2019-12-18 22:35:11,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:35:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 24870 transitions. [2019-12-18 22:35:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:35:11,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:11,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:11,998 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:11,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:11,999 INFO L82 PathProgramCache]: Analyzing trace with hash -511847359, now seen corresponding path program 2 times [2019-12-18 22:35:11,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:11,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594399700] [2019-12-18 22:35:12,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:12,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594399700] [2019-12-18 22:35:12,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:12,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:35:12,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544235488] [2019-12-18 22:35:12,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:35:12,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:35:12,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:35:12,148 INFO L87 Difference]: Start difference. First operand 8095 states and 24870 transitions. Second operand 6 states. [2019-12-18 22:35:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:12,882 INFO L93 Difference]: Finished difference Result 16182 states and 49273 transitions. [2019-12-18 22:35:12,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:35:12,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 22:35:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:12,913 INFO L225 Difference]: With dead ends: 16182 [2019-12-18 22:35:12,914 INFO L226 Difference]: Without dead ends: 16182 [2019-12-18 22:35:12,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:35:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16182 states. [2019-12-18 22:35:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16182 to 10359. [2019-12-18 22:35:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2019-12-18 22:35:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 31875 transitions. [2019-12-18 22:35:13,093 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 31875 transitions. Word has length 40 [2019-12-18 22:35:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:13,093 INFO L462 AbstractCegarLoop]: Abstraction has 10359 states and 31875 transitions. [2019-12-18 22:35:13,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:35:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 31875 transitions. [2019-12-18 22:35:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:35:13,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:13,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:13,104 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2125995049, now seen corresponding path program 3 times [2019-12-18 22:35:13,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:13,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708446457] [2019-12-18 22:35:13,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:13,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708446457] [2019-12-18 22:35:13,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:13,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:35:13,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221520812] [2019-12-18 22:35:13,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:35:13,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:35:13,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:13,520 INFO L87 Difference]: Start difference. First operand 10359 states and 31875 transitions. Second operand 3 states. [2019-12-18 22:35:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:13,557 INFO L93 Difference]: Finished difference Result 7539 states and 22709 transitions. [2019-12-18 22:35:13,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:35:13,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 22:35:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:13,570 INFO L225 Difference]: With dead ends: 7539 [2019-12-18 22:35:13,570 INFO L226 Difference]: Without dead ends: 7539 [2019-12-18 22:35:13,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-18 22:35:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 7519. [2019-12-18 22:35:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7519 states. [2019-12-18 22:35:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7519 states to 7519 states and 22655 transitions. [2019-12-18 22:35:13,725 INFO L78 Accepts]: Start accepts. Automaton has 7519 states and 22655 transitions. Word has length 40 [2019-12-18 22:35:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:13,725 INFO L462 AbstractCegarLoop]: Abstraction has 7519 states and 22655 transitions. [2019-12-18 22:35:13,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:35:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 7519 states and 22655 transitions. [2019-12-18 22:35:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:35:13,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:13,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:13,736 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:13,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash -763910375, now seen corresponding path program 1 times [2019-12-18 22:35:13,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:13,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310428348] [2019-12-18 22:35:13,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:13,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310428348] [2019-12-18 22:35:13,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:13,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:35:13,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760176612] [2019-12-18 22:35:13,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:35:13,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:13,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:35:13,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:35:13,813 INFO L87 Difference]: Start difference. First operand 7519 states and 22655 transitions. Second operand 6 states. [2019-12-18 22:35:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:14,445 INFO L93 Difference]: Finished difference Result 9818 states and 28955 transitions. [2019-12-18 22:35:14,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:35:14,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 22:35:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:14,462 INFO L225 Difference]: With dead ends: 9818 [2019-12-18 22:35:14,463 INFO L226 Difference]: Without dead ends: 9818 [2019-12-18 22:35:14,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:35:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9818 states. [2019-12-18 22:35:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9818 to 7811. [2019-12-18 22:35:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7811 states. [2019-12-18 22:35:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 23517 transitions. [2019-12-18 22:35:14,603 INFO L78 Accepts]: Start accepts. Automaton has 7811 states and 23517 transitions. Word has length 41 [2019-12-18 22:35:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:14,604 INFO L462 AbstractCegarLoop]: Abstraction has 7811 states and 23517 transitions. [2019-12-18 22:35:14,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:35:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7811 states and 23517 transitions. [2019-12-18 22:35:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:35:14,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:14,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:14,611 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1724530801, now seen corresponding path program 2 times [2019-12-18 22:35:14,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:14,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323525651] [2019-12-18 22:35:14,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:14,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323525651] [2019-12-18 22:35:14,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:14,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:35:14,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778839000] [2019-12-18 22:35:14,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:35:14,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:14,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:35:14,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:14,670 INFO L87 Difference]: Start difference. First operand 7811 states and 23517 transitions. Second operand 3 states. [2019-12-18 22:35:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:14,714 INFO L93 Difference]: Finished difference Result 7742 states and 23271 transitions. [2019-12-18 22:35:14,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:35:14,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 22:35:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:14,727 INFO L225 Difference]: With dead ends: 7742 [2019-12-18 22:35:14,727 INFO L226 Difference]: Without dead ends: 7742 [2019-12-18 22:35:14,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7742 states. [2019-12-18 22:35:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7742 to 6646. [2019-12-18 22:35:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6646 states. [2019-12-18 22:35:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 20172 transitions. [2019-12-18 22:35:14,839 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 20172 transitions. Word has length 41 [2019-12-18 22:35:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:14,840 INFO L462 AbstractCegarLoop]: Abstraction has 6646 states and 20172 transitions. [2019-12-18 22:35:14,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:35:14,840 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 20172 transitions. [2019-12-18 22:35:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 22:35:14,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:14,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:14,846 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash -722539357, now seen corresponding path program 1 times [2019-12-18 22:35:14,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:14,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853653066] [2019-12-18 22:35:14,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:14,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853653066] [2019-12-18 22:35:14,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:14,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:35:14,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035482342] [2019-12-18 22:35:14,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:35:14,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:14,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:35:14,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:35:14,934 INFO L87 Difference]: Start difference. First operand 6646 states and 20172 transitions. Second operand 6 states. [2019-12-18 22:35:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:15,014 INFO L93 Difference]: Finished difference Result 5844 states and 18188 transitions. [2019-12-18 22:35:15,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:35:15,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 22:35:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:15,023 INFO L225 Difference]: With dead ends: 5844 [2019-12-18 22:35:15,024 INFO L226 Difference]: Without dead ends: 5758 [2019-12-18 22:35:15,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:35:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2019-12-18 22:35:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 5758. [2019-12-18 22:35:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5758 states. [2019-12-18 22:35:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5758 states to 5758 states and 17985 transitions. [2019-12-18 22:35:15,104 INFO L78 Accepts]: Start accepts. Automaton has 5758 states and 17985 transitions. Word has length 42 [2019-12-18 22:35:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:15,104 INFO L462 AbstractCegarLoop]: Abstraction has 5758 states and 17985 transitions. [2019-12-18 22:35:15,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:35:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5758 states and 17985 transitions. [2019-12-18 22:35:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:35:15,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:15,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:15,112 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash 11031254, now seen corresponding path program 1 times [2019-12-18 22:35:15,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:15,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433298048] [2019-12-18 22:35:15,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:15,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433298048] [2019-12-18 22:35:15,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:15,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:35:15,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119687918] [2019-12-18 22:35:15,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:35:15,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:15,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:35:15,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:35:15,292 INFO L87 Difference]: Start difference. First operand 5758 states and 17985 transitions. Second operand 11 states. [2019-12-18 22:35:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:16,372 INFO L93 Difference]: Finished difference Result 11268 states and 34469 transitions. [2019-12-18 22:35:16,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 22:35:16,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 22:35:16,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:16,386 INFO L225 Difference]: With dead ends: 11268 [2019-12-18 22:35:16,386 INFO L226 Difference]: Without dead ends: 7696 [2019-12-18 22:35:16,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 22:35:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7696 states. [2019-12-18 22:35:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7696 to 6798. [2019-12-18 22:35:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6798 states. [2019-12-18 22:35:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6798 states to 6798 states and 20667 transitions. [2019-12-18 22:35:16,514 INFO L78 Accepts]: Start accepts. Automaton has 6798 states and 20667 transitions. Word has length 56 [2019-12-18 22:35:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:16,514 INFO L462 AbstractCegarLoop]: Abstraction has 6798 states and 20667 transitions. [2019-12-18 22:35:16,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:35:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 6798 states and 20667 transitions. [2019-12-18 22:35:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:35:16,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:16,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:16,522 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2026976572, now seen corresponding path program 2 times [2019-12-18 22:35:16,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:16,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442123096] [2019-12-18 22:35:16,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:16,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442123096] [2019-12-18 22:35:16,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:16,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:35:16,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288304236] [2019-12-18 22:35:16,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:35:16,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:16,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:35:16,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:35:16,716 INFO L87 Difference]: Start difference. First operand 6798 states and 20667 transitions. Second operand 12 states. [2019-12-18 22:35:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:17,763 INFO L93 Difference]: Finished difference Result 8036 states and 23755 transitions. [2019-12-18 22:35:17,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 22:35:17,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 22:35:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:17,775 INFO L225 Difference]: With dead ends: 8036 [2019-12-18 22:35:17,776 INFO L226 Difference]: Without dead ends: 7280 [2019-12-18 22:35:17,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-18 22:35:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7280 states. [2019-12-18 22:35:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7280 to 6526. [2019-12-18 22:35:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-12-18 22:35:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 19923 transitions. [2019-12-18 22:35:17,877 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 19923 transitions. Word has length 56 [2019-12-18 22:35:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:17,877 INFO L462 AbstractCegarLoop]: Abstraction has 6526 states and 19923 transitions. [2019-12-18 22:35:17,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:35:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 19923 transitions. [2019-12-18 22:35:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:35:17,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:17,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:17,884 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:17,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:17,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1554893024, now seen corresponding path program 3 times [2019-12-18 22:35:17,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:17,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808933656] [2019-12-18 22:35:17,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:35:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:35:18,039 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:35:18,039 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:35:18,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~main$tmp_guard1~0_16 0) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~x$w_buff1~0_25) (= 0 v_~x$r_buff0_thd1~0_72) (= 0 v_~__unbuffered_p0_EAX~0_12) (= 0 v_~x$r_buff0_thd0~0_21) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25|)) (= v_~x$r_buff1_thd2~0_18 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25| 1)) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (= v_~x$flush_delayed~0_12 0) (= 0 |v_ULTIMATE.start_main_~#t2055~0.offset_19|) (= 0 v_~__unbuffered_p2_EAX~0_12) (= v_~__unbuffered_p0_EBX~0_12 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| 4)) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff0_used~0_114) (= v_~x~0_22 0) (= 0 v_~x$r_buff0_thd2~0_25) (= v_~y~0_10 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25|) |v_ULTIMATE.start_main_~#t2055~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~z~0_8) (= 0 v_~x$w_buff0~0_31) (= v_~x$r_buff1_thd0~0_19 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2055~0.base_25|) (= v_~x$r_buff1_thd3~0_16 0) (= v_~x$w_buff1_used~0_69 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_69, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_72, ULTIMATE.start_main_~#t2055~0.base=|v_ULTIMATE.start_main_~#t2055~0.base_25|, ULTIMATE.start_main_~#t2055~0.offset=|v_ULTIMATE.start_main_~#t2055~0.offset_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_10, ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_114, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2056~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2057~0.base, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2055~0.base, ULTIMATE.start_main_~#t2055~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2057~0.offset, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2056~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:35:18,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2056~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= |v_ULTIMATE.start_main_~#t2056~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10|) |v_ULTIMATE.start_main_~#t2056~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2056~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2056~0.base] because there is no mapped edge [2019-12-18 22:35:18,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2057~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11|) |v_ULTIMATE.start_main_~#t2057~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2057~0.base_11| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t2057~0.offset_10| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2057~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2057~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 22:35:18,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$w_buff1_used~0_42 v_~x$w_buff0_used~0_72) (= 0 (mod v_~x$w_buff1_used~0_42 256)) (= 1 v_~x$w_buff0_used~0_71) (= 1 v_~x$w_buff0~0_16) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:35:18,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-1572351533 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1572351533 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1572351533 |P2Thread1of1ForFork1_#t~ite32_Out-1572351533|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-1572351533| ~x~0_In-1572351533)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1572351533, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1572351533, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1572351533, ~x~0=~x~0_In-1572351533} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1572351533|, ~x$w_buff1~0=~x$w_buff1~0_In-1572351533, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1572351533, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1572351533, ~x~0=~x~0_In-1572351533} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:35:18,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:35:18,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1573285783 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1573285783 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1573285783|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1573285783 |P2Thread1of1ForFork1_#t~ite34_Out1573285783|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1573285783, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573285783} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1573285783|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1573285783, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573285783} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:35:18,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2088136500 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2088136500 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-2088136500|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-2088136500| ~x$w_buff0_used~0_In-2088136500)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2088136500, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2088136500} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2088136500, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2088136500|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2088136500} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:35:18,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In946185031 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In946185031 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In946185031 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In946185031 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out946185031|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In946185031 |P1Thread1of1ForFork0_#t~ite29_Out946185031|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In946185031, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In946185031, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In946185031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In946185031} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In946185031, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In946185031, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In946185031, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out946185031|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In946185031} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:35:18,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-783008186 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In-783008186| |P0Thread1of1ForFork2_#t~ite8_Out-783008186|) (= ~x$w_buff0~0_In-783008186 |P0Thread1of1ForFork2_#t~ite9_Out-783008186|)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-783008186| ~x$w_buff0~0_In-783008186) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-783008186 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-783008186 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-783008186 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-783008186 256))))) (= |P0Thread1of1ForFork2_#t~ite8_Out-783008186| |P0Thread1of1ForFork2_#t~ite9_Out-783008186|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-783008186, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-783008186, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-783008186|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-783008186, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-783008186, ~weak$$choice2~0=~weak$$choice2~0_In-783008186, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-783008186} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-783008186, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-783008186, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-783008186|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-783008186, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-783008186|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-783008186, ~weak$$choice2~0=~weak$$choice2~0_In-783008186, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-783008186} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 22:35:18,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2014905952 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out2014905952| ~x$w_buff0_used~0_In2014905952) (= |P0Thread1of1ForFork2_#t~ite14_In2014905952| |P0Thread1of1ForFork2_#t~ite14_Out2014905952|)) (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In2014905952 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In2014905952 256) 0)) (and (= (mod ~x$w_buff1_used~0_In2014905952 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In2014905952 256)))) (= ~x$w_buff0_used~0_In2014905952 |P0Thread1of1ForFork2_#t~ite14_Out2014905952|) (= |P0Thread1of1ForFork2_#t~ite15_Out2014905952| |P0Thread1of1ForFork2_#t~ite14_Out2014905952|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2014905952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2014905952, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2014905952, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In2014905952|, ~weak$$choice2~0=~weak$$choice2~0_In2014905952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2014905952} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2014905952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2014905952, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out2014905952|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2014905952, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out2014905952|, ~weak$$choice2~0=~weak$$choice2~0_In2014905952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2014905952} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 22:35:18,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1881451058 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In1881451058| |P0Thread1of1ForFork2_#t~ite17_Out1881451058|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out1881451058| ~x$w_buff1_used~0_In1881451058)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1881451058 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1881451058 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1881451058 256)) (and (= 0 (mod ~x$w_buff1_used~0_In1881451058 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite18_Out1881451058| |P0Thread1of1ForFork2_#t~ite17_Out1881451058|) (= ~x$w_buff1_used~0_In1881451058 |P0Thread1of1ForFork2_#t~ite17_Out1881451058|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1881451058, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1881451058|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1881451058, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1881451058, ~weak$$choice2~0=~weak$$choice2~0_In1881451058, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1881451058} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1881451058, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1881451058|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1881451058|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1881451058, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1881451058, ~weak$$choice2~0=~weak$$choice2~0_In1881451058, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1881451058} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:35:18,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_58 v_~x$r_buff0_thd1~0_57) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:35:18,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L745-->L745-8: Formula: (let ((.cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out-392680156| |P0Thread1of1ForFork2_#t~ite24_Out-392680156|)) (.cse4 (= 0 (mod ~x$w_buff0_used~0_In-392680156 256))) (.cse1 (= 0 (mod ~weak$$choice2~0_In-392680156 256))) (.cse5 (= 0 (mod ~x$w_buff1_used~0_In-392680156 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-392680156 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-392680156 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite22_In-392680156| |P0Thread1of1ForFork2_#t~ite22_Out-392680156|) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out-392680156| ~x$r_buff1_thd1~0_In-392680156) .cse1 (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_Out-392680156| |P0Thread1of1ForFork2_#t~ite23_In-392680156|) (= |P0Thread1of1ForFork2_#t~ite24_Out-392680156| ~x$r_buff1_thd1~0_In-392680156)))) (let ((.cse6 (not .cse2))) (and .cse0 (not .cse4) .cse1 (or (not .cse5) .cse6) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out-392680156|) (= |P0Thread1of1ForFork2_#t~ite23_Out-392680156| |P0Thread1of1ForFork2_#t~ite22_Out-392680156|) (or (not .cse3) .cse6))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-392680156, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-392680156, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-392680156, ~weak$$choice2~0=~weak$$choice2~0_In-392680156, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-392680156|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In-392680156|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392680156} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-392680156, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-392680156, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-392680156, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-392680156|, ~weak$$choice2~0=~weak$$choice2~0_In-392680156, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-392680156|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out-392680156|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392680156} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 22:35:18,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1960910396 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1960910396 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1960910396 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1960910396 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1960910396|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1960910396 |P2Thread1of1ForFork1_#t~ite35_Out-1960910396|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1960910396, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1960910396, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1960910396, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1960910396} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1960910396|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1960910396, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1960910396, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1960910396, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1960910396} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:35:18,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1787585157 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1787585157 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1787585157|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-1787585157 |P2Thread1of1ForFork1_#t~ite36_Out-1787585157|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1787585157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1787585157} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1787585157|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1787585157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1787585157} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:35:18,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1636595022 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1636595022 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1636595022 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1636595022 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out1636595022| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1636595022| ~x$r_buff1_thd3~0_In1636595022) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1636595022, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1636595022, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1636595022, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636595022} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1636595022|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1636595022, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1636595022, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1636595022, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636595022} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:35:18,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:35:18,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1071029502 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1071029502 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out1071029502 ~x$r_buff0_thd2~0_In1071029502) (or .cse0 .cse1)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out1071029502 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1071029502, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071029502} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1071029502|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1071029502, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071029502} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:35:18,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-261787939 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-261787939 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-261787939 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-261787939 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-261787939| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-261787939| ~x$r_buff1_thd2~0_In-261787939) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-261787939, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-261787939, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-261787939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-261787939} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-261787939|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-261787939, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-261787939, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-261787939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-261787939} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:35:18,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:35:18,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_16) (not (= 0 (mod v_~x$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:35:18,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= 0 (mod v_~x$w_buff0_used~0_86 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:35:18,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In351508443 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In351508443 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In351508443 |ULTIMATE.start_main_#t~ite41_Out351508443|)) (and (= |ULTIMATE.start_main_#t~ite41_Out351508443| ~x$w_buff1~0_In351508443) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In351508443, ~x$w_buff1_used~0=~x$w_buff1_used~0_In351508443, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In351508443, ~x~0=~x~0_In351508443} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out351508443|, ~x$w_buff1~0=~x$w_buff1~0_In351508443, ~x$w_buff1_used~0=~x$w_buff1_used~0_In351508443, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In351508443, ~x~0=~x~0_In351508443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 22:35:18,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 22:35:18,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In684439074 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In684439074 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out684439074| ~x$w_buff0_used~0_In684439074)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out684439074|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In684439074, ~x$w_buff0_used~0=~x$w_buff0_used~0_In684439074} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In684439074, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out684439074|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In684439074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:35:18,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1318588868 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1318588868 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1318588868 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1318588868 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1318588868 |ULTIMATE.start_main_#t~ite44_Out1318588868|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1318588868| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1318588868, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1318588868, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1318588868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1318588868} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1318588868, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1318588868, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1318588868, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1318588868|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1318588868} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:35:18,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-223970320 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-223970320 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-223970320| ~x$r_buff0_thd0~0_In-223970320) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-223970320|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-223970320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-223970320} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-223970320, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-223970320|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-223970320} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:35:18,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In20773663 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In20773663 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In20773663 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In20773663 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In20773663 |ULTIMATE.start_main_#t~ite46_Out20773663|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite46_Out20773663|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In20773663, ~x$w_buff1_used~0=~x$w_buff1_used~0_In20773663, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In20773663, ~x$w_buff0_used~0=~x$w_buff0_used~0_In20773663} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In20773663, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out20773663|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In20773663, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In20773663, ~x$w_buff0_used~0=~x$w_buff0_used~0_In20773663} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:35:18,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_11 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_10|) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p0_EAX~0_7 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:35:18,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:35:18 BasicIcfg [2019-12-18 22:35:18,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:35:18,170 INFO L168 Benchmark]: Toolchain (without parser) took 146490.70 ms. Allocated memory was 137.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 22:35:18,170 INFO L168 Benchmark]: CDTParser took 1.35 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:35:18,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.67 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 155.3 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:35:18,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.86 ms. Allocated memory is still 201.3 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:35:18,175 INFO L168 Benchmark]: Boogie Preprocessor took 39.24 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:35:18,176 INFO L168 Benchmark]: RCFGBuilder took 819.22 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 103.8 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:35:18,176 INFO L168 Benchmark]: TraceAbstraction took 144852.19 ms. Allocated memory was 201.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 103.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 22:35:18,179 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 707.67 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 155.3 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.86 ms. Allocated memory is still 201.3 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.24 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.22 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 103.8 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144852.19 ms. Allocated memory was 201.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 103.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 28 ChoiceCompositions, 6736 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 67273 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 144.4s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 35.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2924 SDtfs, 4418 SDslu, 7513 SDs, 0 SdLazy, 4087 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 22 SyntacticMatches, 17 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135986occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 91.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 137323 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 588 ConstructedInterpolants, 0 QuantifiedInterpolants, 70995 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...