/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:20:28,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:20:28,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:20:29,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:20:29,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:20:29,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:20:29,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:20:29,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:20:29,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:20:29,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:20:29,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:20:29,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:20:29,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:20:29,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:20:29,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:20:29,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:20:29,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:20:29,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:20:29,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:20:29,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:20:29,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:20:29,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:20:29,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:20:29,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:20:29,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:20:29,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:20:29,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:20:29,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:20:29,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:20:29,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:20:29,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:20:29,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:20:29,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:20:29,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:20:29,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:20:29,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:20:29,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:20:29,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:20:29,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:20:29,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:20:29,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:20:29,069 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-MCR.epf [2019-12-27 22:20:29,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:20:29,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:20:29,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:20:29,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:20:29,085 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:20:29,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:20:29,085 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:20:29,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:20:29,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:20:29,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:20:29,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:20:29,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:20:29,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:20:29,087 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:20:29,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:20:29,087 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:20:29,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:20:29,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:20:29,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:20:29,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:20:29,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:20:29,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:20:29,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:20:29,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:20:29,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:20:29,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:20:29,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:20:29,089 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:20:29,090 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:20:29,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:20:29,090 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:20:29,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:20:29,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:20:29,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:20:29,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:20:29,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:20:29,377 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:20:29,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2019-12-27 22:20:29,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f10b0c6/54f4001f41af4f61a106253d96574c85/FLAGd64c02001 [2019-12-27 22:20:30,056 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:20:30,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2019-12-27 22:20:30,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f10b0c6/54f4001f41af4f61a106253d96574c85/FLAGd64c02001 [2019-12-27 22:20:30,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f10b0c6/54f4001f41af4f61a106253d96574c85 [2019-12-27 22:20:30,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:20:30,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:20:30,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:20:30,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:20:30,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:20:30,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:20:30" (1/1) ... [2019-12-27 22:20:30,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17094c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:30, skipping insertion in model container [2019-12-27 22:20:30,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:20:30" (1/1) ... [2019-12-27 22:20:30,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:20:30,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:20:30,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:20:30,918 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:20:30,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:20:31,079 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:20:31,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31 WrapperNode [2019-12-27 22:20:31,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:20:31,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:20:31,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:20:31,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:20:31,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (1/1) ... [2019-12-27 22:20:31,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (1/1) ... [2019-12-27 22:20:31,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:20:31,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:20:31,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:20:31,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:20:31,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (1/1) ... [2019-12-27 22:20:31,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (1/1) ... [2019-12-27 22:20:31,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (1/1) ... [2019-12-27 22:20:31,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (1/1) ... [2019-12-27 22:20:31,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (1/1) ... [2019-12-27 22:20:31,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (1/1) ... [2019-12-27 22:20:31,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (1/1) ... [2019-12-27 22:20:31,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:20:31,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:20:31,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:20:31,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:20:31,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:20:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:20:31,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:20:31,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:20:31,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:20:31,347 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:20:31,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:20:31,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:20:31,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:20:31,349 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:20:31,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:20:31,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:20:31,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:20:31,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:20:31,352 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:20:32,193 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:20:32,193 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:20:32,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:20:32 BoogieIcfgContainer [2019-12-27 22:20:32,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:20:32,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:20:32,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:20:32,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:20:32,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:20:30" (1/3) ... [2019-12-27 22:20:32,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556f1a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:20:32, skipping insertion in model container [2019-12-27 22:20:32,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:31" (2/3) ... [2019-12-27 22:20:32,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556f1a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:20:32, skipping insertion in model container [2019-12-27 22:20:32,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:20:32" (3/3) ... [2019-12-27 22:20:32,203 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_rmo.oepc.i [2019-12-27 22:20:32,214 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:20:32,214 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:20:32,222 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:20:32,223 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:20:32,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,309 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,313 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,314 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:32,330 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:20:32,349 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:20:32,349 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:20:32,349 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:20:32,349 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:20:32,349 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:20:32,350 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:20:32,350 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:20:32,350 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:20:32,367 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 22:20:32,369 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:20:32,507 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:20:32,507 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:20:32,522 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:20:32,545 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:20:32,608 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:20:32,608 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:20:32,616 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:20:32,636 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 22:20:32,637 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:20:35,917 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:20:36,044 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:20:36,081 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84694 [2019-12-27 22:20:36,081 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 22:20:36,085 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 111 transitions [2019-12-27 22:20:58,683 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129812 states. [2019-12-27 22:20:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 129812 states. [2019-12-27 22:20:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:20:58,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:20:58,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:20:58,693 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:20:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:20:58,699 INFO L82 PathProgramCache]: Analyzing trace with hash 841641, now seen corresponding path program 1 times [2019-12-27 22:20:58,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:20:58,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165970160] [2019-12-27 22:20:58,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:20:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:20:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:20:58,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165970160] [2019-12-27 22:20:58,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:20:58,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:20:58,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1493661235] [2019-12-27 22:20:58,944 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:20:58,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:20:58,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:20:58,963 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:20:58,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:20:58,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:20:58,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:20:58,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:20:58,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:20:58,987 INFO L87 Difference]: Start difference. First operand 129812 states. Second operand 3 states. [2019-12-27 22:21:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:02,642 INFO L93 Difference]: Finished difference Result 129324 states and 557563 transitions. [2019-12-27 22:21:02,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:21:02,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:21:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:03,592 INFO L225 Difference]: With dead ends: 129324 [2019-12-27 22:21:03,592 INFO L226 Difference]: Without dead ends: 126776 [2019-12-27 22:21:03,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126776 states. [2019-12-27 22:21:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126776 to 126776. [2019-12-27 22:21:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126776 states. [2019-12-27 22:21:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126776 states to 126776 states and 547175 transitions. [2019-12-27 22:21:14,555 INFO L78 Accepts]: Start accepts. Automaton has 126776 states and 547175 transitions. Word has length 3 [2019-12-27 22:21:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:14,556 INFO L462 AbstractCegarLoop]: Abstraction has 126776 states and 547175 transitions. [2019-12-27 22:21:14,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:21:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 126776 states and 547175 transitions. [2019-12-27 22:21:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:21:14,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:14,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:14,562 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:14,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1225155789, now seen corresponding path program 1 times [2019-12-27 22:21:14,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:14,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291422765] [2019-12-27 22:21:14,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:14,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291422765] [2019-12-27 22:21:14,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:14,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:14,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [51620786] [2019-12-27 22:21:14,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:14,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:14,704 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:21:14,704 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:14,705 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:14,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:21:14,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:14,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:21:14,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:14,707 INFO L87 Difference]: Start difference. First operand 126776 states and 547175 transitions. Second operand 4 states. [2019-12-27 22:21:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:20,921 INFO L93 Difference]: Finished difference Result 198216 states and 822018 transitions. [2019-12-27 22:21:20,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:20,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:21:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:21,675 INFO L225 Difference]: With dead ends: 198216 [2019-12-27 22:21:21,675 INFO L226 Difference]: Without dead ends: 198167 [2019-12-27 22:21:21,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198167 states. [2019-12-27 22:21:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198167 to 182118. [2019-12-27 22:21:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182118 states. [2019-12-27 22:21:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182118 states to 182118 states and 765134 transitions. [2019-12-27 22:21:35,768 INFO L78 Accepts]: Start accepts. Automaton has 182118 states and 765134 transitions. Word has length 11 [2019-12-27 22:21:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:35,771 INFO L462 AbstractCegarLoop]: Abstraction has 182118 states and 765134 transitions. [2019-12-27 22:21:35,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:21:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 182118 states and 765134 transitions. [2019-12-27 22:21:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:21:35,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:35,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:35,789 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:35,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1435968535, now seen corresponding path program 1 times [2019-12-27 22:21:35,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:35,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583180248] [2019-12-27 22:21:35,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:35,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583180248] [2019-12-27 22:21:35,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:35,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:35,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995374159] [2019-12-27 22:21:35,913 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:35,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:35,917 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:21:35,917 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:35,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:35,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:21:35,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:35,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:21:35,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:35,918 INFO L87 Difference]: Start difference. First operand 182118 states and 765134 transitions. Second operand 4 states. [2019-12-27 22:21:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:43,085 INFO L93 Difference]: Finished difference Result 260296 states and 1067327 transitions. [2019-12-27 22:21:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:43,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:21:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:44,682 INFO L225 Difference]: With dead ends: 260296 [2019-12-27 22:21:44,682 INFO L226 Difference]: Without dead ends: 260233 [2019-12-27 22:21:44,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260233 states. [2019-12-27 22:22:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260233 to 221154. [2019-12-27 22:22:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221154 states. [2019-12-27 22:22:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221154 states to 221154 states and 922215 transitions. [2019-12-27 22:22:04,007 INFO L78 Accepts]: Start accepts. Automaton has 221154 states and 922215 transitions. Word has length 13 [2019-12-27 22:22:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:04,007 INFO L462 AbstractCegarLoop]: Abstraction has 221154 states and 922215 transitions. [2019-12-27 22:22:04,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:22:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 221154 states and 922215 transitions. [2019-12-27 22:22:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:22:04,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:04,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:04,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash 472638345, now seen corresponding path program 1 times [2019-12-27 22:22:04,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:04,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84254745] [2019-12-27 22:22:04,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:04,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84254745] [2019-12-27 22:22:04,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:04,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:04,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557333030] [2019-12-27 22:22:04,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:04,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:04,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:22:04,072 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:04,073 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:04,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:22:04,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:04,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:22:04,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:04,074 INFO L87 Difference]: Start difference. First operand 221154 states and 922215 transitions. Second operand 3 states. [2019-12-27 22:22:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:04,281 INFO L93 Difference]: Finished difference Result 42754 states and 139696 transitions. [2019-12-27 22:22:04,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:22:04,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:22:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:04,351 INFO L225 Difference]: With dead ends: 42754 [2019-12-27 22:22:04,351 INFO L226 Difference]: Without dead ends: 42754 [2019-12-27 22:22:04,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states. [2019-12-27 22:22:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 42754. [2019-12-27 22:22:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42754 states. [2019-12-27 22:22:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42754 states to 42754 states and 139696 transitions. [2019-12-27 22:22:06,615 INFO L78 Accepts]: Start accepts. Automaton has 42754 states and 139696 transitions. Word has length 13 [2019-12-27 22:22:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:06,616 INFO L462 AbstractCegarLoop]: Abstraction has 42754 states and 139696 transitions. [2019-12-27 22:22:06,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:22:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 42754 states and 139696 transitions. [2019-12-27 22:22:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:22:06,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:06,621 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-27 22:22:06,621 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:06,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:06,622 INFO L82 PathProgramCache]: Analyzing trace with hash -589628414, now seen corresponding path program 1 times [2019-12-27 22:22:06,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:06,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504911494] [2019-12-27 22:22:06,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:06,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504911494] [2019-12-27 22:22:06,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:06,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:22:06,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1020230968] [2019-12-27 22:22:06,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:06,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:06,747 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 37 transitions. [2019-12-27 22:22:06,747 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:06,749 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:06,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:06,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:06,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:06,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:06,750 INFO L87 Difference]: Start difference. First operand 42754 states and 139696 transitions. Second operand 5 states. [2019-12-27 22:22:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:07,599 INFO L93 Difference]: Finished difference Result 57358 states and 183378 transitions. [2019-12-27 22:22:07,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:22:07,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:22:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:07,690 INFO L225 Difference]: With dead ends: 57358 [2019-12-27 22:22:07,690 INFO L226 Difference]: Without dead ends: 57345 [2019-12-27 22:22:07,690 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-27 22:22:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57345 states. [2019-12-27 22:22:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57345 to 43244. [2019-12-27 22:22:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43244 states. [2019-12-27 22:22:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43244 states to 43244 states and 140907 transitions. [2019-12-27 22:22:11,966 INFO L78 Accepts]: Start accepts. Automaton has 43244 states and 140907 transitions. Word has length 19 [2019-12-27 22:22:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:11,966 INFO L462 AbstractCegarLoop]: Abstraction has 43244 states and 140907 transitions. [2019-12-27 22:22:11,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 43244 states and 140907 transitions. [2019-12-27 22:22:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:22:11,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:11,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:11,981 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:11,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1356407650, now seen corresponding path program 1 times [2019-12-27 22:22:11,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:11,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584538627] [2019-12-27 22:22:11,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:12,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584538627] [2019-12-27 22:22:12,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:12,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:22:12,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2011373091] [2019-12-27 22:22:12,053 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:12,057 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:12,063 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:22:12,063 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:12,063 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:12,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:22:12,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:12,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:22:12,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:22:12,064 INFO L87 Difference]: Start difference. First operand 43244 states and 140907 transitions. Second operand 4 states. [2019-12-27 22:22:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:12,109 INFO L93 Difference]: Finished difference Result 8037 states and 21818 transitions. [2019-12-27 22:22:12,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:22:12,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:22:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:12,119 INFO L225 Difference]: With dead ends: 8037 [2019-12-27 22:22:12,119 INFO L226 Difference]: Without dead ends: 8037 [2019-12-27 22:22:12,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:22:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2019-12-27 22:22:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 7897. [2019-12-27 22:22:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-27 22:22:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 21446 transitions. [2019-12-27 22:22:12,224 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 21446 transitions. Word has length 25 [2019-12-27 22:22:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:12,224 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 21446 transitions. [2019-12-27 22:22:12,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:22:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 21446 transitions. [2019-12-27 22:22:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:22:12,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:12,232 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] [2019-12-27 22:22:12,233 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:12,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:12,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1453764539, now seen corresponding path program 1 times [2019-12-27 22:22:12,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:12,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773419372] [2019-12-27 22:22:12,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:12,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773419372] [2019-12-27 22:22:12,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:12,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:22:12,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903857939] [2019-12-27 22:22:12,324 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:12,331 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:12,356 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 92 transitions. [2019-12-27 22:22:12,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:12,359 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:22:12,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:12,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:12,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:12,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:12,360 INFO L87 Difference]: Start difference. First operand 7897 states and 21446 transitions. Second operand 5 states. [2019-12-27 22:22:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:12,397 INFO L93 Difference]: Finished difference Result 5718 states and 16246 transitions. [2019-12-27 22:22:12,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:22:12,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:22:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:12,406 INFO L225 Difference]: With dead ends: 5718 [2019-12-27 22:22:12,406 INFO L226 Difference]: Without dead ends: 5314 [2019-12-27 22:22:12,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2019-12-27 22:22:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4950. [2019-12-27 22:22:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 22:22:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14287 transitions. [2019-12-27 22:22:12,477 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14287 transitions. Word has length 37 [2019-12-27 22:22:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:12,477 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14287 transitions. [2019-12-27 22:22:12,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14287 transitions. [2019-12-27 22:22:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:12,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:12,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:12,485 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1228802019, now seen corresponding path program 1 times [2019-12-27 22:22:12,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:12,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798386595] [2019-12-27 22:22:12,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:12,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798386595] [2019-12-27 22:22:12,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:12,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:22:12,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431776876] [2019-12-27 22:22:12,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:12,587 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:12,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 22:22:12,716 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:12,717 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:12,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:22:12,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:12,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:22:12,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:12,718 INFO L87 Difference]: Start difference. First operand 4950 states and 14287 transitions. Second operand 3 states. [2019-12-27 22:22:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:12,782 INFO L93 Difference]: Finished difference Result 4959 states and 14296 transitions. [2019-12-27 22:22:12,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:22:12,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:22:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:12,791 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 22:22:12,791 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 22:22:12,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 22:22:12,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 22:22:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 22:22:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14292 transitions. [2019-12-27 22:22:12,859 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14292 transitions. Word has length 65 [2019-12-27 22:22:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:12,859 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14292 transitions. [2019-12-27 22:22:12,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:22:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14292 transitions. [2019-12-27 22:22:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:12,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:12,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:12,867 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:12,867 INFO L82 PathProgramCache]: Analyzing trace with hash 320653868, now seen corresponding path program 1 times [2019-12-27 22:22:12,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:12,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930978704] [2019-12-27 22:22:12,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:13,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930978704] [2019-12-27 22:22:13,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:13,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:22:13,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099599272] [2019-12-27 22:22:13,002 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:13,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:13,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 22:22:13,151 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:13,334 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:22:13,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:22:13,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:13,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:22:13,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:22:13,335 INFO L87 Difference]: Start difference. First operand 4955 states and 14292 transitions. Second operand 10 states. [2019-12-27 22:22:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:14,038 INFO L93 Difference]: Finished difference Result 7546 states and 21557 transitions. [2019-12-27 22:22:14,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:22:14,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 22:22:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:14,050 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 22:22:14,050 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 22:22:14,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:22:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 22:22:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 22:22:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 22:22:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18327 transitions. [2019-12-27 22:22:14,151 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18327 transitions. Word has length 65 [2019-12-27 22:22:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:14,152 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18327 transitions. [2019-12-27 22:22:14,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:22:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18327 transitions. [2019-12-27 22:22:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:14,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:14,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:14,162 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:14,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2108512596, now seen corresponding path program 2 times [2019-12-27 22:22:14,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:14,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827156932] [2019-12-27 22:22:14,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:14,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827156932] [2019-12-27 22:22:14,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:14,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:22:14,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374698357] [2019-12-27 22:22:14,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:14,290 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:14,419 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 357 transitions. [2019-12-27 22:22:14,419 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:14,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:22:14,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:14,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:14,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:14,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:14,437 INFO L87 Difference]: Start difference. First operand 6352 states and 18327 transitions. Second operand 5 states. [2019-12-27 22:22:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:14,821 INFO L93 Difference]: Finished difference Result 9350 states and 26643 transitions. [2019-12-27 22:22:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:22:14,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 22:22:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:14,833 INFO L225 Difference]: With dead ends: 9350 [2019-12-27 22:22:14,833 INFO L226 Difference]: Without dead ends: 9350 [2019-12-27 22:22:14,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:22:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9350 states. [2019-12-27 22:22:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9350 to 7014. [2019-12-27 22:22:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-27 22:22:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20305 transitions. [2019-12-27 22:22:14,948 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20305 transitions. Word has length 65 [2019-12-27 22:22:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:14,948 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20305 transitions. [2019-12-27 22:22:14,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20305 transitions. [2019-12-27 22:22:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:14,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:14,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:14,958 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:14,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:14,958 INFO L82 PathProgramCache]: Analyzing trace with hash 27480750, now seen corresponding path program 3 times [2019-12-27 22:22:14,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:14,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781003186] [2019-12-27 22:22:14,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:15,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781003186] [2019-12-27 22:22:15,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:15,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:22:15,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [720871102] [2019-12-27 22:22:15,052 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:15,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:15,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 310 transitions. [2019-12-27 22:22:15,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:15,362 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:22:15,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:22:15,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:15,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:22:15,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:22:15,364 INFO L87 Difference]: Start difference. First operand 7014 states and 20305 transitions. Second operand 11 states. [2019-12-27 22:22:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:17,719 INFO L93 Difference]: Finished difference Result 17056 states and 48283 transitions. [2019-12-27 22:22:17,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 22:22:17,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 22:22:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:17,740 INFO L225 Difference]: With dead ends: 17056 [2019-12-27 22:22:17,740 INFO L226 Difference]: Without dead ends: 17056 [2019-12-27 22:22:17,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:22:17,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17056 states. [2019-12-27 22:22:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17056 to 7595. [2019-12-27 22:22:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7595 states. [2019-12-27 22:22:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 22075 transitions. [2019-12-27 22:22:17,898 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 22075 transitions. Word has length 65 [2019-12-27 22:22:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:17,898 INFO L462 AbstractCegarLoop]: Abstraction has 7595 states and 22075 transitions. [2019-12-27 22:22:17,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:22:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 22075 transitions. [2019-12-27 22:22:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:17,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:17,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:17,909 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:17,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1465472054, now seen corresponding path program 4 times [2019-12-27 22:22:17,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:17,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499730394] [2019-12-27 22:22:17,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:18,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499730394] [2019-12-27 22:22:18,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:18,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:18,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [886950606] [2019-12-27 22:22:18,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:18,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:18,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 211 states and 385 transitions. [2019-12-27 22:22:18,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:18,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:18,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:22:18,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:22:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:18,209 INFO L87 Difference]: Start difference. First operand 7595 states and 22075 transitions. Second operand 3 states. [2019-12-27 22:22:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:18,275 INFO L93 Difference]: Finished difference Result 7594 states and 22073 transitions. [2019-12-27 22:22:18,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:22:18,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:22:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:18,286 INFO L225 Difference]: With dead ends: 7594 [2019-12-27 22:22:18,286 INFO L226 Difference]: Without dead ends: 7594 [2019-12-27 22:22:18,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2019-12-27 22:22:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 4867. [2019-12-27 22:22:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4867 states. [2019-12-27 22:22:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 14413 transitions. [2019-12-27 22:22:18,374 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 14413 transitions. Word has length 65 [2019-12-27 22:22:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:18,375 INFO L462 AbstractCegarLoop]: Abstraction has 4867 states and 14413 transitions. [2019-12-27 22:22:18,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:22:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 14413 transitions. [2019-12-27 22:22:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:22:18,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:18,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:18,382 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:18,383 INFO L82 PathProgramCache]: Analyzing trace with hash -337801162, now seen corresponding path program 1 times [2019-12-27 22:22:18,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:18,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27597595] [2019-12-27 22:22:18,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:18,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27597595] [2019-12-27 22:22:18,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:18,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:18,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1871527838] [2019-12-27 22:22:18,468 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:18,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:18,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 358 transitions. [2019-12-27 22:22:18,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:18,666 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:22:18,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:18,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:18,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:18,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:18,667 INFO L87 Difference]: Start difference. First operand 4867 states and 14413 transitions. Second operand 5 states. [2019-12-27 22:22:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:18,863 INFO L93 Difference]: Finished difference Result 5900 states and 16829 transitions. [2019-12-27 22:22:18,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:22:18,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 22:22:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:18,871 INFO L225 Difference]: With dead ends: 5900 [2019-12-27 22:22:18,871 INFO L226 Difference]: Without dead ends: 5900 [2019-12-27 22:22:18,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:22:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5900 states. [2019-12-27 22:22:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5900 to 3739. [2019-12-27 22:22:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-12-27 22:22:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 10867 transitions. [2019-12-27 22:22:18,934 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 10867 transitions. Word has length 66 [2019-12-27 22:22:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:18,935 INFO L462 AbstractCegarLoop]: Abstraction has 3739 states and 10867 transitions. [2019-12-27 22:22:18,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 10867 transitions. [2019-12-27 22:22:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:22:18,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:18,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:18,940 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:18,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:18,940 INFO L82 PathProgramCache]: Analyzing trace with hash -347351168, now seen corresponding path program 1 times [2019-12-27 22:22:18,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:18,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610844126] [2019-12-27 22:22:18,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:19,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610844126] [2019-12-27 22:22:19,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:19,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:22:19,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [453748261] [2019-12-27 22:22:19,031 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:19,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:19,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 400 transitions. [2019-12-27 22:22:19,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:19,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:22:19,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:22:19,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:19,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:22:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:22:19,498 INFO L87 Difference]: Start difference. First operand 3739 states and 10867 transitions. Second operand 11 states. [2019-12-27 22:22:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:20,428 INFO L93 Difference]: Finished difference Result 6465 states and 18382 transitions. [2019-12-27 22:22:20,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:22:20,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 22:22:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:20,438 INFO L225 Difference]: With dead ends: 6465 [2019-12-27 22:22:20,438 INFO L226 Difference]: Without dead ends: 6465 [2019-12-27 22:22:20,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:22:20,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2019-12-27 22:22:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 3739. [2019-12-27 22:22:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-12-27 22:22:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 10867 transitions. [2019-12-27 22:22:20,504 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 10867 transitions. Word has length 67 [2019-12-27 22:22:20,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:20,505 INFO L462 AbstractCegarLoop]: Abstraction has 3739 states and 10867 transitions. [2019-12-27 22:22:20,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:22:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 10867 transitions. [2019-12-27 22:22:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:22:20,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:20,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:20,510 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:20,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1909324032, now seen corresponding path program 2 times [2019-12-27 22:22:20,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:20,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21877812] [2019-12-27 22:22:20,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:20,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21877812] [2019-12-27 22:22:20,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:20,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:22:20,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1252520604] [2019-12-27 22:22:20,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:20,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:20,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 400 transitions. [2019-12-27 22:22:20,837 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:20,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:22:20,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:22:20,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:22:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:22:20,893 INFO L87 Difference]: Start difference. First operand 3739 states and 10867 transitions. Second operand 10 states. [2019-12-27 22:22:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:21,691 INFO L93 Difference]: Finished difference Result 10810 states and 31353 transitions. [2019-12-27 22:22:21,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:22:21,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 22:22:21,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:21,704 INFO L225 Difference]: With dead ends: 10810 [2019-12-27 22:22:21,704 INFO L226 Difference]: Without dead ends: 7817 [2019-12-27 22:22:21,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:22:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7817 states. [2019-12-27 22:22:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7817 to 3405. [2019-12-27 22:22:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2019-12-27 22:22:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 9885 transitions. [2019-12-27 22:22:21,781 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 9885 transitions. Word has length 67 [2019-12-27 22:22:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:21,782 INFO L462 AbstractCegarLoop]: Abstraction has 3405 states and 9885 transitions. [2019-12-27 22:22:21,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:22:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 9885 transitions. [2019-12-27 22:22:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:22:21,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:21,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:21,788 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1990304176, now seen corresponding path program 3 times [2019-12-27 22:22:21,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:21,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826010133] [2019-12-27 22:22:21,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:22,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826010133] [2019-12-27 22:22:22,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:22,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:22:22,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [376797713] [2019-12-27 22:22:22,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:22,162 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:22,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 475 transitions. [2019-12-27 22:22:22,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:22,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 22:22:22,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 22:22:22,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:22,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 22:22:22,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:22:22,696 INFO L87 Difference]: Start difference. First operand 3405 states and 9885 transitions. Second operand 16 states. [2019-12-27 22:22:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:26,327 INFO L93 Difference]: Finished difference Result 12407 states and 34942 transitions. [2019-12-27 22:22:26,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 22:22:26,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 22:22:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:26,348 INFO L225 Difference]: With dead ends: 12407 [2019-12-27 22:22:26,348 INFO L226 Difference]: Without dead ends: 12375 [2019-12-27 22:22:26,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=462, Invalid=2400, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 22:22:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12375 states. [2019-12-27 22:22:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12375 to 4606. [2019-12-27 22:22:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4606 states. [2019-12-27 22:22:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 13240 transitions. [2019-12-27 22:22:26,466 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 13240 transitions. Word has length 67 [2019-12-27 22:22:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:26,466 INFO L462 AbstractCegarLoop]: Abstraction has 4606 states and 13240 transitions. [2019-12-27 22:22:26,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 22:22:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 13240 transitions. [2019-12-27 22:22:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:22:26,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:26,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:26,472 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1039202198, now seen corresponding path program 4 times [2019-12-27 22:22:26,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:26,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261842264] [2019-12-27 22:22:26,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:26,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261842264] [2019-12-27 22:22:26,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:26,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:26,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [413648759] [2019-12-27 22:22:26,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:26,549 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:26,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 433 transitions. [2019-12-27 22:22:26,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:26,886 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:22:26,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:22:26,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:26,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:22:26,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:22:26,887 INFO L87 Difference]: Start difference. First operand 4606 states and 13240 transitions. Second operand 8 states. [2019-12-27 22:22:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:27,179 INFO L93 Difference]: Finished difference Result 5774 states and 15955 transitions. [2019-12-27 22:22:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:22:27,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-27 22:22:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:27,188 INFO L225 Difference]: With dead ends: 5774 [2019-12-27 22:22:27,188 INFO L226 Difference]: Without dead ends: 5774 [2019-12-27 22:22:27,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:22:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2019-12-27 22:22:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 3952. [2019-12-27 22:22:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2019-12-27 22:22:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 11078 transitions. [2019-12-27 22:22:27,252 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 11078 transitions. Word has length 67 [2019-12-27 22:22:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:27,252 INFO L462 AbstractCegarLoop]: Abstraction has 3952 states and 11078 transitions. [2019-12-27 22:22:27,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:22:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 11078 transitions. [2019-12-27 22:22:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:27,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:27,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:27,257 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:27,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1307128750, now seen corresponding path program 1 times [2019-12-27 22:22:27,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:27,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745586886] [2019-12-27 22:22:27,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:27,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745586886] [2019-12-27 22:22:27,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:27,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:22:27,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1494927437] [2019-12-27 22:22:27,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:27,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:27,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 538 transitions. [2019-12-27 22:22:27,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:28,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:28,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 22:22:28,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:22:28,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:28,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:22:28,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:22:28,167 INFO L87 Difference]: Start difference. First operand 3952 states and 11078 transitions. Second operand 17 states. [2019-12-27 22:22:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:28,857 INFO L93 Difference]: Finished difference Result 7439 states and 20824 transitions. [2019-12-27 22:22:28,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:22:28,857 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-27 22:22:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:28,867 INFO L225 Difference]: With dead ends: 7439 [2019-12-27 22:22:28,868 INFO L226 Difference]: Without dead ends: 7407 [2019-12-27 22:22:28,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2019-12-27 22:22:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7407 states. [2019-12-27 22:22:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7407 to 3948. [2019-12-27 22:22:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-27 22:22:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 11039 transitions. [2019-12-27 22:22:28,942 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 11039 transitions. Word has length 68 [2019-12-27 22:22:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:28,942 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 11039 transitions. [2019-12-27 22:22:28,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:22:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 11039 transitions. [2019-12-27 22:22:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:28,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:28,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:28,946 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:28,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:28,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1086450056, now seen corresponding path program 2 times [2019-12-27 22:22:28,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:28,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736246008] [2019-12-27 22:22:28,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:29,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736246008] [2019-12-27 22:22:29,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:29,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:22:29,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [753311227] [2019-12-27 22:22:29,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:29,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:29,554 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 522 transitions. [2019-12-27 22:22:29,554 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:29,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:30,043 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 22:22:30,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 22:22:30,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 22:22:30,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:22:30,045 INFO L87 Difference]: Start difference. First operand 3948 states and 11039 transitions. Second operand 20 states. [2019-12-27 22:22:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:31,125 INFO L93 Difference]: Finished difference Result 7082 states and 19912 transitions. [2019-12-27 22:22:31,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:22:31,126 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 22:22:31,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:31,136 INFO L225 Difference]: With dead ends: 7082 [2019-12-27 22:22:31,136 INFO L226 Difference]: Without dead ends: 7050 [2019-12-27 22:22:31,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 22:22:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-27 22:22:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 4160. [2019-12-27 22:22:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-12-27 22:22:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 11656 transitions. [2019-12-27 22:22:31,206 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 11656 transitions. Word has length 68 [2019-12-27 22:22:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:31,206 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 11656 transitions. [2019-12-27 22:22:31,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 22:22:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 11656 transitions. [2019-12-27 22:22:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:31,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:31,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:31,210 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:31,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1871389806, now seen corresponding path program 3 times [2019-12-27 22:22:31,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:31,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922291598] [2019-12-27 22:22:31,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:31,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922291598] [2019-12-27 22:22:31,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:31,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:22:31,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [556636694] [2019-12-27 22:22:31,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:31,545 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:31,928 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 22:22:31,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:32,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:32,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:32,394 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 22:22:32,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 22:22:32,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:32,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 22:22:32,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:22:32,395 INFO L87 Difference]: Start difference. First operand 4160 states and 11656 transitions. Second operand 19 states. [2019-12-27 22:22:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:33,807 INFO L93 Difference]: Finished difference Result 8920 states and 25194 transitions. [2019-12-27 22:22:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 22:22:33,808 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 22:22:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:33,820 INFO L225 Difference]: With dead ends: 8920 [2019-12-27 22:22:33,820 INFO L226 Difference]: Without dead ends: 8888 [2019-12-27 22:22:33,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 18 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=283, Invalid=1049, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 22:22:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8888 states. [2019-12-27 22:22:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8888 to 4424. [2019-12-27 22:22:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4424 states. [2019-12-27 22:22:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 12424 transitions. [2019-12-27 22:22:33,901 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 12424 transitions. Word has length 68 [2019-12-27 22:22:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:33,901 INFO L462 AbstractCegarLoop]: Abstraction has 4424 states and 12424 transitions. [2019-12-27 22:22:33,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 22:22:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 12424 transitions. [2019-12-27 22:22:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:33,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:33,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:33,905 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:33,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:33,906 INFO L82 PathProgramCache]: Analyzing trace with hash 158566424, now seen corresponding path program 4 times [2019-12-27 22:22:33,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:33,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708069161] [2019-12-27 22:22:33,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:22:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:22:34,021 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:22:34,021 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:22:34,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1973~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1973~0.base_22|) |v_ULTIMATE.start_main_~#t1973~0.offset_16| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd3~0_20 0) (= |v_#NULL.offset_3| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1973~0.base_22|)) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1973~0.base_22| 4) |v_#length_23|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_15) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$r_buff1_thd2~0_16) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1973~0.base_22|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~weak$$choice0~0_7) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1973~0.base_22| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= 0 v_~y~0_8) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (= 0 |v_ULTIMATE.start_main_~#t1973~0.offset_16|) (= 0 v_~z$w_buff1_used~0_69) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$r_buff1_thd0~0_46) (= v_~z~0_29 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ULTIMATE.start_main_~#t1974~0.offset=|v_ULTIMATE.start_main_~#t1974~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_~#t1975~0.offset=|v_ULTIMATE.start_main_~#t1975~0.offset_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t1975~0.base=|v_ULTIMATE.start_main_~#t1975~0.base_19|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ULTIMATE.start_main_~#t1973~0.offset=|v_ULTIMATE.start_main_~#t1973~0.offset_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1974~0.base=|v_ULTIMATE.start_main_~#t1974~0.base_20|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_~#t1973~0.base=|v_ULTIMATE.start_main_~#t1973~0.base_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1974~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1975~0.offset, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1975~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1973~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1974~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1973~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:22:34,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L807-1-->L809: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1974~0.base_11| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1974~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1974~0.base_11|) |v_ULTIMATE.start_main_~#t1974~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1974~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1974~0.base_11|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1974~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1974~0.base_11| 0)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1974~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1974~0.offset=|v_ULTIMATE.start_main_~#t1974~0.offset_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1974~0.base=|v_ULTIMATE.start_main_~#t1974~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1974~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1974~0.base] because there is no mapped edge [2019-12-27 22:22:34,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_17 v_~z$w_buff1~0_16) (= (mod v_~z$w_buff1_used~0_56 256) 0) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_89 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_90 v_~z$w_buff1_used~0_56)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 22:22:34,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1975~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1975~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1975~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1975~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1975~0.base_12|) |v_ULTIMATE.start_main_~#t1975~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1975~0.base_12| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1975~0.base_12| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1975~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1975~0.base=|v_ULTIMATE.start_main_~#t1975~0.base_12|, ULTIMATE.start_main_~#t1975~0.offset=|v_ULTIMATE.start_main_~#t1975~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1975~0.base, ULTIMATE.start_main_~#t1975~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 22:22:34,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-436117991 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-436117991 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-436117991| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-436117991| ~z$w_buff0_used~0_In-436117991)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-436117991, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-436117991} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-436117991|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-436117991, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-436117991} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:22:34,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In383084508 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In383084508 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In383084508 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In383084508 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out383084508| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out383084508| ~z$w_buff1_used~0_In383084508) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In383084508, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In383084508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In383084508, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In383084508} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out383084508|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In383084508, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In383084508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In383084508, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In383084508} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:22:34,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-729412619 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-729412619 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In-729412619 ~z$r_buff0_thd1~0_Out-729412619) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-729412619) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-729412619, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-729412619} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-729412619, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-729412619|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-729412619} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:22:34,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In185252974 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In185252974 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In185252974 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In185252974 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out185252974| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out185252974| ~z$r_buff1_thd1~0_In185252974) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In185252974, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In185252974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In185252974, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In185252974} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In185252974, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out185252974|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In185252974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In185252974, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In185252974} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:22:34,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L748-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:22:34,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1072726337 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1072726337 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out1072726337| ~z$w_buff1~0_In1072726337) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out1072726337| ~z~0_In1072726337) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1072726337, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1072726337, ~z$w_buff1~0=~z$w_buff1~0_In1072726337, ~z~0=~z~0_In1072726337} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1072726337|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1072726337, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1072726337, ~z$w_buff1~0=~z$w_buff1~0_In1072726337, ~z~0=~z~0_In1072726337} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:22:34,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 22:22:34,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1850809648 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1850809648 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1850809648|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1850809648| ~z$w_buff0_used~0_In-1850809648)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850809648, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1850809648} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850809648, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1850809648|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1850809648} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:22:34,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1924336860 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1924336860 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1924336860 |P2Thread1of1ForFork2_#t~ite15_Out1924336860|)) (and (= ~z$w_buff1~0_In1924336860 |P2Thread1of1ForFork2_#t~ite15_Out1924336860|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1924336860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1924336860, ~z$w_buff1~0=~z$w_buff1~0_In1924336860, ~z~0=~z~0_In1924336860} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1924336860|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1924336860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1924336860, ~z$w_buff1~0=~z$w_buff1~0_In1924336860, ~z~0=~z~0_In1924336860} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:22:34,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In337790613 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In337790613 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In337790613 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In337790613 256)))) (or (and (= ~z$w_buff1_used~0_In337790613 |P1Thread1of1ForFork1_#t~ite12_Out337790613|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out337790613|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In337790613, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In337790613, ~z$w_buff1_used~0=~z$w_buff1_used~0_In337790613, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In337790613} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In337790613, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In337790613, ~z$w_buff1_used~0=~z$w_buff1_used~0_In337790613, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out337790613|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In337790613} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:22:34,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1271366785 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1271366785 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1271366785|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-1271366785 |P1Thread1of1ForFork1_#t~ite13_Out-1271366785|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1271366785, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1271366785} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1271366785, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1271366785|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1271366785} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:22:34,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:22:34,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1304621756 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1304621756 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out1304621756| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1304621756| ~z$w_buff0_used~0_In1304621756)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1304621756, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1304621756} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1304621756, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1304621756, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1304621756|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:22:34,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1459891929 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1459891929 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1459891929 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1459891929 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1459891929 |P2Thread1of1ForFork2_#t~ite18_Out-1459891929|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1459891929|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1459891929, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1459891929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1459891929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1459891929} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1459891929, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1459891929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1459891929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1459891929, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1459891929|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:22:34,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1627343776 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1627343776 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-1627343776 |P2Thread1of1ForFork2_#t~ite19_Out-1627343776|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-1627343776| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1627343776, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1627343776} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1627343776, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1627343776, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1627343776|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:22:34,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1832957228 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1832957228 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1832957228 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1832957228 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1832957228| ~z$r_buff1_thd3~0_In-1832957228) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1832957228| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1832957228, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1832957228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1832957228, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1832957228} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1832957228, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1832957228|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1832957228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1832957228, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1832957228} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:22:34,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:22:34,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1266055678 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1266055678 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1266055678 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1266055678 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1266055678 |P1Thread1of1ForFork1_#t~ite14_Out-1266055678|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1266055678| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1266055678, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1266055678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1266055678, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1266055678} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1266055678, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1266055678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1266055678, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1266055678|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1266055678} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:22:34,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_10 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:22:34,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:22:34,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-206261261 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-206261261 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-206261261| ~z$w_buff1~0_In-206261261)) (and (= |ULTIMATE.start_main_#t~ite24_Out-206261261| ~z~0_In-206261261) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-206261261, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-206261261, ~z$w_buff1~0=~z$w_buff1~0_In-206261261, ~z~0=~z~0_In-206261261} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-206261261, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-206261261|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-206261261, ~z$w_buff1~0=~z$w_buff1~0_In-206261261, ~z~0=~z~0_In-206261261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 22:22:34,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite24_7|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_6|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_6|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-27 22:22:34,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In356220281 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In356220281 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out356220281| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite26_Out356220281| ~z$w_buff0_used~0_In356220281)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In356220281, ~z$w_buff0_used~0=~z$w_buff0_used~0_In356220281} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In356220281, ~z$w_buff0_used~0=~z$w_buff0_used~0_In356220281, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out356220281|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:22:34,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-139737811 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-139737811 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-139737811 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-139737811 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-139737811|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-139737811 |ULTIMATE.start_main_#t~ite27_Out-139737811|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-139737811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-139737811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-139737811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-139737811} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-139737811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-139737811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-139737811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-139737811, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-139737811|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:22:34,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1587013088 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1587013088 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out1587013088|)) (and (= |ULTIMATE.start_main_#t~ite28_Out1587013088| ~z$r_buff0_thd0~0_In1587013088) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1587013088, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1587013088} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1587013088, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1587013088|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1587013088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:22:34,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-363160722 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-363160722 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-363160722 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-363160722 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-363160722 |ULTIMATE.start_main_#t~ite29_Out-363160722|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-363160722| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-363160722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-363160722, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-363160722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-363160722} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-363160722, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-363160722|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-363160722, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-363160722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-363160722} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:22:34,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:22:34,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L836-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_8 256)) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:22:34,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:22:34,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:22:34 BasicIcfg [2019-12-27 22:22:34,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:22:34,156 INFO L168 Benchmark]: Toolchain (without parser) took 123822.56 ms. Allocated memory was 146.3 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 101.3 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:22:34,156 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 22:22:34,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.36 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 101.1 MB in the beginning and 155.7 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:34,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.75 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 152.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:34,158 INFO L168 Benchmark]: Boogie Preprocessor took 76.28 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 149.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:34,159 INFO L168 Benchmark]: RCFGBuilder took 930.32 ms. Allocated memory is still 202.9 MB. Free memory was 149.9 MB in the beginning and 100.2 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:34,160 INFO L168 Benchmark]: TraceAbstraction took 121958.05 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 22:22:34,163 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.36 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 101.1 MB in the beginning and 155.7 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 106.75 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 152.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.28 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 149.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 930.32 ms. Allocated memory is still 202.9 MB. Free memory was 149.9 MB in the beginning and 100.2 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121958.05 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 175 ProgramPointsBefore, 98 ProgramPointsAfterwards, 212 TransitionsBefore, 111 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 5348 VarBasedMoverChecksPositive, 177 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84694 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 121.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 34.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3259 SDtfs, 5146 SDslu, 12027 SDs, 0 SdLazy, 8759 SolverSat, 389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 431 GetRequests, 98 SyntacticMatches, 88 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221154occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 115158 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 964 ConstructedInterpolants, 0 QuantifiedInterpolants, 292159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...