/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/mix039_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:57:59,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:57:59,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:57:59,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:57:59,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:57:59,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:57:59,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:57:59,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:57:59,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:57:59,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:57:59,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:57:59,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:57:59,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:57:59,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:57:59,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:57:59,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:57:59,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:57:59,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:57:59,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:57:59,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:57:59,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:57:59,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:57:59,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:57:59,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:57:59,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:57:59,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:57:59,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:57:59,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:57:59,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:57:59,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:57:59,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:57:59,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:57:59,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:57:59,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:57:59,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:57:59,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:57:59,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:57:59,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:57:59,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:57:59,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:57:59,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:57:59,911 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 16:57:59,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:57:59,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:57:59,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:57:59,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:57:59,932 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:57:59,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:57:59,933 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:57:59,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:57:59,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:57:59,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:57:59,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:57:59,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:57:59,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:57:59,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:57:59,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:57:59,935 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:57:59,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:57:59,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:57:59,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:57:59,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:57:59,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:57:59,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:57:59,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:57:59,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:57:59,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:57:59,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:57:59,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:57:59,938 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:57:59,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:57:59,938 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:57:59,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:58:00,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:58:00,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:58:00,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:58:00,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:58:00,265 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:58:00,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i [2019-12-27 16:58:00,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6bdc004b/1e163059d6664671aa942e13f524618d/FLAGb3cb7af82 [2019-12-27 16:58:00,905 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:58:00,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i [2019-12-27 16:58:00,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6bdc004b/1e163059d6664671aa942e13f524618d/FLAGb3cb7af82 [2019-12-27 16:58:01,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6bdc004b/1e163059d6664671aa942e13f524618d [2019-12-27 16:58:01,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:58:01,242 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:58:01,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:58:01,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:58:01,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:58:01,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:58:01" (1/1) ... [2019-12-27 16:58:01,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc34d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:01, skipping insertion in model container [2019-12-27 16:58:01,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:58:01" (1/1) ... [2019-12-27 16:58:01,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:58:01,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:58:01,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:58:01,824 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:58:01,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:58:02,005 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:58:02,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02 WrapperNode [2019-12-27 16:58:02,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:58:02,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:58:02,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:58:02,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:58:02,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (1/1) ... [2019-12-27 16:58:02,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (1/1) ... [2019-12-27 16:58:02,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:58:02,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:58:02,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:58:02,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:58:02,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (1/1) ... [2019-12-27 16:58:02,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (1/1) ... [2019-12-27 16:58:02,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (1/1) ... [2019-12-27 16:58:02,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (1/1) ... [2019-12-27 16:58:02,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (1/1) ... [2019-12-27 16:58:02,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (1/1) ... [2019-12-27 16:58:02,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (1/1) ... [2019-12-27 16:58:02,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:58:02,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:58:02,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:58:02,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:58:02,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (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 16:58:02,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:58:02,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:58:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:58:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:58:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:58:02,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:58:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:58:02,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:58:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:58:02,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:58:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:58:02,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:58:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:58:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:58:02,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:58:02,183 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 16:58:02,909 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:58:02,909 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:58:02,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:58:02 BoogieIcfgContainer [2019-12-27 16:58:02,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:58:02,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:58:02,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:58:02,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:58:02,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:58:01" (1/3) ... [2019-12-27 16:58:02,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba19295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:58:02, skipping insertion in model container [2019-12-27 16:58:02,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:02" (2/3) ... [2019-12-27 16:58:02,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba19295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:58:02, skipping insertion in model container [2019-12-27 16:58:02,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:58:02" (3/3) ... [2019-12-27 16:58:02,923 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_tso.opt.i [2019-12-27 16:58:02,931 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:58:02,932 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:58:02,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:58:02,940 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:58:02,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,985 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,986 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,041 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,041 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,041 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,042 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,042 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,054 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,055 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,059 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,061 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,067 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,068 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,068 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,068 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,068 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,069 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,069 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,069 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,069 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,069 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,070 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,071 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:03,089 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:58:03,110 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:58:03,110 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:58:03,110 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:58:03,111 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:58:03,111 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:58:03,111 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:58:03,111 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:58:03,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:58:03,128 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 16:58:03,130 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 16:58:03,255 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 16:58:03,255 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:58:03,274 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 16:58:03,290 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 16:58:03,359 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 16:58:03,360 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:58:03,366 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 16:58:03,380 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 16:58:03,382 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:58:07,938 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-27 16:58:08,494 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 16:58:08,598 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 16:58:09,101 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 16:58:09,248 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 16:58:09,268 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-27 16:58:09,268 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 16:58:09,272 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-27 16:58:10,527 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-27 16:58:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-27 16:58:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 16:58:10,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:10,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:10,537 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:10,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:10,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-27 16:58:10,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:10,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330276464] [2019-12-27 16:58:10,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:10,862 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 16:58:10,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330276464] [2019-12-27 16:58:10,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:10,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:58:10,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [148489555] [2019-12-27 16:58:10,869 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:10,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:10,895 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 16:58:10,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:10,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:58:10,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:58:10,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:10,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:58:10,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:10,913 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-27 16:58:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:11,422 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-27 16:58:11,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:11,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 16:58:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:12,380 INFO L225 Difference]: With dead ends: 20958 [2019-12-27 16:58:12,380 INFO L226 Difference]: Without dead ends: 19662 [2019-12-27 16:58:12,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-27 16:58:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-27 16:58:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-27 16:58:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-27 16:58:13,413 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-27 16:58:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:13,414 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-27 16:58:13,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:58:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-27 16:58:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:58:13,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:13,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:13,421 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:13,421 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-27 16:58:13,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:13,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562461945] [2019-12-27 16:58:13,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:13,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 16:58:13,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562461945] [2019-12-27 16:58:13,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:13,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:58:13,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1818596151] [2019-12-27 16:58:13,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:13,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:13,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:58:13,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:13,548 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:58:13,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:58:13,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:13,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:58:13,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:58:13,551 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-27 16:58:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:14,067 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-27 16:58:14,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:58:14,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:58:14,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:15,438 INFO L225 Difference]: With dead ends: 30494 [2019-12-27 16:58:15,439 INFO L226 Difference]: Without dead ends: 30438 [2019-12-27 16:58:15,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:58:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-27 16:58:16,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-27 16:58:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-27 16:58:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-27 16:58:16,555 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-27 16:58:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:16,555 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-27 16:58:16,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:58:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-27 16:58:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 16:58:16,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:16,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:16,573 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:16,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:16,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-27 16:58:16,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:16,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948037142] [2019-12-27 16:58:16,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:16,731 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 16:58:16,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948037142] [2019-12-27 16:58:16,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:16,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:58:16,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [544268364] [2019-12-27 16:58:16,732 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:16,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:16,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 16:58:16,741 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:16,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:58:16,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:58:16,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:58:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:58:16,782 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 5 states. [2019-12-27 16:58:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:17,194 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-27 16:58:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:58:17,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 16:58:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:17,364 INFO L225 Difference]: With dead ends: 35230 [2019-12-27 16:58:17,364 INFO L226 Difference]: Without dead ends: 35182 [2019-12-27 16:58:17,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:58:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-27 16:58:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-27 16:58:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-27 16:58:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-27 16:58:19,890 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-27 16:58:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:19,890 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-27 16:58:19,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:58:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-27 16:58:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 16:58:19,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:19,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:19,901 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:19,902 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-27 16:58:19,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:19,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890026845] [2019-12-27 16:58:19,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:58:19,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890026845] [2019-12-27 16:58:19,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:19,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:58:19,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16473246] [2019-12-27 16:58:19,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:19,962 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:19,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 22 transitions. [2019-12-27 16:58:19,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:19,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:58:19,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:58:19,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:19,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:58:19,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:19,966 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-27 16:58:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:20,132 INFO L93 Difference]: Finished difference Result 30328 states and 126949 transitions. [2019-12-27 16:58:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:20,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 16:58:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:20,260 INFO L225 Difference]: With dead ends: 30328 [2019-12-27 16:58:20,261 INFO L226 Difference]: Without dead ends: 30328 [2019-12-27 16:58:20,261 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 16:58:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-12-27 16:58:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 30328. [2019-12-27 16:58:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30328 states. [2019-12-27 16:58:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30328 states to 30328 states and 126949 transitions. [2019-12-27 16:58:21,289 INFO L78 Accepts]: Start accepts. Automaton has 30328 states and 126949 transitions. Word has length 20 [2019-12-27 16:58:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:21,289 INFO L462 AbstractCegarLoop]: Abstraction has 30328 states and 126949 transitions. [2019-12-27 16:58:21,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:58:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 30328 states and 126949 transitions. [2019-12-27 16:58:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 16:58:21,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:21,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:21,300 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-27 16:58:21,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:21,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988760314] [2019-12-27 16:58:21,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:21,354 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 16:58:21,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988760314] [2019-12-27 16:58:21,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:21,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:58:21,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [619792816] [2019-12-27 16:58:21,355 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:21,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:21,362 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 33 transitions. [2019-12-27 16:58:21,363 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:21,363 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:58:21,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:58:21,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:21,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:58:21,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:21,364 INFO L87 Difference]: Start difference. First operand 30328 states and 126949 transitions. Second operand 3 states. [2019-12-27 16:58:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:21,584 INFO L93 Difference]: Finished difference Result 44924 states and 179717 transitions. [2019-12-27 16:58:21,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:21,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 16:58:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:21,693 INFO L225 Difference]: With dead ends: 44924 [2019-12-27 16:58:21,693 INFO L226 Difference]: Without dead ends: 32296 [2019-12-27 16:58:21,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32296 states. [2019-12-27 16:58:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32296 to 31012. [2019-12-27 16:58:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31012 states. [2019-12-27 16:58:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31012 states to 31012 states and 116299 transitions. [2019-12-27 16:58:24,108 INFO L78 Accepts]: Start accepts. Automaton has 31012 states and 116299 transitions. Word has length 21 [2019-12-27 16:58:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:24,108 INFO L462 AbstractCegarLoop]: Abstraction has 31012 states and 116299 transitions. [2019-12-27 16:58:24,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:58:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 31012 states and 116299 transitions. [2019-12-27 16:58:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 16:58:24,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:24,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:24,122 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1131875471, now seen corresponding path program 1 times [2019-12-27 16:58:24,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:24,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139908165] [2019-12-27 16:58:24,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:58:24,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139908165] [2019-12-27 16:58:24,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:24,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:58:24,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1315513799] [2019-12-27 16:58:24,170 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:24,174 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:24,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 36 transitions. [2019-12-27 16:58:24,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:24,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:58:24,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:58:24,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:58:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:24,180 INFO L87 Difference]: Start difference. First operand 31012 states and 116299 transitions. Second operand 3 states. [2019-12-27 16:58:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:24,563 INFO L93 Difference]: Finished difference Result 30604 states and 114575 transitions. [2019-12-27 16:58:24,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:24,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 16:58:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:24,632 INFO L225 Difference]: With dead ends: 30604 [2019-12-27 16:58:24,633 INFO L226 Difference]: Without dead ends: 30604 [2019-12-27 16:58:24,633 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 16:58:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30604 states. [2019-12-27 16:58:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30604 to 30436. [2019-12-27 16:58:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30436 states. [2019-12-27 16:58:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30436 states to 30436 states and 114095 transitions. [2019-12-27 16:58:25,581 INFO L78 Accepts]: Start accepts. Automaton has 30436 states and 114095 transitions. Word has length 21 [2019-12-27 16:58:25,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:25,581 INFO L462 AbstractCegarLoop]: Abstraction has 30436 states and 114095 transitions. [2019-12-27 16:58:25,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:58:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 30436 states and 114095 transitions. [2019-12-27 16:58:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:58:25,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:25,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:25,593 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1107033684, now seen corresponding path program 1 times [2019-12-27 16:58:25,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:25,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729676991] [2019-12-27 16:58:25,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:25,699 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 16:58:25,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729676991] [2019-12-27 16:58:25,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:25,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:58:25,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1192989641] [2019-12-27 16:58:25,701 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:25,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:25,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 55 transitions. [2019-12-27 16:58:25,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:25,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:58:25,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:58:25,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:58:25,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:25,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:58:25,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:58:25,763 INFO L87 Difference]: Start difference. First operand 30436 states and 114095 transitions. Second operand 7 states. [2019-12-27 16:58:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:26,282 INFO L93 Difference]: Finished difference Result 41148 states and 146720 transitions. [2019-12-27 16:58:26,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:58:26,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 16:58:26,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:26,366 INFO L225 Difference]: With dead ends: 41148 [2019-12-27 16:58:26,366 INFO L226 Difference]: Without dead ends: 39158 [2019-12-27 16:58:26,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:58:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39158 states. [2019-12-27 16:58:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39158 to 24250. [2019-12-27 16:58:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24250 states. [2019-12-27 16:58:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24250 states to 24250 states and 86221 transitions. [2019-12-27 16:58:27,329 INFO L78 Accepts]: Start accepts. Automaton has 24250 states and 86221 transitions. Word has length 22 [2019-12-27 16:58:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:27,329 INFO L462 AbstractCegarLoop]: Abstraction has 24250 states and 86221 transitions. [2019-12-27 16:58:27,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:58:27,330 INFO L276 IsEmpty]: Start isEmpty. Operand 24250 states and 86221 transitions. [2019-12-27 16:58:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 16:58:27,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:27,339 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] [2019-12-27 16:58:27,339 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:27,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash 477352398, now seen corresponding path program 1 times [2019-12-27 16:58:27,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:27,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413873300] [2019-12-27 16:58:27,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:27,398 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 16:58:27,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413873300] [2019-12-27 16:58:27,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:27,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:58:27,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [829298777] [2019-12-27 16:58:27,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:27,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:27,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 81 transitions. [2019-12-27 16:58:27,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:27,414 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:58:27,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:58:27,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:27,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:58:27,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:58:27,416 INFO L87 Difference]: Start difference. First operand 24250 states and 86221 transitions. Second operand 4 states. [2019-12-27 16:58:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:27,580 INFO L93 Difference]: Finished difference Result 34611 states and 119806 transitions. [2019-12-27 16:58:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:58:27,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 16:58:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:27,624 INFO L225 Difference]: With dead ends: 34611 [2019-12-27 16:58:27,625 INFO L226 Difference]: Without dead ends: 21527 [2019-12-27 16:58:27,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 16:58:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21527 states. [2019-12-27 16:58:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21527 to 21244. [2019-12-27 16:58:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21244 states. [2019-12-27 16:58:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21244 states to 21244 states and 75726 transitions. [2019-12-27 16:58:28,409 INFO L78 Accepts]: Start accepts. Automaton has 21244 states and 75726 transitions. Word has length 23 [2019-12-27 16:58:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:28,409 INFO L462 AbstractCegarLoop]: Abstraction has 21244 states and 75726 transitions. [2019-12-27 16:58:28,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:58:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 21244 states and 75726 transitions. [2019-12-27 16:58:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 16:58:28,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:28,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] [2019-12-27 16:58:28,417 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1501725894, now seen corresponding path program 1 times [2019-12-27 16:58:28,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:28,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317740101] [2019-12-27 16:58:28,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:58:28,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317740101] [2019-12-27 16:58:28,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:28,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:58:28,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [951359163] [2019-12-27 16:58:28,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:28,477 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:28,487 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 77 transitions. [2019-12-27 16:58:28,487 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:28,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:58:28,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:58:28,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:28,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:58:28,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:58:28,496 INFO L87 Difference]: Start difference. First operand 21244 states and 75726 transitions. Second operand 4 states. [2019-12-27 16:58:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:28,636 INFO L93 Difference]: Finished difference Result 21244 states and 74724 transitions. [2019-12-27 16:58:28,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:58:28,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 16:58:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:28,680 INFO L225 Difference]: With dead ends: 21244 [2019-12-27 16:58:28,680 INFO L226 Difference]: Without dead ends: 21244 [2019-12-27 16:58:28,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:58:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21244 states. [2019-12-27 16:58:28,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21244 to 20871. [2019-12-27 16:58:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20871 states. [2019-12-27 16:58:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20871 states to 20871 states and 73508 transitions. [2019-12-27 16:58:29,044 INFO L78 Accepts]: Start accepts. Automaton has 20871 states and 73508 transitions. Word has length 23 [2019-12-27 16:58:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:29,044 INFO L462 AbstractCegarLoop]: Abstraction has 20871 states and 73508 transitions. [2019-12-27 16:58:29,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:58:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 20871 states and 73508 transitions. [2019-12-27 16:58:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:58:29,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:29,055 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 16:58:29,055 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:29,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:29,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1161161883, now seen corresponding path program 1 times [2019-12-27 16:58:29,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:29,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039025504] [2019-12-27 16:58:29,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:29,126 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 16:58:29,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039025504] [2019-12-27 16:58:29,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:29,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:58:29,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122283287] [2019-12-27 16:58:29,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:29,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:29,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 74 transitions. [2019-12-27 16:58:29,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:29,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:58:29,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:58:29,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:58:29,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:58:29,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:58:29,184 INFO L87 Difference]: Start difference. First operand 20871 states and 73508 transitions. Second operand 8 states. [2019-12-27 16:58:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:29,514 INFO L93 Difference]: Finished difference Result 13500 states and 42056 transitions. [2019-12-27 16:58:29,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:58:29,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 16:58:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:29,532 INFO L225 Difference]: With dead ends: 13500 [2019-12-27 16:58:29,533 INFO L226 Difference]: Without dead ends: 12183 [2019-12-27 16:58:29,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:58:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12183 states. [2019-12-27 16:58:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12183 to 8268. [2019-12-27 16:58:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8268 states. [2019-12-27 16:58:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 25567 transitions. [2019-12-27 16:58:29,807 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 25567 transitions. Word has length 24 [2019-12-27 16:58:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:29,807 INFO L462 AbstractCegarLoop]: Abstraction has 8268 states and 25567 transitions. [2019-12-27 16:58:29,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:58:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 25567 transitions. [2019-12-27 16:58:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:58:29,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:29,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:29,812 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1743073835, now seen corresponding path program 1 times [2019-12-27 16:58:29,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:29,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571817134] [2019-12-27 16:58:29,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:29,861 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 16:58:29,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571817134] [2019-12-27 16:58:29,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:29,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:58:29,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1604667788] [2019-12-27 16:58:29,862 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:29,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:29,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 62 transitions. [2019-12-27 16:58:29,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:29,878 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:58:29,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:58:29,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:29,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:58:29,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:58:29,879 INFO L87 Difference]: Start difference. First operand 8268 states and 25567 transitions. Second operand 4 states. [2019-12-27 16:58:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:29,948 INFO L93 Difference]: Finished difference Result 12230 states and 37956 transitions. [2019-12-27 16:58:29,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:58:29,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 16:58:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:29,965 INFO L225 Difference]: With dead ends: 12230 [2019-12-27 16:58:29,965 INFO L226 Difference]: Without dead ends: 7682 [2019-12-27 16:58:29,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 16:58:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2019-12-27 16:58:30,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 7209. [2019-12-27 16:58:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-12-27 16:58:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 21269 transitions. [2019-12-27 16:58:30,123 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 21269 transitions. Word has length 25 [2019-12-27 16:58:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:30,123 INFO L462 AbstractCegarLoop]: Abstraction has 7209 states and 21269 transitions. [2019-12-27 16:58:30,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:58:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 21269 transitions. [2019-12-27 16:58:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:58:30,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:30,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:30,127 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:30,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:30,127 INFO L82 PathProgramCache]: Analyzing trace with hash -82285579, now seen corresponding path program 2 times [2019-12-27 16:58:30,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:30,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819399042] [2019-12-27 16:58:30,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:30,232 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 16:58:30,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819399042] [2019-12-27 16:58:30,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:30,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:58:30,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1775064975] [2019-12-27 16:58:30,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:30,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:30,244 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 42 transitions. [2019-12-27 16:58:30,244 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:30,246 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:58:30,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:58:30,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:30,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:58:30,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:58:30,247 INFO L87 Difference]: Start difference. First operand 7209 states and 21269 transitions. Second operand 6 states. [2019-12-27 16:58:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:30,328 INFO L93 Difference]: Finished difference Result 2913 states and 7585 transitions. [2019-12-27 16:58:30,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:58:30,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 16:58:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:30,333 INFO L225 Difference]: With dead ends: 2913 [2019-12-27 16:58:30,333 INFO L226 Difference]: Without dead ends: 2472 [2019-12-27 16:58:30,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:58:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-12-27 16:58:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-12-27 16:58:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-12-27 16:58:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 6301 transitions. [2019-12-27 16:58:30,359 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 6301 transitions. Word has length 25 [2019-12-27 16:58:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:30,359 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 6301 transitions. [2019-12-27 16:58:30,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:58:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 6301 transitions. [2019-12-27 16:58:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:58:30,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:30,362 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] [2019-12-27 16:58:30,362 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:30,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-27 16:58:30,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:30,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300853553] [2019-12-27 16:58:30,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:30,405 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 16:58:30,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300853553] [2019-12-27 16:58:30,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:30,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:58:30,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1682690993] [2019-12-27 16:58:30,406 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:30,412 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:30,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 16:58:30,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:30,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:58:30,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:58:30,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:30,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:58:30,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:58:30,512 INFO L87 Difference]: Start difference. First operand 2472 states and 6301 transitions. Second operand 5 states. [2019-12-27 16:58:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:30,612 INFO L93 Difference]: Finished difference Result 3752 states and 9516 transitions. [2019-12-27 16:58:30,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:30,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 16:58:30,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:30,619 INFO L225 Difference]: With dead ends: 3752 [2019-12-27 16:58:30,619 INFO L226 Difference]: Without dead ends: 3752 [2019-12-27 16:58:30,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:58:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-27 16:58:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2928. [2019-12-27 16:58:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-12-27 16:58:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 7542 transitions. [2019-12-27 16:58:30,669 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 7542 transitions. Word has length 32 [2019-12-27 16:58:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:30,669 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 7542 transitions. [2019-12-27 16:58:30,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:58:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 7542 transitions. [2019-12-27 16:58:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:58:30,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:30,673 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] [2019-12-27 16:58:30,673 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-27 16:58:30,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:30,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452996500] [2019-12-27 16:58:30,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:30,746 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 16:58:30,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452996500] [2019-12-27 16:58:30,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:30,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:58:30,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1166518781] [2019-12-27 16:58:30,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:30,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:30,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 16:58:30,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:30,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:58:30,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:58:30,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:30,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:58:30,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:58:30,874 INFO L87 Difference]: Start difference. First operand 2928 states and 7542 transitions. Second operand 8 states. [2019-12-27 16:58:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:31,314 INFO L93 Difference]: Finished difference Result 5425 states and 13386 transitions. [2019-12-27 16:58:31,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:58:31,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 16:58:31,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:31,322 INFO L225 Difference]: With dead ends: 5425 [2019-12-27 16:58:31,323 INFO L226 Difference]: Without dead ends: 5242 [2019-12-27 16:58:31,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:58:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2019-12-27 16:58:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2952. [2019-12-27 16:58:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-27 16:58:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 7548 transitions. [2019-12-27 16:58:31,386 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 7548 transitions. Word has length 32 [2019-12-27 16:58:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:31,386 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 7548 transitions. [2019-12-27 16:58:31,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:58:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 7548 transitions. [2019-12-27 16:58:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:58:31,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:31,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:31,392 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:31,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:31,392 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-27 16:58:31,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:31,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525031514] [2019-12-27 16:58:31,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:31,471 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 16:58:31,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525031514] [2019-12-27 16:58:31,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:31,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:58:31,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [264253315] [2019-12-27 16:58:31,472 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:31,478 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:31,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 357 transitions. [2019-12-27 16:58:31,575 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:31,638 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:58:31,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:58:31,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:31,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:58:31,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:58:31,640 INFO L87 Difference]: Start difference. First operand 2952 states and 7548 transitions. Second operand 8 states. [2019-12-27 16:58:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:32,093 INFO L93 Difference]: Finished difference Result 5331 states and 12930 transitions. [2019-12-27 16:58:32,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:58:32,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 16:58:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:32,102 INFO L225 Difference]: With dead ends: 5331 [2019-12-27 16:58:32,102 INFO L226 Difference]: Without dead ends: 5133 [2019-12-27 16:58:32,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:58:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2019-12-27 16:58:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 2837. [2019-12-27 16:58:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2019-12-27 16:58:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 7139 transitions. [2019-12-27 16:58:32,160 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 7139 transitions. Word has length 33 [2019-12-27 16:58:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:32,161 INFO L462 AbstractCegarLoop]: Abstraction has 2837 states and 7139 transitions. [2019-12-27 16:58:32,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:58:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 7139 transitions. [2019-12-27 16:58:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:58:32,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:32,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:32,166 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:32,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1104473775, now seen corresponding path program 1 times [2019-12-27 16:58:32,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:32,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577605556] [2019-12-27 16:58:32,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:58:32,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577605556] [2019-12-27 16:58:32,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:32,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:58:32,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249875119] [2019-12-27 16:58:32,272 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:32,278 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:32,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 119 transitions. [2019-12-27 16:58:32,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:32,329 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:58:32,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:58:32,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:32,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:58:32,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:58:32,331 INFO L87 Difference]: Start difference. First operand 2837 states and 7139 transitions. Second operand 8 states. [2019-12-27 16:58:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:32,544 INFO L93 Difference]: Finished difference Result 2177 states and 5525 transitions. [2019-12-27 16:58:32,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:58:32,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 16:58:32,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:32,545 INFO L225 Difference]: With dead ends: 2177 [2019-12-27 16:58:32,545 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 16:58:32,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:58:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 16:58:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 470. [2019-12-27 16:58:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-12-27 16:58:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1059 transitions. [2019-12-27 16:58:32,552 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1059 transitions. Word has length 34 [2019-12-27 16:58:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:32,553 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 1059 transitions. [2019-12-27 16:58:32,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:58:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1059 transitions. [2019-12-27 16:58:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 16:58:32,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:32,554 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] [2019-12-27 16:58:32,554 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 1 times [2019-12-27 16:58:32,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:32,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673528360] [2019-12-27 16:58:32,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:32,632 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 16:58:32,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673528360] [2019-12-27 16:58:32,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:32,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:58:32,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932083063] [2019-12-27 16:58:32,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:32,646 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:32,739 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 269 transitions. [2019-12-27 16:58:32,739 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:32,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:58:32,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:58:32,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:32,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:58:32,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:58:32,742 INFO L87 Difference]: Start difference. First operand 470 states and 1059 transitions. Second operand 7 states. [2019-12-27 16:58:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:32,920 INFO L93 Difference]: Finished difference Result 892 states and 1966 transitions. [2019-12-27 16:58:32,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:58:32,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 16:58:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:32,921 INFO L225 Difference]: With dead ends: 892 [2019-12-27 16:58:32,921 INFO L226 Difference]: Without dead ends: 594 [2019-12-27 16:58:32,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:58:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-27 16:58:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-27 16:58:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 16:58:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-27 16:58:32,928 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-27 16:58:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:32,929 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-27 16:58:32,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:58:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-27 16:58:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 16:58:32,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:32,930 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] [2019-12-27 16:58:32,930 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:32,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:32,931 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 2 times [2019-12-27 16:58:32,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:32,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33840412] [2019-12-27 16:58:32,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:58:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:58:33,035 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:58:33,035 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:58:33,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1053~0.base_71| 4)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_71|)) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 |v_ULTIMATE.start_main_~#t1053~0.offset_43|) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1053~0.base_71|) (= v_~z$read_delayed~0_7 0) (= |v_#NULL.offset_5| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1053~0.base_71| 1) |v_#valid_117|) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1053~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1053~0.base_71|) |v_ULTIMATE.start_main_~#t1053~0.offset_43| 0)) |v_#memory_int_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1053~0.offset=|v_ULTIMATE.start_main_~#t1053~0.offset_43|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t1053~0.base=|v_ULTIMATE.start_main_~#t1053~0.base_71|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_24|, ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_25|, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_36|, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_36|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_68|, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1053~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1053~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1055~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1056~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1054~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1055~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1054~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:58:33,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1054~0.base_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1054~0.base_11| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1054~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1054~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1054~0.base_11|) |v_ULTIMATE.start_main_~#t1054~0.offset_10| 1)) |v_#memory_int_19|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1054~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1054~0.offset=|v_ULTIMATE.start_main_~#t1054~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1054~0.base=|v_ULTIMATE.start_main_~#t1054~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1054~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1054~0.base] because there is no mapped edge [2019-12-27 16:58:33,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1055~0.base_12|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1055~0.base_12|) |v_ULTIMATE.start_main_~#t1055~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t1055~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1055~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1055~0.base_12| 0)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1055~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1055~0.offset=|v_ULTIMATE.start_main_~#t1055~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1055~0.base=|v_ULTIMATE.start_main_~#t1055~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1055~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1055~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 16:58:33,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1056~0.offset_10|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1056~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1056~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1056~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1056~0.base_12|) |v_ULTIMATE.start_main_~#t1056~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1056~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1056~0.offset=|v_ULTIMATE.start_main_~#t1056~0.offset_10|, ULTIMATE.start_main_~#t1056~0.base=|v_ULTIMATE.start_main_~#t1056~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1056~0.offset, ULTIMATE.start_main_~#t1056~0.base] because there is no mapped edge [2019-12-27 16:58:33,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~a~0_Out-1361627777 ~__unbuffered_p3_EAX~0_Out-1361627777) (= ~z$r_buff0_thd1~0_In-1361627777 ~z$r_buff1_thd1~0_Out-1361627777) (= ~z$r_buff1_thd2~0_Out-1361627777 ~z$r_buff0_thd2~0_In-1361627777) (= ~z$r_buff1_thd4~0_Out-1361627777 ~z$r_buff0_thd4~0_In-1361627777) (= ~z$r_buff1_thd3~0_Out-1361627777 ~z$r_buff0_thd3~0_In-1361627777) (= 1 ~a~0_Out-1361627777) (= 1 ~z$r_buff0_thd4~0_Out-1361627777) (= ~z$r_buff0_thd0~0_In-1361627777 ~z$r_buff1_thd0~0_Out-1361627777) (= ~b~0_In-1361627777 ~__unbuffered_p3_EBX~0_Out-1361627777) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1361627777))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1361627777, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1361627777, ~b~0=~b~0_In-1361627777, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1361627777, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1361627777, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1361627777, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1361627777} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1361627777, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1361627777, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1361627777, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1361627777, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1361627777, ~a~0=~a~0_Out-1361627777, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1361627777, ~b~0=~b~0_In-1361627777, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1361627777, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1361627777, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1361627777, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1361627777, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1361627777, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1361627777, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1361627777} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 16:58:33,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 16:58:33,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~y~0_18 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 16:58:33,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1894754137 256)))) (or (and (not .cse0) (= ~z$w_buff0~0_In-1894754137 |P2Thread1of1ForFork1_#t~ite9_Out-1894754137|) (= |P2Thread1of1ForFork1_#t~ite8_In-1894754137| |P2Thread1of1ForFork1_#t~ite8_Out-1894754137|)) (and (= |P2Thread1of1ForFork1_#t~ite8_Out-1894754137| ~z$w_buff0~0_In-1894754137) (= |P2Thread1of1ForFork1_#t~ite8_Out-1894754137| |P2Thread1of1ForFork1_#t~ite9_Out-1894754137|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1894754137 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1894754137 256))) (and (= (mod ~z$r_buff1_thd3~0_In-1894754137 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1894754137 256))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1894754137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1894754137, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1894754137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1894754137, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1894754137, ~weak$$choice2~0=~weak$$choice2~0_In-1894754137, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1894754137|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1894754137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1894754137, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1894754137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1894754137, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1894754137, ~weak$$choice2~0=~weak$$choice2~0_In-1894754137, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1894754137|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1894754137|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:58:33,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1787068669 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite12_Out1787068669| ~z$w_buff1~0_In1787068669) (= |P2Thread1of1ForFork1_#t~ite11_In1787068669| |P2Thread1of1ForFork1_#t~ite11_Out1787068669|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite11_Out1787068669| |P2Thread1of1ForFork1_#t~ite12_Out1787068669|) .cse0 (= |P2Thread1of1ForFork1_#t~ite11_Out1787068669| ~z$w_buff1~0_In1787068669) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1787068669 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1787068669 256)) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1787068669 256))) (= 0 (mod ~z$w_buff0_used~0_In1787068669 256))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1787068669, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1787068669, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1787068669|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1787068669, ~z$w_buff1~0=~z$w_buff1~0_In1787068669, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1787068669, ~weak$$choice2~0=~weak$$choice2~0_In1787068669} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1787068669, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1787068669|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1787068669, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1787068669|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1787068669, ~z$w_buff1~0=~z$w_buff1~0_In1787068669, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1787068669, ~weak$$choice2~0=~weak$$choice2~0_In1787068669} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 16:58:33,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In952607722 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite15_Out952607722| ~z$w_buff0_used~0_In952607722) (= |P2Thread1of1ForFork1_#t~ite14_In952607722| |P2Thread1of1ForFork1_#t~ite14_Out952607722|)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out952607722| ~z$w_buff0_used~0_In952607722) (= |P2Thread1of1ForFork1_#t~ite15_Out952607722| |P2Thread1of1ForFork1_#t~ite14_Out952607722|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In952607722 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In952607722 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In952607722 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In952607722 256))))))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In952607722|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In952607722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In952607722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952607722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In952607722, ~weak$$choice2~0=~weak$$choice2~0_In952607722} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out952607722|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out952607722|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In952607722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In952607722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952607722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In952607722, ~weak$$choice2~0=~weak$$choice2~0_In952607722} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 16:58:33,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 16:58:33,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1614983613 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1614983613 256)))) (or (= (mod ~z$w_buff0_used~0_In1614983613 256) 0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1614983613 256))) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In1614983613 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite23_Out1614983613| |P2Thread1of1ForFork1_#t~ite24_Out1614983613|) (= |P2Thread1of1ForFork1_#t~ite23_Out1614983613| ~z$r_buff1_thd3~0_In1614983613) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite23_In1614983613| |P2Thread1of1ForFork1_#t~ite23_Out1614983613|) (= |P2Thread1of1ForFork1_#t~ite24_Out1614983613| ~z$r_buff1_thd3~0_In1614983613)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1614983613, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1614983613, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In1614983613|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1614983613, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1614983613, ~weak$$choice2~0=~weak$$choice2~0_In1614983613} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out1614983613|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1614983613, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1614983613, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out1614983613|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1614983613, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1614983613, ~weak$$choice2~0=~weak$$choice2~0_In1614983613} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 16:58:33,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:58:33,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1885114944 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1885114944 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1885114944 |P3Thread1of1ForFork2_#t~ite28_Out1885114944|)) (and (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out1885114944|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1885114944, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1885114944} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1885114944|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1885114944, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1885114944} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 16:58:33,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1483276623 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1483276623 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1483276623 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1483276623 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite29_Out1483276623| ~z$w_buff1_used~0_In1483276623)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite29_Out1483276623|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1483276623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1483276623, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1483276623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1483276623} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1483276623|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1483276623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1483276623, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1483276623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1483276623} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 16:58:33,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1865766546 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1865766546 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1865766546 ~z$r_buff0_thd4~0_In1865766546)) (and (= 0 ~z$r_buff0_thd4~0_Out1865766546) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1865766546, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1865766546} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1865766546, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1865766546, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out1865766546|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 16:58:33,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In797897995 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In797897995 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In797897995 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In797897995 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In797897995 |P3Thread1of1ForFork2_#t~ite31_Out797897995|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out797897995|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In797897995, ~z$w_buff0_used~0=~z$w_buff0_used~0_In797897995, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In797897995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In797897995} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In797897995, ~z$w_buff0_used~0=~z$w_buff0_used~0_In797897995, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In797897995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In797897995, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out797897995|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 16:58:33,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 16:58:33,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 16:58:33,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-1345355438| |ULTIMATE.start_main_#t~ite36_Out-1345355438|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1345355438 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1345355438 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1345355438 |ULTIMATE.start_main_#t~ite36_Out-1345355438|) .cse2) (and (= ~z~0_In-1345355438 |ULTIMATE.start_main_#t~ite36_Out-1345355438|) .cse2 (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1345355438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1345355438, ~z$w_buff1~0=~z$w_buff1~0_In-1345355438, ~z~0=~z~0_In-1345355438} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1345355438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1345355438, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1345355438|, ~z$w_buff1~0=~z$w_buff1~0_In-1345355438, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1345355438|, ~z~0=~z~0_In-1345355438} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 16:58:33,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-993103246 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-993103246 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-993103246|)) (and (= ~z$w_buff0_used~0_In-993103246 |ULTIMATE.start_main_#t~ite38_Out-993103246|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-993103246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-993103246} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-993103246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-993103246, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-993103246|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 16:58:33,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1539414206 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1539414206 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1539414206 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1539414206 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1539414206 |ULTIMATE.start_main_#t~ite39_Out-1539414206|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1539414206|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1539414206, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1539414206, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1539414206, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1539414206} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1539414206, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1539414206|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1539414206, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1539414206, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1539414206} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 16:58:33,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1876966623 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1876966623 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1876966623 |ULTIMATE.start_main_#t~ite40_Out-1876966623|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1876966623| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1876966623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1876966623} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1876966623, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1876966623|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1876966623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:58:33,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In476425649 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In476425649 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In476425649 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In476425649 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In476425649 |ULTIMATE.start_main_#t~ite41_Out476425649|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite41_Out476425649|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In476425649, ~z$w_buff0_used~0=~z$w_buff0_used~0_In476425649, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In476425649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In476425649} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out476425649|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In476425649, ~z$w_buff0_used~0=~z$w_buff0_used~0_In476425649, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In476425649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In476425649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 16:58:33,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:58:33,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:58:33 BasicIcfg [2019-12-27 16:58:33,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:58:33,174 INFO L168 Benchmark]: Toolchain (without parser) took 31932.38 ms. Allocated memory was 145.8 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 101.6 MB in the beginning and 733.3 MB in the end (delta: -631.7 MB). Peak memory consumption was 899.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:58:33,175 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 16:58:33,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.16 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 154.7 MB in the end (delta: -53.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:58:33,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.92 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:58:33,177 INFO L168 Benchmark]: Boogie Preprocessor took 38.73 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 150.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:58:33,177 INFO L168 Benchmark]: RCFGBuilder took 803.82 ms. Allocated memory is still 203.4 MB. Free memory was 150.0 MB in the beginning and 104.4 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:58:33,178 INFO L168 Benchmark]: TraceAbstraction took 30259.02 ms. Allocated memory was 203.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 103.5 MB in the beginning and 733.3 MB in the end (delta: -629.8 MB). Peak memory consumption was 844.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:58:33,181 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.19 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.16 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 154.7 MB in the end (delta: -53.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.92 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.73 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 150.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 803.82 ms. Allocated memory is still 203.4 MB. Free memory was 150.0 MB in the beginning and 104.4 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30259.02 ms. Allocated memory was 203.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 103.5 MB in the beginning and 733.3 MB in the end (delta: -629.8 MB). Peak memory consumption was 844.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1053, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1054, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1055, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1056, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1879 SDtfs, 3595 SDslu, 3360 SDs, 0 SdLazy, 1330 SolverSat, 275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31012occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 34390 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 29896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...