/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:46:44,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:46:44,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:46:44,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:46:44,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:46:44,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:46:44,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:46:44,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:46:44,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:46:44,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:46:44,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:46:44,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:46:44,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:46:44,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:46:44,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:46:44,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:46:44,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:46:44,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:46:44,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:46:44,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:46:44,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:46:44,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:46:44,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:46:44,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:46:44,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:46:44,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:46:44,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:46:44,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:46:44,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:46:44,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:46:44,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:46:44,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:46:44,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:46:44,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:46:44,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:46:44,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:46:44,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:46:44,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:46:44,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:46:44,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:46:44,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:46:44,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:46:44,187 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:46:44,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:46:44,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:46:44,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:46:44,189 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:46:44,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:46:44,190 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:46:44,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:46:44,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:46:44,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:46:44,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:46:44,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:46:44,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:46:44,191 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:46:44,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:46:44,191 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:46:44,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:46:44,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:46:44,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:46:44,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:46:44,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:46:44,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:46:44,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:46:44,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:46:44,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:46:44,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:46:44,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:46:44,194 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:46:44,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:46:44,194 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:46:44,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:46:44,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:46:44,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:46:44,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:46:44,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:46:44,520 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:46:44,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2019-12-27 18:46:44,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7828f55e5/ea551799392146b885dfd3422e3165dc/FLAG0f9afd915 [2019-12-27 18:46:45,120 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:46:45,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2019-12-27 18:46:45,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7828f55e5/ea551799392146b885dfd3422e3165dc/FLAG0f9afd915 [2019-12-27 18:46:45,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7828f55e5/ea551799392146b885dfd3422e3165dc [2019-12-27 18:46:45,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:46:45,461 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:46:45,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:46:45,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:46:45,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:46:45,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:46:45" (1/1) ... [2019-12-27 18:46:45,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78428862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:45, skipping insertion in model container [2019-12-27 18:46:45,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:46:45" (1/1) ... [2019-12-27 18:46:45,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:46:45,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:46:46,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:46:46,122 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:46:46,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:46:46,290 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:46:46,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46 WrapperNode [2019-12-27 18:46:46,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:46:46,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:46:46,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:46:46,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:46:46,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (1/1) ... [2019-12-27 18:46:46,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (1/1) ... [2019-12-27 18:46:46,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:46:46,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:46:46,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:46:46,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:46:46,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (1/1) ... [2019-12-27 18:46:46,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (1/1) ... [2019-12-27 18:46:46,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (1/1) ... [2019-12-27 18:46:46,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (1/1) ... [2019-12-27 18:46:46,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (1/1) ... [2019-12-27 18:46:46,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (1/1) ... [2019-12-27 18:46:46,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (1/1) ... [2019-12-27 18:46:46,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:46:46,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:46:46,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:46:46,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:46:46,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (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 18:46:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:46:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:46:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:46:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:46:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:46:46,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:46:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:46:46,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:46:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:46:46,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:46:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:46:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:46:46,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:46:46,476 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 18:46:47,241 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:46:47,242 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:46:47,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:46:47 BoogieIcfgContainer [2019-12-27 18:46:47,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:46:47,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:46:47,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:46:47,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:46:47,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:46:45" (1/3) ... [2019-12-27 18:46:47,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355c07a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:46:47, skipping insertion in model container [2019-12-27 18:46:47,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:46" (2/3) ... [2019-12-27 18:46:47,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355c07a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:46:47, skipping insertion in model container [2019-12-27 18:46:47,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:46:47" (3/3) ... [2019-12-27 18:46:47,257 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_pso.oepc.i [2019-12-27 18:46:47,268 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:46:47,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:46:47,281 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:46:47,282 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:46:47,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,354 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,392 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,398 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,402 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,402 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:47,418 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:46:47,441 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:46:47,441 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:46:47,442 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:46:47,442 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:46:47,442 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:46:47,442 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:46:47,442 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:46:47,442 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:46:47,464 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 18:46:47,466 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 18:46:47,590 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 18:46:47,590 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:46:47,609 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:46:47,630 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 18:46:47,711 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 18:46:47,711 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:46:47,719 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:46:47,737 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 18:46:47,738 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:46:52,614 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 18:46:52,746 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 18:46:52,777 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79634 [2019-12-27 18:46:52,777 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 18:46:52,781 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 18:47:10,290 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-27 18:47:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-27 18:47:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:47:10,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:10,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:47:10,298 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 18:47:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash 839588, now seen corresponding path program 1 times [2019-12-27 18:47:10,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:10,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506166114] [2019-12-27 18:47:10,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:10,562 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 18:47:10,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506166114] [2019-12-27 18:47:10,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:10,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:47:10,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911909779] [2019-12-27 18:47:10,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:10,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:10,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:47:10,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:10,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:47:10,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:47:10,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:10,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:47:10,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:47:10,604 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-27 18:47:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:14,248 INFO L93 Difference]: Finished difference Result 115280 states and 496088 transitions. [2019-12-27 18:47:14,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:47:14,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:47:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:15,154 INFO L225 Difference]: With dead ends: 115280 [2019-12-27 18:47:15,155 INFO L226 Difference]: Without dead ends: 112928 [2019-12-27 18:47:15,157 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 18:47:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112928 states. [2019-12-27 18:47:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112928 to 112928. [2019-12-27 18:47:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112928 states. [2019-12-27 18:47:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112928 states to 112928 states and 486484 transitions. [2019-12-27 18:47:26,703 INFO L78 Accepts]: Start accepts. Automaton has 112928 states and 486484 transitions. Word has length 3 [2019-12-27 18:47:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:26,704 INFO L462 AbstractCegarLoop]: Abstraction has 112928 states and 486484 transitions. [2019-12-27 18:47:26,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:47:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 112928 states and 486484 transitions. [2019-12-27 18:47:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:47:26,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:26,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:26,709 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 18:47:26,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:26,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1760802055, now seen corresponding path program 1 times [2019-12-27 18:47:26,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:26,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706778813] [2019-12-27 18:47:26,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:26,865 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 18:47:26,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706778813] [2019-12-27 18:47:26,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:26,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:47:26,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1166274340] [2019-12-27 18:47:26,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:26,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:26,870 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:47:26,870 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:26,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:47:26,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:47:26,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:26,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:47:26,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:47:26,875 INFO L87 Difference]: Start difference. First operand 112928 states and 486484 transitions. Second operand 4 states. [2019-12-27 18:47:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:33,309 INFO L93 Difference]: Finished difference Result 176610 states and 731654 transitions. [2019-12-27 18:47:33,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:47:33,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:47:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:33,955 INFO L225 Difference]: With dead ends: 176610 [2019-12-27 18:47:33,955 INFO L226 Difference]: Without dead ends: 176561 [2019-12-27 18:47:33,957 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 18:47:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176561 states. [2019-12-27 18:47:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176561 to 162745. [2019-12-27 18:47:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162745 states. [2019-12-27 18:47:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162745 states to 162745 states and 681729 transitions. [2019-12-27 18:47:42,833 INFO L78 Accepts]: Start accepts. Automaton has 162745 states and 681729 transitions. Word has length 11 [2019-12-27 18:47:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:42,834 INFO L462 AbstractCegarLoop]: Abstraction has 162745 states and 681729 transitions. [2019-12-27 18:47:42,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:47:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 162745 states and 681729 transitions. [2019-12-27 18:47:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:47:42,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:42,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:42,840 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 18:47:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:42,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1561773324, now seen corresponding path program 1 times [2019-12-27 18:47:42,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:42,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65388935] [2019-12-27 18:47:42,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:42,894 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 18:47:42,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65388935] [2019-12-27 18:47:42,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:42,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:47:42,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1783548920] [2019-12-27 18:47:42,895 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:42,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:42,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:47:42,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:42,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:47:42,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:47:42,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:42,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:47:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:47:42,900 INFO L87 Difference]: Start difference. First operand 162745 states and 681729 transitions. Second operand 3 states. [2019-12-27 18:47:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:43,044 INFO L93 Difference]: Finished difference Result 33244 states and 109167 transitions. [2019-12-27 18:47:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:47:43,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:47:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:43,112 INFO L225 Difference]: With dead ends: 33244 [2019-12-27 18:47:43,112 INFO L226 Difference]: Without dead ends: 33244 [2019-12-27 18:47:43,112 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 18:47:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33244 states. [2019-12-27 18:47:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33244 to 33244. [2019-12-27 18:47:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33244 states. [2019-12-27 18:47:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33244 states to 33244 states and 109167 transitions. [2019-12-27 18:47:48,755 INFO L78 Accepts]: Start accepts. Automaton has 33244 states and 109167 transitions. Word has length 13 [2019-12-27 18:47:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:48,755 INFO L462 AbstractCegarLoop]: Abstraction has 33244 states and 109167 transitions. [2019-12-27 18:47:48,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:47:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 33244 states and 109167 transitions. [2019-12-27 18:47:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:47:48,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:48,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:48,758 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 18:47:48,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:48,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1197008698, now seen corresponding path program 1 times [2019-12-27 18:47:48,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:48,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931166660] [2019-12-27 18:47:48,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:48,860 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 18:47:48,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931166660] [2019-12-27 18:47:48,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:48,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:47:48,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1306283833] [2019-12-27 18:47:48,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:48,862 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:48,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:47:48,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:48,864 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:47:48,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:47:48,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:48,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:47:48,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:47:48,865 INFO L87 Difference]: Start difference. First operand 33244 states and 109167 transitions. Second operand 4 states. [2019-12-27 18:47:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:49,326 INFO L93 Difference]: Finished difference Result 44535 states and 142999 transitions. [2019-12-27 18:47:49,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:47:49,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:47:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:49,397 INFO L225 Difference]: With dead ends: 44535 [2019-12-27 18:47:49,397 INFO L226 Difference]: Without dead ends: 44528 [2019-12-27 18:47:49,397 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 18:47:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44528 states. [2019-12-27 18:47:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44528 to 39179. [2019-12-27 18:47:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39179 states. [2019-12-27 18:47:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39179 states to 39179 states and 127862 transitions. [2019-12-27 18:47:50,102 INFO L78 Accepts]: Start accepts. Automaton has 39179 states and 127862 transitions. Word has length 13 [2019-12-27 18:47:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:50,102 INFO L462 AbstractCegarLoop]: Abstraction has 39179 states and 127862 transitions. [2019-12-27 18:47:50,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:47:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 39179 states and 127862 transitions. [2019-12-27 18:47:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:47:50,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:50,106 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 18:47:50,107 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 18:47:50,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:50,107 INFO L82 PathProgramCache]: Analyzing trace with hash -789449835, now seen corresponding path program 1 times [2019-12-27 18:47:50,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:50,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821063413] [2019-12-27 18:47:50,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:50,220 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 18:47:50,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821063413] [2019-12-27 18:47:50,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:50,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:47:50,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [668138347] [2019-12-27 18:47:50,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:50,224 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:50,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 48 transitions. [2019-12-27 18:47:50,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:50,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:47:50,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:47:50,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:50,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:47:50,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:47:50,303 INFO L87 Difference]: Start difference. First operand 39179 states and 127862 transitions. Second operand 6 states. [2019-12-27 18:47:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:51,527 INFO L93 Difference]: Finished difference Result 52446 states and 167747 transitions. [2019-12-27 18:47:51,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:47:51,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 18:47:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:51,613 INFO L225 Difference]: With dead ends: 52446 [2019-12-27 18:47:51,613 INFO L226 Difference]: Without dead ends: 52433 [2019-12-27 18:47:51,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:47:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52433 states. [2019-12-27 18:47:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52433 to 39607. [2019-12-27 18:47:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39607 states. [2019-12-27 18:47:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39607 states to 39607 states and 129076 transitions. [2019-12-27 18:47:52,339 INFO L78 Accepts]: Start accepts. Automaton has 39607 states and 129076 transitions. Word has length 19 [2019-12-27 18:47:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:52,340 INFO L462 AbstractCegarLoop]: Abstraction has 39607 states and 129076 transitions. [2019-12-27 18:47:52,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:47:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 39607 states and 129076 transitions. [2019-12-27 18:47:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:47:52,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:52,354 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 18:47:52,354 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 18:47:52,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:52,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2013302827, now seen corresponding path program 1 times [2019-12-27 18:47:52,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:52,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124257992] [2019-12-27 18:47:52,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:47:52,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124257992] [2019-12-27 18:47:52,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:52,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:47:52,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [695210099] [2019-12-27 18:47:52,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:52,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:52,460 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:47:52,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:52,476 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:47:52,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:47:52,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:52,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:47:52,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:47:52,477 INFO L87 Difference]: Start difference. First operand 39607 states and 129076 transitions. Second operand 5 states. [2019-12-27 18:47:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:52,524 INFO L93 Difference]: Finished difference Result 7467 states and 20456 transitions. [2019-12-27 18:47:52,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:47:52,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:47:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:52,535 INFO L225 Difference]: With dead ends: 7467 [2019-12-27 18:47:52,535 INFO L226 Difference]: Without dead ends: 7467 [2019-12-27 18:47:52,535 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 18:47:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2019-12-27 18:47:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7355. [2019-12-27 18:47:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7355 states. [2019-12-27 18:47:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 20136 transitions. [2019-12-27 18:47:52,627 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 20136 transitions. Word has length 25 [2019-12-27 18:47:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:52,628 INFO L462 AbstractCegarLoop]: Abstraction has 7355 states and 20136 transitions. [2019-12-27 18:47:52,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:47:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 20136 transitions. [2019-12-27 18:47:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:47:52,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:52,641 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 18:47:52,641 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 18:47:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:52,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1439896358, now seen corresponding path program 1 times [2019-12-27 18:47:52,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:52,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564419589] [2019-12-27 18:47:52,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:52,732 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 18:47:52,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564419589] [2019-12-27 18:47:52,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:52,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:47:52,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548963908] [2019-12-27 18:47:52,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:52,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:52,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 150 transitions. [2019-12-27 18:47:52,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:52,793 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:47:52,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:47:52,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:52,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:47:52,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:47:52,794 INFO L87 Difference]: Start difference. First operand 7355 states and 20136 transitions. Second operand 6 states. [2019-12-27 18:47:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:52,837 INFO L93 Difference]: Finished difference Result 5312 states and 15268 transitions. [2019-12-27 18:47:52,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:47:52,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 18:47:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:52,845 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 18:47:52,845 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 18:47:52,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:47:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 18:47:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 18:47:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 18:47:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14284 transitions. [2019-12-27 18:47:52,918 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14284 transitions. Word has length 37 [2019-12-27 18:47:52,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:52,919 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14284 transitions. [2019-12-27 18:47:52,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:47:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14284 transitions. [2019-12-27 18:47:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:47:52,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:52,926 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 18:47:52,927 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 18:47:52,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:52,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1467892093, now seen corresponding path program 1 times [2019-12-27 18:47:52,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:52,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48255538] [2019-12-27 18:47:52,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:52,997 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 18:47:52,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48255538] [2019-12-27 18:47:52,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:52,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:47:52,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090736412] [2019-12-27 18:47:52,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:53,019 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:53,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 325 transitions. [2019-12-27 18:47:53,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:53,270 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:47:53,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:47:53,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:53,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:47:53,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:47:53,271 INFO L87 Difference]: Start difference. First operand 4948 states and 14284 transitions. Second operand 3 states. [2019-12-27 18:47:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:53,332 INFO L93 Difference]: Finished difference Result 4957 states and 14297 transitions. [2019-12-27 18:47:53,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:47:53,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:47:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:53,341 INFO L225 Difference]: With dead ends: 4957 [2019-12-27 18:47:53,341 INFO L226 Difference]: Without dead ends: 4957 [2019-12-27 18:47:53,341 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 18:47:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4957 states. [2019-12-27 18:47:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4957 to 4953. [2019-12-27 18:47:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4953 states. [2019-12-27 18:47:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4953 states to 4953 states and 14293 transitions. [2019-12-27 18:47:53,410 INFO L78 Accepts]: Start accepts. Automaton has 4953 states and 14293 transitions. Word has length 65 [2019-12-27 18:47:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:53,411 INFO L462 AbstractCegarLoop]: Abstraction has 4953 states and 14293 transitions. [2019-12-27 18:47:53,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:47:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4953 states and 14293 transitions. [2019-12-27 18:47:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:47:53,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:53,419 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 18:47:53,419 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 18:47:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 873301269, now seen corresponding path program 1 times [2019-12-27 18:47:53,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:53,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630933398] [2019-12-27 18:47:53,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:53,510 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 18:47:53,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630933398] [2019-12-27 18:47:53,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:53,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:47:53,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [390222271] [2019-12-27 18:47:53,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:53,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:53,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 325 transitions. [2019-12-27 18:47:53,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:53,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:47:53,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:47:53,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:47:53,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:47:53,694 INFO L87 Difference]: Start difference. First operand 4953 states and 14293 transitions. Second operand 6 states. [2019-12-27 18:47:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:54,060 INFO L93 Difference]: Finished difference Result 7544 states and 21558 transitions. [2019-12-27 18:47:54,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:47:54,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 18:47:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:54,071 INFO L225 Difference]: With dead ends: 7544 [2019-12-27 18:47:54,071 INFO L226 Difference]: Without dead ends: 7544 [2019-12-27 18:47:54,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:47:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2019-12-27 18:47:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 6350. [2019-12-27 18:47:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6350 states. [2019-12-27 18:47:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6350 states to 6350 states and 18328 transitions. [2019-12-27 18:47:54,170 INFO L78 Accepts]: Start accepts. Automaton has 6350 states and 18328 transitions. Word has length 65 [2019-12-27 18:47:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:54,170 INFO L462 AbstractCegarLoop]: Abstraction has 6350 states and 18328 transitions. [2019-12-27 18:47:54,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:47:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6350 states and 18328 transitions. [2019-12-27 18:47:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:47:54,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:54,179 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 18:47:54,179 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 18:47:54,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash -127580537, now seen corresponding path program 2 times [2019-12-27 18:47:54,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:54,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196006835] [2019-12-27 18:47:54,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:54,283 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 18:47:54,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196006835] [2019-12-27 18:47:54,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:54,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:47:54,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1155171068] [2019-12-27 18:47:54,284 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:54,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:54,503 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 540 transitions. [2019-12-27 18:47:54,503 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:54,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 18:47:54,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:47:54,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:47:54,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:47:54,819 INFO L87 Difference]: Start difference. First operand 6350 states and 18328 transitions. Second operand 13 states. [2019-12-27 18:47:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:56,708 INFO L93 Difference]: Finished difference Result 15407 states and 43645 transitions. [2019-12-27 18:47:56,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:47:56,708 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 18:47:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:56,878 INFO L225 Difference]: With dead ends: 15407 [2019-12-27 18:47:56,878 INFO L226 Difference]: Without dead ends: 15407 [2019-12-27 18:47:56,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:47:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15407 states. [2019-12-27 18:47:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15407 to 7033. [2019-12-27 18:47:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7033 states. [2019-12-27 18:47:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7033 states to 7033 states and 20387 transitions. [2019-12-27 18:47:57,026 INFO L78 Accepts]: Start accepts. Automaton has 7033 states and 20387 transitions. Word has length 65 [2019-12-27 18:47:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:57,026 INFO L462 AbstractCegarLoop]: Abstraction has 7033 states and 20387 transitions. [2019-12-27 18:47:57,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:47:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 7033 states and 20387 transitions. [2019-12-27 18:47:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:47:57,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:57,040 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 18:47:57,040 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 18:47:57,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1928895531, now seen corresponding path program 3 times [2019-12-27 18:47:57,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:57,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078593654] [2019-12-27 18:47:57,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:57,152 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 18:47:57,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078593654] [2019-12-27 18:47:57,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:57,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:47:57,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531773293] [2019-12-27 18:47:57,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:57,173 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:57,326 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 287 states and 540 transitions. [2019-12-27 18:47:57,327 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:57,327 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:47:57,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:47:57,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:57,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:47:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:47:57,328 INFO L87 Difference]: Start difference. First operand 7033 states and 20387 transitions. Second operand 3 states. [2019-12-27 18:47:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:57,391 INFO L93 Difference]: Finished difference Result 7033 states and 20386 transitions. [2019-12-27 18:47:57,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:47:57,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:47:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:57,402 INFO L225 Difference]: With dead ends: 7033 [2019-12-27 18:47:57,402 INFO L226 Difference]: Without dead ends: 7033 [2019-12-27 18:47:57,403 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 18:47:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2019-12-27 18:47:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 4682. [2019-12-27 18:47:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4682 states. [2019-12-27 18:47:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4682 states to 4682 states and 13829 transitions. [2019-12-27 18:47:57,480 INFO L78 Accepts]: Start accepts. Automaton has 4682 states and 13829 transitions. Word has length 65 [2019-12-27 18:47:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:57,480 INFO L462 AbstractCegarLoop]: Abstraction has 4682 states and 13829 transitions. [2019-12-27 18:47:57,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:47:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4682 states and 13829 transitions. [2019-12-27 18:47:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:47:57,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:57,487 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 18:47:57,487 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 18:47:57,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:57,487 INFO L82 PathProgramCache]: Analyzing trace with hash 796962561, now seen corresponding path program 1 times [2019-12-27 18:47:57,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:57,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177480208] [2019-12-27 18:47:57,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:57,557 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 18:47:57,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177480208] [2019-12-27 18:47:57,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:57,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:47:57,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [359968693] [2019-12-27 18:47:57,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:57,579 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:57,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 471 transitions. [2019-12-27 18:47:57,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:57,842 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:47:57,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:47:57,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:57,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:47:57,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:47:57,843 INFO L87 Difference]: Start difference. First operand 4682 states and 13829 transitions. Second operand 6 states. [2019-12-27 18:47:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:58,054 INFO L93 Difference]: Finished difference Result 5623 states and 15971 transitions. [2019-12-27 18:47:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:47:58,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 18:47:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:58,063 INFO L225 Difference]: With dead ends: 5623 [2019-12-27 18:47:58,063 INFO L226 Difference]: Without dead ends: 5623 [2019-12-27 18:47:58,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:47:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5623 states. [2019-12-27 18:47:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5623 to 3862. [2019-12-27 18:47:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2019-12-27 18:47:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 11145 transitions. [2019-12-27 18:47:58,125 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 11145 transitions. Word has length 66 [2019-12-27 18:47:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:58,125 INFO L462 AbstractCegarLoop]: Abstraction has 3862 states and 11145 transitions. [2019-12-27 18:47:58,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:47:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 11145 transitions. [2019-12-27 18:47:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:47:58,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:58,130 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 18:47:58,130 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 18:47:58,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash -129319907, now seen corresponding path program 1 times [2019-12-27 18:47:58,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:58,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325445000] [2019-12-27 18:47:58,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:58,251 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 18:47:58,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325445000] [2019-12-27 18:47:58,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:58,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:47:58,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875280822] [2019-12-27 18:47:58,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:58,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:58,446 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 326 transitions. [2019-12-27 18:47:58,446 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:58,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:47:58,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:47:58,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:47:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:47:58,509 INFO L87 Difference]: Start difference. First operand 3862 states and 11145 transitions. Second operand 9 states. [2019-12-27 18:47:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:59,323 INFO L93 Difference]: Finished difference Result 6482 states and 18354 transitions. [2019-12-27 18:47:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:47:59,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 18:47:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:59,335 INFO L225 Difference]: With dead ends: 6482 [2019-12-27 18:47:59,335 INFO L226 Difference]: Without dead ends: 6482 [2019-12-27 18:47:59,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:47:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2019-12-27 18:47:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 3862. [2019-12-27 18:47:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2019-12-27 18:47:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 11145 transitions. [2019-12-27 18:47:59,440 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 11145 transitions. Word has length 67 [2019-12-27 18:47:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:59,441 INFO L462 AbstractCegarLoop]: Abstraction has 3862 states and 11145 transitions. [2019-12-27 18:47:59,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:47:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 11145 transitions. [2019-12-27 18:47:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:47:59,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:59,448 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 18:47:59,449 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 18:47:59,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:59,449 INFO L82 PathProgramCache]: Analyzing trace with hash 392783873, now seen corresponding path program 2 times [2019-12-27 18:47:59,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:59,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823144825] [2019-12-27 18:47:59,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:59,507 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 18:47:59,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823144825] [2019-12-27 18:47:59,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:59,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:47:59,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531293006] [2019-12-27 18:47:59,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:59,529 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:59,687 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 392 transitions. [2019-12-27 18:47:59,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:59,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:47:59,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:47:59,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:59,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:47:59,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:47:59,696 INFO L87 Difference]: Start difference. First operand 3862 states and 11145 transitions. Second operand 3 states. [2019-12-27 18:47:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:59,720 INFO L93 Difference]: Finished difference Result 3690 states and 10432 transitions. [2019-12-27 18:47:59,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:47:59,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 18:47:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:59,726 INFO L225 Difference]: With dead ends: 3690 [2019-12-27 18:47:59,726 INFO L226 Difference]: Without dead ends: 3690 [2019-12-27 18:47:59,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 4 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 18:47:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2019-12-27 18:47:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 2988. [2019-12-27 18:47:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-27 18:47:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 8462 transitions. [2019-12-27 18:47:59,779 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 8462 transitions. Word has length 67 [2019-12-27 18:47:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:59,779 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 8462 transitions. [2019-12-27 18:47:59,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:47:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 8462 transitions. [2019-12-27 18:47:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:47:59,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:59,783 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 18:47:59,784 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 18:47:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash -857460709, now seen corresponding path program 1 times [2019-12-27 18:47:59,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:59,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472471727] [2019-12-27 18:47:59,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:00,088 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 18:48:00,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472471727] [2019-12-27 18:48:00,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:00,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:48:00,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643017910] [2019-12-27 18:48:00,089 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:00,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:00,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 318 transitions. [2019-12-27 18:48:00,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:00,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:48:00,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:48:00,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:00,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:48:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:48:00,292 INFO L87 Difference]: Start difference. First operand 2988 states and 8462 transitions. Second operand 13 states. [2019-12-27 18:48:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:00,892 INFO L93 Difference]: Finished difference Result 6179 states and 17556 transitions. [2019-12-27 18:48:00,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:48:00,892 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-27 18:48:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:00,901 INFO L225 Difference]: With dead ends: 6179 [2019-12-27 18:48:00,902 INFO L226 Difference]: Without dead ends: 6148 [2019-12-27 18:48:00,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:48:00,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6148 states. [2019-12-27 18:48:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6148 to 4143. [2019-12-27 18:48:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-12-27 18:48:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 11625 transitions. [2019-12-27 18:48:00,966 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 11625 transitions. Word has length 68 [2019-12-27 18:48:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:00,966 INFO L462 AbstractCegarLoop]: Abstraction has 4143 states and 11625 transitions. [2019-12-27 18:48:00,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:48:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 11625 transitions. [2019-12-27 18:48:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:48:00,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:00,971 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 18:48:00,971 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 18:48:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1442657587, now seen corresponding path program 2 times [2019-12-27 18:48:00,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:00,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600876688] [2019-12-27 18:48:00,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:48:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:48:01,127 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:48:01,129 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:48:01,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] ULTIMATE.startENTRY-->L803: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2495~0.base_22| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t2495~0.base_22|) 0) (= v_~z$w_buff1~0_188 0) (= v_~weak$$choice2~0_132 0) (= v_~main$tmp_guard0~0_18 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2495~0.base_22| 1) |v_#valid_56|) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_211 0) (= v_~main$tmp_guard1~0_26 0) (= v_~z~0_153 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2495~0.base_22|) (= 0 v_~z$r_buff0_thd3~0_107) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$mem_tmp~0_39 0) (= v_~z$r_buff0_thd2~0_110 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2495~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2495~0.base_22|) |v_ULTIMATE.start_main_~#t2495~0.offset_17| 0)) |v_#memory_int_19|) (= v_~z$r_buff1_thd1~0_172 0) (= 0 |v_ULTIMATE.start_main_~#t2495~0.offset_17|) (= 0 v_~z$flush_delayed~0_55) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~y~0_40 0) (= 0 v_~x~0_132) (= v_~__unbuffered_cnt~0_139 0) (= v_~z$w_buff1_used~0_438 0) (= v_~z$w_buff0~0_198 0) (= v_~z$r_buff1_thd0~0_288 0) (= 0 v_~weak$$choice0~0_34) (= v_~z$w_buff0_used~0_699 0) (= 0 v_~z$r_buff1_thd3~0_190) (= v_~z$r_buff1_thd2~0_178 0) (= v_~z$r_buff0_thd0~0_338 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_59|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_25|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_178, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_25|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_135|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_42|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_44|, ULTIMATE.start_main_~#t2497~0.base=|v_ULTIMATE.start_main_~#t2497~0.base_19|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_338, #length=|v_#length_21|, ~z$mem_tmp~0=v_~z$mem_tmp~0_39, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_48|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_438, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ~z$flush_delayed~0=v_~z$flush_delayed~0_55, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_29|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~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_107, ULTIMATE.start_main_~#t2495~0.base=|v_ULTIMATE.start_main_~#t2495~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_132, ULTIMATE.start_main_~#t2495~0.offset=|v_ULTIMATE.start_main_~#t2495~0.offset_17|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_59|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_71|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~z$w_buff1~0=v_~z$w_buff1~0_188, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_195|, 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_23|, ULTIMATE.start_main_~#t2496~0.base=|v_ULTIMATE.start_main_~#t2496~0.base_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_32|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_288, ~y~0=v_~y~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_699, ~z$w_buff0~0=v_~z$w_buff0~0_198, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_190, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_56|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, ULTIMATE.start_main_~#t2497~0.offset=|v_ULTIMATE.start_main_~#t2497~0.offset_14|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ULTIMATE.start_main_~#t2496~0.offset=|v_ULTIMATE.start_main_~#t2496~0.offset_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_153, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~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_~#t2497~0.base, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, 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, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2495~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2495~0.offset, 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_~#t2496~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, 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_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t2497~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t2496~0.offset, 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 18:48:01,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_115 v_~z$w_buff1_used~0_60) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 0 (mod v_~z$w_buff1_used~0_60 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_~z$w_buff0~0_27 v_~z$w_buff1~0_20) (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_7|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_7|) (= v_~z$w_buff0_used~0_114 1) (= 2 v_~z$w_buff0~0_26)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_27, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_7|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_114, ~z$w_buff0~0=v_~z$w_buff0~0_26, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_9, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_7|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} 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 18:48:01,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1013789311 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1013789311 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1013789311| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1013789311| ~z$w_buff0_used~0_In-1013789311)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013789311, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1013789311} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1013789311|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013789311, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1013789311} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:48:01,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L803-1-->L805: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2496~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t2496~0.base_9| 0)) (= 0 |v_ULTIMATE.start_main_~#t2496~0.offset_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2496~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2496~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2496~0.base_9|) |v_ULTIMATE.start_main_~#t2496~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2496~0.base_9|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2496~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2496~0.offset=|v_ULTIMATE.start_main_~#t2496~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2496~0.base=|v_ULTIMATE.start_main_~#t2496~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2496~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2496~0.base] because there is no mapped edge [2019-12-27 18:48:01,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L805-1-->L807: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2497~0.base_13| 1)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2497~0.base_13|)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2497~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2497~0.base_13|) |v_ULTIMATE.start_main_~#t2497~0.offset_11| 2))) (= |v_ULTIMATE.start_main_~#t2497~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2497~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2497~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t2497~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2497~0.base=|v_ULTIMATE.start_main_~#t2497~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2497~0.offset=|v_ULTIMATE.start_main_~#t2497~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2497~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2497~0.offset] because there is no mapped edge [2019-12-27 18:48:01,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L760-2-->L760-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-651154372 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-651154372 256)))) (or (and (= ~z$w_buff1~0_In-651154372 |P1Thread1of1ForFork1_#t~ite9_Out-651154372|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-651154372 |P1Thread1of1ForFork1_#t~ite9_Out-651154372|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-651154372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-651154372, ~z$w_buff1~0=~z$w_buff1~0_In-651154372, ~z~0=~z~0_In-651154372} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-651154372|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-651154372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-651154372, ~z$w_buff1~0=~z$w_buff1~0_In-651154372, ~z~0=~z~0_In-651154372} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:48:01,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L760-4-->L761: Formula: (= v_~z~0_37 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_13|, ~z~0=v_~z~0_37} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 18:48:01,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-925268039 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-925268039 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-925268039|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-925268039 |P1Thread1of1ForFork1_#t~ite11_Out-925268039|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-925268039, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-925268039} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-925268039, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-925268039|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-925268039} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:48:01,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L780-2-->L780-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1025390476 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1025390476 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1025390476 |P2Thread1of1ForFork2_#t~ite15_Out1025390476|)) (and (or .cse1 .cse0) (= ~z~0_In1025390476 |P2Thread1of1ForFork2_#t~ite15_Out1025390476|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1025390476, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1025390476, ~z$w_buff1~0=~z$w_buff1~0_In1025390476, ~z~0=~z~0_In1025390476} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1025390476|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1025390476, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1025390476, ~z$w_buff1~0=~z$w_buff1~0_In1025390476, ~z~0=~z~0_In1025390476} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:48:01,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L780-4-->L781: Formula: (= v_~z~0_41 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_41, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 18:48:01,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In232565742 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In232565742 256)))) (or (and (= ~z$w_buff0_used~0_In232565742 |P2Thread1of1ForFork2_#t~ite17_Out232565742|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out232565742|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In232565742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In232565742} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In232565742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In232565742, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out232565742|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:48:01,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In2008321092 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In2008321092 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In2008321092 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2008321092 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out2008321092|)) (and (= ~z$w_buff1_used~0_In2008321092 |P2Thread1of1ForFork2_#t~ite18_Out2008321092|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2008321092, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2008321092, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2008321092, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2008321092} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2008321092, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2008321092, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2008321092, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2008321092, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out2008321092|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:48:01,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L762-->L762-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-2020139201 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-2020139201 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2020139201 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-2020139201 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-2020139201|)) (and (= ~z$w_buff1_used~0_In-2020139201 |P1Thread1of1ForFork1_#t~ite12_Out-2020139201|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2020139201, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2020139201, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2020139201, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2020139201} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2020139201, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2020139201, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2020139201, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2020139201|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2020139201} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:48:01,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In315174509 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In315174509 256)))) (or (and (= ~z$r_buff0_thd3~0_In315174509 |P2Thread1of1ForFork2_#t~ite19_Out315174509|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out315174509|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In315174509, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In315174509} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In315174509, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In315174509, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out315174509|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:48:01,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1231571684 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1231571684 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1231571684|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1231571684 |P1Thread1of1ForFork1_#t~ite13_Out1231571684|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1231571684, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1231571684} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1231571684, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1231571684|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1231571684} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:48:01,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1694259280 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1694259280 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1694259280 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1694259280 256) 0))) (or (and (= ~z$r_buff1_thd2~0_In1694259280 |P1Thread1of1ForFork1_#t~ite14_Out1694259280|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1694259280|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1694259280, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1694259280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1694259280, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1694259280} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1694259280, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1694259280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1694259280, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1694259280|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1694259280} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:48:01,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L764-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_130 |v_P1Thread1of1ForFork1_#t~ite14_40|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_130, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_39|, 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 18:48:01,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L784-->L784-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1462405451 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1462405451 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1462405451 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1462405451 256)))) (or (and (= ~z$r_buff1_thd3~0_In1462405451 |P2Thread1of1ForFork2_#t~ite20_Out1462405451|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out1462405451| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1462405451, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1462405451, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1462405451, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1462405451} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1462405451, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1462405451|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1462405451, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1462405451, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1462405451} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:48:01,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L784-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_148 |v_P2Thread1of1ForFork2_#t~ite20_36|)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_148, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, 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 18:48:01,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In989283393 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In989283393 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In989283393 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In989283393 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out989283393| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out989283393| ~z$w_buff1_used~0_In989283393)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In989283393, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In989283393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989283393, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In989283393} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out989283393|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989283393, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In989283393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989283393, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In989283393} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:48:01,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L743-->L744: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1754723528 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1754723528 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out1754723528) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In1754723528 ~z$r_buff0_thd1~0_Out1754723528) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1754723528, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1754723528} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1754723528, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1754723528|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1754723528} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:48:01,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1801649078 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1801649078 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1801649078 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1801649078 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-1801649078 |P0Thread1of1ForFork0_#t~ite8_Out-1801649078|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1801649078|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1801649078, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1801649078, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1801649078, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1801649078} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1801649078, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1801649078|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1801649078, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1801649078, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1801649078} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:48:01,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_118 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_118, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} 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 18:48:01,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L807-1-->L813: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:48:01,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L813-2-->L813-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In363204383 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In363204383 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite25_Out363204383| |ULTIMATE.start_main_#t~ite24_Out363204383|))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite24_Out363204383| ~z~0_In363204383) (or .cse1 .cse2)) (and (not .cse2) (not .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite24_Out363204383| ~z$w_buff1~0_In363204383)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In363204383, ~z$w_buff1_used~0=~z$w_buff1_used~0_In363204383, ~z$w_buff1~0=~z$w_buff1~0_In363204383, ~z~0=~z~0_In363204383} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In363204383, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out363204383|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In363204383, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out363204383|, ~z$w_buff1~0=~z$w_buff1~0_In363204383, ~z~0=~z~0_In363204383} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 18:48:01,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2072309710 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2072309710 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-2072309710| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-2072309710 |ULTIMATE.start_main_#t~ite26_Out-2072309710|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2072309710, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2072309710} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2072309710, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2072309710, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-2072309710|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:48:01,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1628920553 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1628920553 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1628920553 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1628920553 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1628920553|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1628920553 |ULTIMATE.start_main_#t~ite27_Out-1628920553|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1628920553, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1628920553, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1628920553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1628920553} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1628920553, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1628920553, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1628920553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1628920553, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1628920553|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:48:01,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-329732530 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-329732530 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out-329732530|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out-329732530| ~z$r_buff0_thd0~0_In-329732530) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-329732530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-329732530} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-329732530, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-329732530|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-329732530} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:48:01,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-192142972 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-192142972 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-192142972 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-192142972 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-192142972| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In-192142972 |ULTIMATE.start_main_#t~ite29_Out-192142972|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-192142972, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-192142972, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-192142972, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-192142972} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-192142972, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-192142972|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-192142972, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-192142972, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-192142972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:48:01,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L829-->L830: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_46 256))) (= v_~z$r_buff0_thd0~0_162 v_~z$r_buff0_thd0~0_161)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_46} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_161, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_7|, ~weak$$choice2~0=v_~weak$$choice2~0_46} 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 18:48:01,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L832-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_15 256)) (not (= (mod v_~z$flush_delayed~0_47 256) 0)) (= 0 v_~z$flush_delayed~0_46) (= v_~z$mem_tmp~0_33 v_~z~0_120)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_47} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_28|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~z~0=v_~z~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 18:48:01,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:48:01,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:48:01 BasicIcfg [2019-12-27 18:48:01,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:48:01,262 INFO L168 Benchmark]: Toolchain (without parser) took 75802.16 ms. Allocated memory was 142.6 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 101.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 18:48:01,263 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 142.6 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 18:48:01,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.91 ms. Allocated memory was 142.6 MB in the beginning and 203.4 MB in the end (delta: 60.8 MB). Free memory was 101.4 MB in the beginning and 154.7 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:48:01,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.60 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:48:01,265 INFO L168 Benchmark]: Boogie Preprocessor took 38.67 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:48:01,266 INFO L168 Benchmark]: RCFGBuilder took 841.64 ms. Allocated memory is still 203.4 MB. Free memory was 149.2 MB in the beginning and 99.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:48:01,267 INFO L168 Benchmark]: TraceAbstraction took 74015.22 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 18:48:01,273 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.18 ms. Allocated memory is still 142.6 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.91 ms. Allocated memory was 142.6 MB in the beginning and 203.4 MB in the end (delta: 60.8 MB). Free memory was 101.4 MB in the beginning and 154.7 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.60 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.67 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.64 ms. Allocated memory is still 203.4 MB. Free memory was 149.2 MB in the beginning and 99.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 74015.22 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 173 ProgramPointsBefore, 95 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 29 ChoiceCompositions, 5611 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 225 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 79634 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L803] FCALL, FORK 0 pthread_create(&t2495, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L730] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L731] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L732] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L733] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L734] 1 z$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=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] [L740] 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, 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] [L740] 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) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L805] FCALL, FORK 0 pthread_create(&t2496, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L807] FCALL, FORK 0 pthread_create(&t2497, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L754] 2 x = 2 [L757] 2 y = 1 VAL [__unbuffered_cnt=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=2, 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] [L760] 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=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=2, 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] [L774] 3 y = 2 [L777] 3 z = 1 VAL [__unbuffered_cnt=0, 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=2, y=2, 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] [L780] 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=0, 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=2, y=2, 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] [L761] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L762] 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 [L782] 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 [L763] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L742] 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 [L813] EXPR 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, 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=2, y=2, 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] [L813] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L814] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L815] 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 [L816] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L817] 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 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 z$flush_delayed = weak$$choice2 [L823] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, y=2, 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] [L824] 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, 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=2, y=2, 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] [L824] 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) [L825] 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, 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=2, y=2, 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] [L825] 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)) [L826] 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, 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=2, y=2, 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] [L826] 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)) [L827] 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, 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=2, y=2, 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] [L827] 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)) [L828] 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, 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=2, y=2, 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$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)) [L830] 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, 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=2, y=2, 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$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)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, y=2, 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, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 73.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2393 SDtfs, 2915 SDslu, 5387 SDs, 0 SdLazy, 3219 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 65 SyntacticMatches, 37 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162745occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 51478 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 634 ConstructedInterpolants, 0 QuantifiedInterpolants, 125382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...