/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/mix048_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:14:54,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:14:54,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:14:54,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:14:54,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:14:54,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:14:54,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:14:54,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:14:54,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:14:54,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:14:54,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:14:54,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:14:54,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:14:54,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:14:54,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:14:54,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:14:54,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:14:54,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:14:54,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:14:54,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:14:54,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:14:54,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:14:54,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:14:54,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:14:55,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:14:55,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:14:55,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:14:55,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:14:55,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:14:55,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:14:55,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:14:55,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:14:55,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:14:55,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:14:55,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:14:55,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:14:55,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:14:55,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:14:55,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:14:55,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:14:55,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:14:55,018 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 17:14:55,053 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:14:55,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:14:55,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:14:55,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:14:55,055 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:14:55,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:14:55,056 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:14:55,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:14:55,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:14:55,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:14:55,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:14:55,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:14:55,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:14:55,059 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:14:55,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:14:55,060 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:14:55,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:14:55,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:14:55,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:14:55,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:14:55,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:14:55,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:14:55,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:14:55,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:14:55,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:14:55,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:14:55,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:14:55,063 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:14:55,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:14:55,064 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:14:55,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:14:55,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:14:55,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:14:55,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:14:55,366 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:14:55,367 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:14:55,369 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_rmo.opt.i [2019-12-27 17:14:55,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b577de41/c99d0124f75341419ff1417d236456c5/FLAGa676c26ba [2019-12-27 17:14:55,980 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:14:55,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_rmo.opt.i [2019-12-27 17:14:56,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b577de41/c99d0124f75341419ff1417d236456c5/FLAGa676c26ba [2019-12-27 17:14:56,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b577de41/c99d0124f75341419ff1417d236456c5 [2019-12-27 17:14:56,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:14:56,417 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:14:56,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:14:56,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:14:56,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:14:56,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:14:56" (1/1) ... [2019-12-27 17:14:56,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34bee71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:56, skipping insertion in model container [2019-12-27 17:14:56,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:14:56" (1/1) ... [2019-12-27 17:14:56,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:14:56,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:14:56,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:14:56,992 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:14:57,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:14:57,142 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:14:57,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57 WrapperNode [2019-12-27 17:14:57,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:14:57,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:14:57,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:14:57,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:14:57,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (1/1) ... [2019-12-27 17:14:57,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (1/1) ... [2019-12-27 17:14:57,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:14:57,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:14:57,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:14:57,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:14:57,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (1/1) ... [2019-12-27 17:14:57,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (1/1) ... [2019-12-27 17:14:57,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (1/1) ... [2019-12-27 17:14:57,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (1/1) ... [2019-12-27 17:14:57,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (1/1) ... [2019-12-27 17:14:57,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (1/1) ... [2019-12-27 17:14:57,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (1/1) ... [2019-12-27 17:14:57,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:14:57,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:14:57,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:14:57,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:14:57,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (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 17:14:57,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:14:57,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:14:57,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:14:57,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:14:57,341 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:14:57,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:14:57,342 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:14:57,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:14:57,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:14:57,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:14:57,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:14:57,344 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 17:14:58,081 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:14:58,081 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:14:58,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:14:58 BoogieIcfgContainer [2019-12-27 17:14:58,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:14:58,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:14:58,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:14:58,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:14:58,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:14:56" (1/3) ... [2019-12-27 17:14:58,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d81b7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:14:58, skipping insertion in model container [2019-12-27 17:14:58,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:57" (2/3) ... [2019-12-27 17:14:58,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d81b7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:14:58, skipping insertion in model container [2019-12-27 17:14:58,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:14:58" (3/3) ... [2019-12-27 17:14:58,098 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_rmo.opt.i [2019-12-27 17:14:58,110 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:14:58,111 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:14:58,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:14:58,126 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:14:58,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,255 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:58,276 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:14:58,298 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:14:58,298 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:14:58,299 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:14:58,299 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:14:58,299 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:14:58,299 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:14:58,299 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:14:58,299 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:14:58,323 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 17:14:58,325 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:14:58,435 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:14:58,436 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:14:58,449 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:14:58,467 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:14:58,511 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:14:58,512 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:14:58,518 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:14:58,532 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 17:14:58,533 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:15:03,324 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 17:15:03,432 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 17:15:03,549 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 17:15:03,550 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 17:15:03,554 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 17:15:04,143 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 17:15:04,145 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 17:15:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:15:04,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:04,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:15:04,154 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:04,164 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 17:15:04,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:04,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695518580] [2019-12-27 17:15:04,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:04,503 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 17:15:04,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695518580] [2019-12-27 17:15:04,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:04,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:15:04,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [35881555] [2019-12-27 17:15:04,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:04,519 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:04,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:15:04,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:04,536 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:04,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:15:04,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:04,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:15:04,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:04,550 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 17:15:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:04,847 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 17:15:04,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:15:04,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:15:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:04,926 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 17:15:04,926 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 17:15:04,927 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 17:15:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 17:15:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 17:15:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 17:15:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 17:15:05,407 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 17:15:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:05,408 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 17:15:05,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:15:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 17:15:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:15:05,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:05,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:15:05,412 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:05,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:05,412 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 17:15:05,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:05,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841335458] [2019-12-27 17:15:05,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:05,540 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 17:15:05,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841335458] [2019-12-27 17:15:05,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:05,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:15:05,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1356819373] [2019-12-27 17:15:05,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:05,544 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:05,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:15:05,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:05,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:05,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:15:05,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:05,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:15:05,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:15:05,553 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 17:15:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:05,950 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-27 17:15:05,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:15:05,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:15:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:06,038 INFO L225 Difference]: With dead ends: 11630 [2019-12-27 17:15:06,038 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 17:15:06,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:15:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 17:15:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-27 17:15:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-27 17:15:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-27 17:15:07,027 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-27 17:15:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:07,028 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-27 17:15:07,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:15:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-27 17:15:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:15:07,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:07,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:15:07,033 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:07,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:07,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 17:15:07,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:07,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642975870] [2019-12-27 17:15:07,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:07,165 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 17:15:07,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642975870] [2019-12-27 17:15:07,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:07,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:15:07,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591785517] [2019-12-27 17:15:07,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:07,168 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:07,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:15:07,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:07,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:07,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:15:07,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:07,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:15:07,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:15:07,174 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-27 17:15:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:07,556 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-27 17:15:07,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:15:07,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:15:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:07,614 INFO L225 Difference]: With dead ends: 14471 [2019-12-27 17:15:07,614 INFO L226 Difference]: Without dead ends: 14471 [2019-12-27 17:15:07,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:15:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-27 17:15:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-27 17:15:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-27 17:15:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-27 17:15:08,126 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-27 17:15:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:08,127 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-27 17:15:08,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:15:08,127 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-27 17:15:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:15:08,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:08,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:15:08,131 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:08,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-27 17:15:08,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:08,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775760047] [2019-12-27 17:15:08,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:08,212 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 17:15:08,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775760047] [2019-12-27 17:15:08,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:08,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:15:08,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52398387] [2019-12-27 17:15:08,214 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:08,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:08,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 17:15:08,222 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:08,224 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:08,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:15:08,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:08,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:15:08,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:08,227 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-27 17:15:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:08,300 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-27 17:15:08,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:15:08,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:15:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:08,332 INFO L225 Difference]: With dead ends: 10750 [2019-12-27 17:15:08,332 INFO L226 Difference]: Without dead ends: 10750 [2019-12-27 17:15:08,333 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 17:15:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-27 17:15:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-27 17:15:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-27 17:15:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-27 17:15:08,632 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-27 17:15:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:08,632 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-27 17:15:08,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:15:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-27 17:15:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:15:08,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:08,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:15:08,636 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-27 17:15:08,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:08,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862631653] [2019-12-27 17:15:08,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:08,725 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 17:15:08,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862631653] [2019-12-27 17:15:08,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:08,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:15:08,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1730343345] [2019-12-27 17:15:08,726 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:08,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:08,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:15:08,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:08,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:08,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:15:08,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:08,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:15:08,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:15:08,731 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-27 17:15:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:08,761 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-27 17:15:08,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:15:08,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:15:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:08,765 INFO L225 Difference]: With dead ends: 2054 [2019-12-27 17:15:08,766 INFO L226 Difference]: Without dead ends: 1457 [2019-12-27 17:15:08,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:15:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-27 17:15:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-27 17:15:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-27 17:15:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-27 17:15:08,791 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-27 17:15:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:08,791 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-27 17:15:08,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:15:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-27 17:15:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 17:15:08,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:08,793 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] [2019-12-27 17:15:08,793 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:08,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:08,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 17:15:08,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:08,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530803426] [2019-12-27 17:15:08,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:08,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 17:15:08,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530803426] [2019-12-27 17:15:08,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:08,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:15:08,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520731608] [2019-12-27 17:15:08,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:08,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:09,012 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 17:15:09,012 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:09,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:09,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:15:09,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:09,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:15:09,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:15:09,013 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-27 17:15:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:09,397 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-27 17:15:09,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:15:09,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 17:15:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:09,402 INFO L225 Difference]: With dead ends: 2249 [2019-12-27 17:15:09,402 INFO L226 Difference]: Without dead ends: 2197 [2019-12-27 17:15:09,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:15:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-27 17:15:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-27 17:15:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-27 17:15:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-27 17:15:09,430 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-27 17:15:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:09,431 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-27 17:15:09,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:15:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-27 17:15:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:15:09,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:09,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:15:09,433 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-27 17:15:09,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:09,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657191458] [2019-12-27 17:15:09,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:09,530 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 17:15:09,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657191458] [2019-12-27 17:15:09,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:09,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:15:09,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [333370111] [2019-12-27 17:15:09,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:09,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:09,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 71 transitions. [2019-12-27 17:15:09,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:09,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:15:09,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:15:09,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:09,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:15:09,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:15:09,590 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 6 states. [2019-12-27 17:15:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:09,633 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-27 17:15:09,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:15:09,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:15:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:09,636 INFO L225 Difference]: With dead ends: 752 [2019-12-27 17:15:09,636 INFO L226 Difference]: Without dead ends: 689 [2019-12-27 17:15:09,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:15:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-27 17:15:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-27 17:15:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-27 17:15:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-27 17:15:09,647 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-27 17:15:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:09,648 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-27 17:15:09,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:15:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-27 17:15:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:15:09,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:09,651 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] [2019-12-27 17:15:09,651 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:09,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-27 17:15:09,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:09,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953210285] [2019-12-27 17:15:09,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:09,727 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 17:15:09,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953210285] [2019-12-27 17:15:09,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:09,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:15:09,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1380841543] [2019-12-27 17:15:09,728 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:09,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:09,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 64 transitions. [2019-12-27 17:15:09,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:09,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:15:09,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:15:09,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:09,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:15:09,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:15:09,787 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 4 states. [2019-12-27 17:15:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:09,804 INFO L93 Difference]: Finished difference Result 1118 states and 2458 transitions. [2019-12-27 17:15:09,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:15:09,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-27 17:15:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:09,806 INFO L225 Difference]: With dead ends: 1118 [2019-12-27 17:15:09,806 INFO L226 Difference]: Without dead ends: 471 [2019-12-27 17:15:09,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:15:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-27 17:15:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-27 17:15:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-27 17:15:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-27 17:15:09,814 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 51 [2019-12-27 17:15:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:09,814 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-27 17:15:09,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:15:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-27 17:15:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:15:09,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:09,816 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] [2019-12-27 17:15:09,816 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:09,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 2 times [2019-12-27 17:15:09,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:09,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51307851] [2019-12-27 17:15:09,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:09,905 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 17:15:09,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51307851] [2019-12-27 17:15:09,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:09,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:15:09,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825466920] [2019-12-27 17:15:09,906 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:09,920 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:09,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 96 transitions. [2019-12-27 17:15:09,964 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:10,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:15:10,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:15:10,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:15:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:15:10,028 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 9 states. [2019-12-27 17:15:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:10,403 INFO L93 Difference]: Finished difference Result 982 states and 2086 transitions. [2019-12-27 17:15:10,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:15:10,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 17:15:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:10,405 INFO L225 Difference]: With dead ends: 982 [2019-12-27 17:15:10,405 INFO L226 Difference]: Without dead ends: 683 [2019-12-27 17:15:10,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:15:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-27 17:15:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 529. [2019-12-27 17:15:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-27 17:15:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1137 transitions. [2019-12-27 17:15:10,416 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1137 transitions. Word has length 51 [2019-12-27 17:15:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:10,416 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1137 transitions. [2019-12-27 17:15:10,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:15:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1137 transitions. [2019-12-27 17:15:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:15:10,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:10,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] [2019-12-27 17:15:10,419 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:10,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1158154681, now seen corresponding path program 3 times [2019-12-27 17:15:10,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:10,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627130626] [2019-12-27 17:15:10,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:10,573 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 17:15:10,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627130626] [2019-12-27 17:15:10,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:10,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:15:10,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1614277744] [2019-12-27 17:15:10,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:10,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:10,637 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 98 transitions. [2019-12-27 17:15:10,637 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:10,671 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:15:10,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:15:10,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:15:10,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:15:10,672 INFO L87 Difference]: Start difference. First operand 529 states and 1137 transitions. Second operand 6 states. [2019-12-27 17:15:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:11,077 INFO L93 Difference]: Finished difference Result 885 states and 1849 transitions. [2019-12-27 17:15:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:15:11,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 17:15:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:11,079 INFO L225 Difference]: With dead ends: 885 [2019-12-27 17:15:11,079 INFO L226 Difference]: Without dead ends: 861 [2019-12-27 17:15:11,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:15:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-27 17:15:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 712. [2019-12-27 17:15:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-27 17:15:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1532 transitions. [2019-12-27 17:15:11,092 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1532 transitions. Word has length 51 [2019-12-27 17:15:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:11,092 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1532 transitions. [2019-12-27 17:15:11,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:15:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1532 transitions. [2019-12-27 17:15:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:15:11,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:11,094 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] [2019-12-27 17:15:11,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash -320603405, now seen corresponding path program 4 times [2019-12-27 17:15:11,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:11,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518745117] [2019-12-27 17:15:11,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:11,194 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 17:15:11,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518745117] [2019-12-27 17:15:11,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:11,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:15:11,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749966316] [2019-12-27 17:15:11,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:11,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:11,256 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 101 transitions. [2019-12-27 17:15:11,256 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:11,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:11,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:15:11,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:11,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:15:11,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:11,258 INFO L87 Difference]: Start difference. First operand 712 states and 1532 transitions. Second operand 3 states. [2019-12-27 17:15:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:11,318 INFO L93 Difference]: Finished difference Result 923 states and 1980 transitions. [2019-12-27 17:15:11,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:15:11,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 17:15:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:11,320 INFO L225 Difference]: With dead ends: 923 [2019-12-27 17:15:11,321 INFO L226 Difference]: Without dead ends: 923 [2019-12-27 17:15:11,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 17:15:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-27 17:15:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 754. [2019-12-27 17:15:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 17:15:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 17:15:11,414 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 17:15:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:11,415 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 17:15:11,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:15:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 17:15:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:15:11,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:11,416 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] [2019-12-27 17:15:11,417 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:11,417 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 17:15:11,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:11,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565827689] [2019-12-27 17:15:11,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:15:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:15:11,553 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:15:11,554 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:15:11,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1291~0.base_40|)) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1291~0.base_40| 4)) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1291~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1291~0.base_40|) |v_ULTIMATE.start_main_~#t1291~0.offset_27| 0)) |v_#memory_int_17|) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1291~0.base_40| 1)) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_ULTIMATE.start_main_~#t1291~0.offset_27| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1291~0.base_40|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t1292~0.offset=|v_ULTIMATE.start_main_~#t1292~0.offset_27|, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ULTIMATE.start_main_~#t1292~0.base=|v_ULTIMATE.start_main_~#t1292~0.base_41|, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1291~0.offset=|v_ULTIMATE.start_main_~#t1291~0.offset_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1291~0.base=|v_ULTIMATE.start_main_~#t1291~0.base_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1292~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1292~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1291~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1291~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:15:11,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1292~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1292~0.base_13|) |v_ULTIMATE.start_main_~#t1292~0.offset_11| 1)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1292~0.base_13|)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1292~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1292~0.base_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1292~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1292~0.offset_11| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1292~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1292~0.offset=|v_ULTIMATE.start_main_~#t1292~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1292~0.base=|v_ULTIMATE.start_main_~#t1292~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1292~0.offset, ULTIMATE.start_main_~#t1292~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 17:15:11,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd0~0_In382267170 ~y$r_buff1_thd0~0_Out382267170) (= ~x~0_In382267170 ~__unbuffered_p0_EAX~0_Out382267170) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In382267170)) (= ~y$r_buff1_thd2~0_Out382267170 ~y$r_buff0_thd2~0_In382267170) (= 1 ~y$r_buff0_thd1~0_Out382267170) (= ~y$r_buff0_thd1~0_In382267170 ~y$r_buff1_thd1~0_Out382267170)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In382267170, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In382267170, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In382267170, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In382267170, ~x~0=~x~0_In382267170} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out382267170, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out382267170, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out382267170, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In382267170, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out382267170, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In382267170, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In382267170, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out382267170, ~x~0=~x~0_In382267170} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:15:11,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2003104796 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In2003104796 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out2003104796| ~y$w_buff0_used~0_In2003104796) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2003104796| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2003104796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2003104796} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2003104796|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2003104796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2003104796} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:15:11,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1610782569 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1610782569| |P1Thread1of1ForFork1_#t~ite20_Out-1610782569|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1610782569| ~y$w_buff0_used~0_In-1610782569)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-1610782569| |P1Thread1of1ForFork1_#t~ite20_Out-1610782569|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1610782569 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1610782569 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1610782569 256))) (= (mod ~y$w_buff0_used~0_In-1610782569 256) 0))) (= |P1Thread1of1ForFork1_#t~ite20_Out-1610782569| ~y$w_buff0_used~0_In-1610782569)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1610782569, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1610782569, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1610782569|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1610782569, ~weak$$choice2~0=~weak$$choice2~0_In-1610782569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1610782569} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1610782569, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1610782569, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1610782569|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1610782569, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1610782569|, ~weak$$choice2~0=~weak$$choice2~0_In-1610782569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1610782569} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 17:15:11,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse4 (= (mod ~y$w_buff1_used~0_In-353254520 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-353254520 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-353254520 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-353254520 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-353254520| |P1Thread1of1ForFork1_#t~ite23_Out-353254520|)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-353254520 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-353254520| |P1Thread1of1ForFork1_#t~ite22_Out-353254520|) (or (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse5 (= ~y$w_buff1_used~0_In-353254520 |P1Thread1of1ForFork1_#t~ite23_Out-353254520|)) (and (= |P1Thread1of1ForFork1_#t~ite23_In-353254520| |P1Thread1of1ForFork1_#t~ite23_Out-353254520|) (= |P1Thread1of1ForFork1_#t~ite24_Out-353254520| ~y$w_buff1_used~0_In-353254520) (not .cse0)))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse4)) (not .cse1) (or .cse6 (not .cse3)) .cse0 .cse5 (= |P1Thread1of1ForFork1_#t~ite22_Out-353254520| 0) (= |P1Thread1of1ForFork1_#t~ite22_Out-353254520| |P1Thread1of1ForFork1_#t~ite23_Out-353254520|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-353254520, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-353254520, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-353254520, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-353254520|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-353254520|, ~weak$$choice2~0=~weak$$choice2~0_In-353254520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-353254520} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-353254520, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-353254520, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-353254520, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-353254520|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-353254520|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-353254520|, ~weak$$choice2~0=~weak$$choice2~0_In-353254520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-353254520} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 17:15:11,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In81339999 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In81339999 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In81339999 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In81339999 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out81339999| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out81339999| ~y$w_buff1_used~0_In81339999) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In81339999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In81339999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In81339999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In81339999} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out81339999|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In81339999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In81339999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In81339999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In81339999} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:15:11,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-145218015 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-145218015 256)))) (or (and (= ~y$r_buff0_thd1~0_Out-145218015 ~y$r_buff0_thd1~0_In-145218015) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-145218015 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-145218015, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-145218015} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-145218015, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-145218015|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-145218015} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:15:11,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In-1335454762 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1335454762 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1335454762 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1335454762 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1335454762|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In-1335454762 |P0Thread1of1ForFork0_#t~ite8_Out-1335454762|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1335454762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1335454762, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1335454762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1335454762} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1335454762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1335454762, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1335454762|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1335454762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1335454762} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:15:11,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:15:11,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-692462134 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-692462134| |P1Thread1of1ForFork1_#t~ite29_Out-692462134|) (= ~y$r_buff1_thd2~0_In-692462134 |P1Thread1of1ForFork1_#t~ite30_Out-692462134|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-692462134| ~y$r_buff1_thd2~0_In-692462134) (= |P1Thread1of1ForFork1_#t~ite29_Out-692462134| |P1Thread1of1ForFork1_#t~ite30_Out-692462134|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-692462134 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-692462134 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In-692462134 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-692462134 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-692462134, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-692462134|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-692462134, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-692462134, ~weak$$choice2~0=~weak$$choice2~0_In-692462134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-692462134} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-692462134, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-692462134|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-692462134|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-692462134, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-692462134, ~weak$$choice2~0=~weak$$choice2~0_In-692462134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-692462134} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:15:11,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 17:15:11,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-83915088 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-83915088 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-83915088 |P1Thread1of1ForFork1_#t~ite32_Out-83915088|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-83915088| ~y~0_In-83915088) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-83915088, ~y$w_buff1~0=~y$w_buff1~0_In-83915088, ~y~0=~y~0_In-83915088, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-83915088} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-83915088, ~y$w_buff1~0=~y$w_buff1~0_In-83915088, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-83915088|, ~y~0=~y~0_In-83915088, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-83915088} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 17:15:11,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 17:15:11,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In194357446 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In194357446 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out194357446| 0)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out194357446| ~y$w_buff0_used~0_In194357446) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In194357446, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In194357446} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In194357446, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In194357446, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out194357446|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:15:11,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-2114061175 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-2114061175 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2114061175 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-2114061175 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-2114061175|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-2114061175 |P1Thread1of1ForFork1_#t~ite35_Out-2114061175|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2114061175, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114061175, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2114061175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2114061175} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2114061175, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114061175, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2114061175, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2114061175|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2114061175} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:15:11,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In983477462 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In983477462 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out983477462|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In983477462 |P1Thread1of1ForFork1_#t~ite36_Out983477462|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In983477462, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In983477462} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In983477462, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In983477462, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out983477462|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:15:11,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1218368053 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1218368053 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1218368053 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1218368053 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1218368053| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out-1218368053| ~y$r_buff1_thd2~0_In-1218368053)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1218368053, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1218368053, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1218368053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1218368053} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1218368053, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1218368053, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1218368053, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1218368053|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1218368053} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:15:11,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:15:11,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:15:11,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:15:11,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1714968535 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1714968535 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1714968535| ~y$w_buff1~0_In1714968535) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1714968535| ~y~0_In1714968535) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1714968535, ~y~0=~y~0_In1714968535, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1714968535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1714968535} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1714968535|, ~y$w_buff1~0=~y$w_buff1~0_In1714968535, ~y~0=~y~0_In1714968535, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1714968535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1714968535} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:15:11,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 17:15:11,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-970624798 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-970624798 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-970624798| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-970624798| ~y$w_buff0_used~0_In-970624798)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-970624798, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-970624798} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-970624798, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-970624798, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-970624798|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:15:11,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-259968805 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-259968805 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-259968805 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-259968805 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-259968805| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-259968805| ~y$w_buff1_used~0_In-259968805)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-259968805, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-259968805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-259968805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-259968805} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-259968805, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-259968805, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-259968805|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-259968805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-259968805} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:15:11,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1683681376 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1683681376 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1683681376| ~y$r_buff0_thd0~0_In-1683681376)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1683681376| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683681376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1683681376} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683681376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1683681376, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1683681376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:15:11,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1368966771 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1368966771 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1368966771 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1368966771 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1368966771 |ULTIMATE.start_main_#t~ite45_Out1368966771|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1368966771|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1368966771, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1368966771, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1368966771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1368966771} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1368966771, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1368966771, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1368966771, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1368966771|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1368966771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:15:11,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:15:11,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:15:11 BasicIcfg [2019-12-27 17:15:11,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:15:11,711 INFO L168 Benchmark]: Toolchain (without parser) took 15296.23 ms. Allocated memory was 145.8 MB in the beginning and 707.8 MB in the end (delta: 562.0 MB). Free memory was 101.0 MB in the beginning and 502.4 MB in the end (delta: -401.4 MB). Peak memory consumption was 160.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:11,712 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:15:11,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.27 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.6 MB in the beginning and 158.7 MB in the end (delta: -58.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:11,716 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.25 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 156.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:11,717 INFO L168 Benchmark]: Boogie Preprocessor took 39.81 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:11,718 INFO L168 Benchmark]: RCFGBuilder took 837.07 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 109.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:11,720 INFO L168 Benchmark]: TraceAbstraction took 13621.63 ms. Allocated memory was 203.9 MB in the beginning and 707.8 MB in the end (delta: 503.8 MB). Free memory was 109.2 MB in the beginning and 502.4 MB in the end (delta: -393.2 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:11,733 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.24 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 724.27 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.6 MB in the beginning and 158.7 MB in the end (delta: -58.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.25 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 156.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.81 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.07 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 109.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13621.63 ms. Allocated memory was 203.9 MB in the beginning and 707.8 MB in the end (delta: 503.8 MB). Free memory was 109.2 MB in the beginning and 502.4 MB in the end (delta: -393.2 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1291, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1292, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.2s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1295 SDtfs, 1498 SDslu, 2451 SDs, 0 SdLazy, 1214 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 5640 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 33998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...