/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:33:20,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:33:20,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:33:20,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:33:20,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:33:20,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:33:20,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:33:20,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:33:20,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:33:20,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:33:20,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:33:20,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:33:20,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:33:20,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:33:20,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:33:20,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:33:20,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:33:20,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:33:20,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:33:20,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:33:20,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:33:20,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:33:20,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:33:20,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:33:20,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:33:20,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:33:20,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:33:20,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:33:20,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:33:20,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:33:20,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:33:20,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:33:20,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:33:20,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:33:20,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:33:20,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:33:20,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:33:20,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:33:20,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:33:20,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:33:20,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:33:20,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:33:20,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:33:20,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:33:20,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:33:20,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:33:20,981 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:33:20,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:33:20,981 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:33:20,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:33:20,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:33:20,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:33:20,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:33:20,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:33:20,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:33:20,983 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:33:20,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:33:20,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:33:20,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:33:20,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:33:20,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:33:20,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:33:20,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:33:20,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:33:20,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:33:20,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:33:20,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:33:20,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:33:20,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:33:20,985 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:33:20,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:33:20,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:33:21,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:33:21,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:33:21,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:33:21,273 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:33:21,273 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:33:21,274 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2019-12-18 21:33:21,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcc019a21/2cb97183d8724f4cad15718e18d467a5/FLAG4c4a03f79 [2019-12-18 21:33:21,894 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:33:21,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2019-12-18 21:33:21,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcc019a21/2cb97183d8724f4cad15718e18d467a5/FLAG4c4a03f79 [2019-12-18 21:33:22,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcc019a21/2cb97183d8724f4cad15718e18d467a5 [2019-12-18 21:33:22,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:33:22,188 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:33:22,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:33:22,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:33:22,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:33:22,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:33:22" (1/1) ... [2019-12-18 21:33:22,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8bbf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:22, skipping insertion in model container [2019-12-18 21:33:22,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:33:22" (1/1) ... [2019-12-18 21:33:22,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:33:22,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:33:22,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:33:22,909 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:33:22,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:33:23,070 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:33:23,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23 WrapperNode [2019-12-18 21:33:23,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:33:23,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:33:23,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:33:23,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:33:23,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (1/1) ... [2019-12-18 21:33:23,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (1/1) ... [2019-12-18 21:33:23,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:33:23,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:33:23,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:33:23,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:33:23,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (1/1) ... [2019-12-18 21:33:23,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (1/1) ... [2019-12-18 21:33:23,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (1/1) ... [2019-12-18 21:33:23,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (1/1) ... [2019-12-18 21:33:23,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (1/1) ... [2019-12-18 21:33:23,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (1/1) ... [2019-12-18 21:33:23,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (1/1) ... [2019-12-18 21:33:23,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:33:23,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:33:23,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:33:23,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:33:23,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:33:23,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:33:23,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:33:23,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:33:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:33:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:33:23,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:33:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:33:23,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:33:23,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:33:23,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:33:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:33:23,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:33:23,261 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:33:24,013 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:33:24,014 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:33:24,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:33:24 BoogieIcfgContainer [2019-12-18 21:33:24,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:33:24,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:33:24,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:33:24,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:33:24,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:33:22" (1/3) ... [2019-12-18 21:33:24,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf2682c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:33:24, skipping insertion in model container [2019-12-18 21:33:24,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:33:23" (2/3) ... [2019-12-18 21:33:24,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf2682c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:33:24, skipping insertion in model container [2019-12-18 21:33:24,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:33:24" (3/3) ... [2019-12-18 21:33:24,024 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_tso.opt.i [2019-12-18 21:33:24,035 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:33:24,035 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:33:24,043 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:33:24,044 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:33:24,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,096 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,097 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,129 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,129 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,129 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,129 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,129 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,130 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,130 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,130 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,130 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,130 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,131 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,131 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,132 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,132 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,132 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,132 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,132 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,133 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,133 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,133 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,134 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,134 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,134 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,134 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,134 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,135 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,135 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,135 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,135 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,136 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,136 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,136 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,137 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,141 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,141 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,150 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,150 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,153 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,153 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,155 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,155 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,155 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,155 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,155 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:33:24,171 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:33:24,193 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:33:24,193 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:33:24,194 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:33:24,194 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:33:24,194 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:33:24,194 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:33:24,194 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:33:24,194 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:33:24,218 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 21:33:24,220 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 21:33:24,325 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 21:33:24,325 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:33:24,341 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:33:24,365 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 21:33:24,413 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 21:33:24,414 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:33:24,421 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:33:24,440 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:33:24,441 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:33:27,971 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 21:33:28,134 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 21:33:28,154 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-18 21:33:28,154 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 21:33:28,157 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-18 21:33:31,342 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-18 21:33:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-18 21:33:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:33:31,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:31,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:31,352 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:31,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:31,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-18 21:33:31,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:31,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143321346] [2019-12-18 21:33:31,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:31,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-18 21:33:31,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143321346] [2019-12-18 21:33:31,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:31,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:33:31,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746828054] [2019-12-18 21:33:31,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:33:31,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:31,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:33:31,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:31,725 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-18 21:33:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:32,619 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-18 21:33:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:33:32,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:33:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:32,968 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 21:33:32,968 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 21:33:32,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 21:33:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 21:33:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 21:33:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-18 21:33:35,186 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-18 21:33:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:35,187 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-18 21:33:35,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:33:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-18 21:33:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:33:35,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:35,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:35,204 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:35,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-18 21:33:35,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:35,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721099098] [2019-12-18 21:33:35,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:35,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721099098] [2019-12-18 21:33:35,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:35,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:33:35,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576672099] [2019-12-18 21:33:35,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:33:35,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:35,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:33:35,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:33:35,320 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 4 states. [2019-12-18 21:33:37,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:37,873 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-18 21:33:37,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:33:37,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:33:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:38,298 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 21:33:38,298 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 21:33:38,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:33:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 21:33:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-18 21:33:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-18 21:33:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-18 21:33:40,481 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-18 21:33:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:40,481 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-18 21:33:40,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:33:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-18 21:33:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:33:40,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:40,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:40,485 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:40,485 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-18 21:33:40,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:40,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557918203] [2019-12-18 21:33:40,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:40,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557918203] [2019-12-18 21:33:40,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:40,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:33:40,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122851136] [2019-12-18 21:33:40,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:33:40,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:40,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:33:40,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:40,550 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-18 21:33:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:40,720 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-18 21:33:40,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:33:40,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:33:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:42,871 INFO L225 Difference]: With dead ends: 39280 [2019-12-18 21:33:42,871 INFO L226 Difference]: Without dead ends: 39280 [2019-12-18 21:33:42,872 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-18 21:33:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-18 21:33:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-18 21:33:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-18 21:33:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-18 21:33:44,031 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-18 21:33:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:44,031 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-18 21:33:44,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:33:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-18 21:33:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:33:44,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:44,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:44,035 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:44,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:44,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-18 21:33:44,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:44,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839496455] [2019-12-18 21:33:44,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:44,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839496455] [2019-12-18 21:33:44,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:44,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:33:44,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317839619] [2019-12-18 21:33:44,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:33:44,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:44,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:33:44,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:33:44,101 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-18 21:33:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:44,174 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-18 21:33:44,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:33:44,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:33:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:44,199 INFO L225 Difference]: With dead ends: 16344 [2019-12-18 21:33:44,200 INFO L226 Difference]: Without dead ends: 16344 [2019-12-18 21:33:44,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:33:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-18 21:33:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-18 21:33:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-18 21:33:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-18 21:33:44,479 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-18 21:33:44,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:44,479 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-18 21:33:44,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:33:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-18 21:33:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:33:44,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:44,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:44,482 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:44,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-18 21:33:44,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:44,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153191246] [2019-12-18 21:33:44,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:44,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153191246] [2019-12-18 21:33:44,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:44,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:33:44,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885202002] [2019-12-18 21:33:44,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:33:44,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:44,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:33:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:33:44,550 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 5 states. [2019-12-18 21:33:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:44,602 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-18 21:33:44,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:33:44,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:33:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:44,607 INFO L225 Difference]: With dead ends: 2799 [2019-12-18 21:33:44,607 INFO L226 Difference]: Without dead ends: 2799 [2019-12-18 21:33:44,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:33:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-18 21:33:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-18 21:33:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-18 21:33:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-18 21:33:44,650 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-18 21:33:44,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:44,650 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-18 21:33:44,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:33:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-18 21:33:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:33:44,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:44,655 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] [2019-12-18 21:33:44,656 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-18 21:33:44,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:44,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147390228] [2019-12-18 21:33:44,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:44,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147390228] [2019-12-18 21:33:44,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:44,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:33:44,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668203672] [2019-12-18 21:33:44,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:33:44,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:33:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:33:44,753 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 6 states. [2019-12-18 21:33:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:44,808 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-18 21:33:44,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:33:44,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:33:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:44,812 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 21:33:44,812 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 21:33:44,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:33:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 21:33:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 21:33:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 21:33:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-18 21:33:44,829 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-18 21:33:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:44,830 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-18 21:33:44,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:33:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-18 21:33:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:33:44,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:44,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:44,833 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:44,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:44,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-18 21:33:44,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:44,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839381222] [2019-12-18 21:33:44,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:44,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839381222] [2019-12-18 21:33:44,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:44,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:33:44,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287553850] [2019-12-18 21:33:44,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:33:44,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:33:44,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:44,945 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-18 21:33:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:44,987 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-18 21:33:44,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:33:44,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:33:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:44,991 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 21:33:44,991 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 21:33:44,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 21:33:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 21:33:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 21:33:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-18 21:33:45,007 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-18 21:33:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:45,008 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-18 21:33:45,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:33:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-18 21:33:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:33:45,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:45,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:45,013 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:45,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-18 21:33:45,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:45,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098977261] [2019-12-18 21:33:45,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:45,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098977261] [2019-12-18 21:33:45,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:45,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:33:45,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532649391] [2019-12-18 21:33:45,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:33:45,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:45,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:33:45,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:33:45,181 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-18 21:33:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:45,411 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-18 21:33:45,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:33:45,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:33:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:45,415 INFO L225 Difference]: With dead ends: 1763 [2019-12-18 21:33:45,415 INFO L226 Difference]: Without dead ends: 1763 [2019-12-18 21:33:45,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:33:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-18 21:33:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-18 21:33:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-18 21:33:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-18 21:33:45,441 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-18 21:33:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:45,442 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-18 21:33:45,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:33:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-18 21:33:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:33:45,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:45,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:45,448 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-18 21:33:45,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:45,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350003115] [2019-12-18 21:33:45,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:45,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350003115] [2019-12-18 21:33:45,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:45,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:33:45,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884932954] [2019-12-18 21:33:45,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:33:45,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:45,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:33:45,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:33:45,589 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 6 states. [2019-12-18 21:33:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:45,956 INFO L93 Difference]: Finished difference Result 2369 states and 6739 transitions. [2019-12-18 21:33:45,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:33:45,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:33:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:45,961 INFO L225 Difference]: With dead ends: 2369 [2019-12-18 21:33:45,961 INFO L226 Difference]: Without dead ends: 2369 [2019-12-18 21:33:45,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:33:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-12-18 21:33:45,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1502. [2019-12-18 21:33:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-18 21:33:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-18 21:33:45,990 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-18 21:33:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:45,990 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-18 21:33:45,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:33:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-18 21:33:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:33:45,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:45,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:45,995 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:45,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:45,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-18 21:33:45,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:45,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427364792] [2019-12-18 21:33:45,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:46,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427364792] [2019-12-18 21:33:46,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:46,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:33:46,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897420298] [2019-12-18 21:33:46,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:33:46,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:46,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:33:46,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:33:46,116 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 6 states. [2019-12-18 21:33:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:46,448 INFO L93 Difference]: Finished difference Result 2376 states and 6757 transitions. [2019-12-18 21:33:46,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:33:46,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:33:46,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:46,453 INFO L225 Difference]: With dead ends: 2376 [2019-12-18 21:33:46,453 INFO L226 Difference]: Without dead ends: 2376 [2019-12-18 21:33:46,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:33:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-18 21:33:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1690. [2019-12-18 21:33:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-18 21:33:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4865 transitions. [2019-12-18 21:33:46,483 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4865 transitions. Word has length 58 [2019-12-18 21:33:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:46,483 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4865 transitions. [2019-12-18 21:33:46,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:33:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4865 transitions. [2019-12-18 21:33:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:33:46,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:46,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:46,487 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash 361631606, now seen corresponding path program 4 times [2019-12-18 21:33:46,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:46,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237098675] [2019-12-18 21:33:46,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:46,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237098675] [2019-12-18 21:33:46,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:46,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:33:46,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036182905] [2019-12-18 21:33:46,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:33:46,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:46,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:33:46,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:33:46,649 INFO L87 Difference]: Start difference. First operand 1690 states and 4865 transitions. Second operand 7 states. [2019-12-18 21:33:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:46,789 INFO L93 Difference]: Finished difference Result 3388 states and 9129 transitions. [2019-12-18 21:33:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:33:46,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 21:33:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:46,794 INFO L225 Difference]: With dead ends: 3388 [2019-12-18 21:33:46,795 INFO L226 Difference]: Without dead ends: 2436 [2019-12-18 21:33:46,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:33:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2019-12-18 21:33:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1544. [2019-12-18 21:33:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-12-18 21:33:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 4371 transitions. [2019-12-18 21:33:46,828 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 4371 transitions. Word has length 58 [2019-12-18 21:33:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:46,829 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 4371 transitions. [2019-12-18 21:33:46,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:33:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 4371 transitions. [2019-12-18 21:33:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:33:46,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:46,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:46,833 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2125865736, now seen corresponding path program 5 times [2019-12-18 21:33:46,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:46,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780569899] [2019-12-18 21:33:46,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:46,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780569899] [2019-12-18 21:33:46,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:46,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:33:46,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056634030] [2019-12-18 21:33:46,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:33:46,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:33:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:33:46,938 INFO L87 Difference]: Start difference. First operand 1544 states and 4371 transitions. Second operand 7 states. [2019-12-18 21:33:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:47,364 INFO L93 Difference]: Finished difference Result 2473 states and 6950 transitions. [2019-12-18 21:33:47,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:33:47,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 21:33:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:47,369 INFO L225 Difference]: With dead ends: 2473 [2019-12-18 21:33:47,369 INFO L226 Difference]: Without dead ends: 2473 [2019-12-18 21:33:47,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:33:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2019-12-18 21:33:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 1476. [2019-12-18 21:33:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-12-18 21:33:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 4177 transitions. [2019-12-18 21:33:47,398 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 4177 transitions. Word has length 58 [2019-12-18 21:33:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:47,399 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 4177 transitions. [2019-12-18 21:33:47,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:33:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 4177 transitions. [2019-12-18 21:33:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:33:47,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:47,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:47,403 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2124049444, now seen corresponding path program 1 times [2019-12-18 21:33:47,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:47,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66538301] [2019-12-18 21:33:47,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:47,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66538301] [2019-12-18 21:33:47,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:47,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:33:47,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300892559] [2019-12-18 21:33:47,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:33:47,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:47,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:33:47,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:47,480 INFO L87 Difference]: Start difference. First operand 1476 states and 4177 transitions. Second operand 3 states. [2019-12-18 21:33:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:47,520 INFO L93 Difference]: Finished difference Result 1475 states and 4175 transitions. [2019-12-18 21:33:47,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:33:47,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:33:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:47,522 INFO L225 Difference]: With dead ends: 1475 [2019-12-18 21:33:47,522 INFO L226 Difference]: Without dead ends: 1475 [2019-12-18 21:33:47,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:47,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-12-18 21:33:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 950. [2019-12-18 21:33:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-18 21:33:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2693 transitions. [2019-12-18 21:33:47,540 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2693 transitions. Word has length 59 [2019-12-18 21:33:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:47,541 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2693 transitions. [2019-12-18 21:33:47,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:33:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2693 transitions. [2019-12-18 21:33:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:33:47,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:47,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:47,544 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:47,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:47,544 INFO L82 PathProgramCache]: Analyzing trace with hash -916388173, now seen corresponding path program 1 times [2019-12-18 21:33:47,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:47,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183827040] [2019-12-18 21:33:47,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:47,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183827040] [2019-12-18 21:33:47,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:47,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:33:47,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735819952] [2019-12-18 21:33:47,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:33:47,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:33:47,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:33:47,799 INFO L87 Difference]: Start difference. First operand 950 states and 2693 transitions. Second operand 13 states. [2019-12-18 21:33:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:48,788 INFO L93 Difference]: Finished difference Result 2268 states and 5805 transitions. [2019-12-18 21:33:48,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:33:48,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-18 21:33:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:48,791 INFO L225 Difference]: With dead ends: 2268 [2019-12-18 21:33:48,791 INFO L226 Difference]: Without dead ends: 981 [2019-12-18 21:33:48,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:33:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-12-18 21:33:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 693. [2019-12-18 21:33:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-12-18 21:33:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1734 transitions. [2019-12-18 21:33:48,801 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1734 transitions. Word has length 59 [2019-12-18 21:33:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:48,801 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 1734 transitions. [2019-12-18 21:33:48,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:33:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1734 transitions. [2019-12-18 21:33:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:33:48,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:48,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:48,802 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:48,803 INFO L82 PathProgramCache]: Analyzing trace with hash -983573057, now seen corresponding path program 2 times [2019-12-18 21:33:48,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:48,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543275738] [2019-12-18 21:33:48,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:48,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543275738] [2019-12-18 21:33:48,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:48,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:33:48,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467432881] [2019-12-18 21:33:48,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:33:48,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:48,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:33:48,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:33:48,948 INFO L87 Difference]: Start difference. First operand 693 states and 1734 transitions. Second operand 6 states. [2019-12-18 21:33:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:49,032 INFO L93 Difference]: Finished difference Result 1063 states and 2589 transitions. [2019-12-18 21:33:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:33:49,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 21:33:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:49,034 INFO L225 Difference]: With dead ends: 1063 [2019-12-18 21:33:49,034 INFO L226 Difference]: Without dead ends: 329 [2019-12-18 21:33:49,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:33:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-18 21:33:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 289. [2019-12-18 21:33:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-12-18 21:33:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 536 transitions. [2019-12-18 21:33:49,042 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 536 transitions. Word has length 59 [2019-12-18 21:33:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:49,042 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 536 transitions. [2019-12-18 21:33:49,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:33:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 536 transitions. [2019-12-18 21:33:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:33:49,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:49,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:49,044 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:49,044 INFO L82 PathProgramCache]: Analyzing trace with hash 851087049, now seen corresponding path program 3 times [2019-12-18 21:33:49,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:49,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106489925] [2019-12-18 21:33:49,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:49,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106489925] [2019-12-18 21:33:49,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:49,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:33:49,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383506551] [2019-12-18 21:33:49,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:33:49,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:33:49,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:49,164 INFO L87 Difference]: Start difference. First operand 289 states and 536 transitions. Second operand 3 states. [2019-12-18 21:33:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:49,176 INFO L93 Difference]: Finished difference Result 268 states and 479 transitions. [2019-12-18 21:33:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:33:49,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:33:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:49,177 INFO L225 Difference]: With dead ends: 268 [2019-12-18 21:33:49,177 INFO L226 Difference]: Without dead ends: 268 [2019-12-18 21:33:49,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-18 21:33:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 236. [2019-12-18 21:33:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-18 21:33:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-18 21:33:49,182 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 59 [2019-12-18 21:33:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:49,182 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-18 21:33:49,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:33:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-18 21:33:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:33:49,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:49,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:49,184 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:49,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:49,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 1 times [2019-12-18 21:33:49,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:49,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816815701] [2019-12-18 21:33:49,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:49,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816815701] [2019-12-18 21:33:49,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:49,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:33:49,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707333558] [2019-12-18 21:33:49,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:33:49,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:33:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:33:49,488 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 15 states. [2019-12-18 21:33:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:50,149 INFO L93 Difference]: Finished difference Result 409 states and 709 transitions. [2019-12-18 21:33:50,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:33:50,149 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-18 21:33:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:50,150 INFO L225 Difference]: With dead ends: 409 [2019-12-18 21:33:50,150 INFO L226 Difference]: Without dead ends: 378 [2019-12-18 21:33:50,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:33:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-12-18 21:33:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 336. [2019-12-18 21:33:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-18 21:33:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 590 transitions. [2019-12-18 21:33:50,158 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 590 transitions. Word has length 60 [2019-12-18 21:33:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:50,159 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 590 transitions. [2019-12-18 21:33:50,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:33:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 590 transitions. [2019-12-18 21:33:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:33:50,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:50,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:50,161 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:50,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1131398243, now seen corresponding path program 2 times [2019-12-18 21:33:50,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:50,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990595629] [2019-12-18 21:33:50,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:50,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990595629] [2019-12-18 21:33:50,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:50,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:33:50,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307461659] [2019-12-18 21:33:50,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:33:50,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:50,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:33:50,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:33:50,419 INFO L87 Difference]: Start difference. First operand 336 states and 590 transitions. Second operand 12 states. [2019-12-18 21:33:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:50,782 INFO L93 Difference]: Finished difference Result 437 states and 745 transitions. [2019-12-18 21:33:50,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:33:50,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 21:33:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:50,784 INFO L225 Difference]: With dead ends: 437 [2019-12-18 21:33:50,784 INFO L226 Difference]: Without dead ends: 406 [2019-12-18 21:33:50,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:33:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-18 21:33:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 344. [2019-12-18 21:33:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 21:33:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-18 21:33:50,791 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-18 21:33:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:50,791 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-18 21:33:50,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:33:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-18 21:33:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:33:50,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:50,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:50,793 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 3 times [2019-12-18 21:33:50,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:50,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979730921] [2019-12-18 21:33:50,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:33:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:33:50,983 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:33:50,983 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:33:50,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= 0 v_~a~0_9) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff1_thd4~0_16) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t1245~0.offset_16|) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1245~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1245~0.base_19|) |v_ULTIMATE.start_main_~#t1245~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (= 0 v_~weak$$choice2~0_33) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1245~0.base_19| 4)) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 |v_#NULL.base_7|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1245~0.base_19|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1245~0.base_19| 1)) (= v_~y~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1245~0.base_19|) 0) (= 0 v_~z$w_buff0~0_25) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~a~0=v_~a~0_9, ULTIMATE.start_main_~#t1246~0.offset=|v_ULTIMATE.start_main_~#t1246~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ULTIMATE.start_main_~#t1246~0.base=|v_ULTIMATE.start_main_~#t1246~0.base_22|, ULTIMATE.start_main_~#t1247~0.base=|v_ULTIMATE.start_main_~#t1247~0.base_21|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ULTIMATE.start_main_~#t1245~0.offset=|v_ULTIMATE.start_main_~#t1245~0.offset_16|, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t1245~0.base=|v_ULTIMATE.start_main_~#t1245~0.base_19|, ULTIMATE.start_main_~#t1248~0.base=|v_ULTIMATE.start_main_~#t1248~0.base_22|, ULTIMATE.start_main_~#t1247~0.offset=|v_ULTIMATE.start_main_~#t1247~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t1248~0.offset=|v_ULTIMATE.start_main_~#t1248~0.offset_17|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ULTIMATE.start_main_~#t1246~0.offset, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1246~0.base, ULTIMATE.start_main_~#t1247~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1245~0.offset, ~x~0, ULTIMATE.start_main_~#t1245~0.base, ULTIMATE.start_main_~#t1248~0.base, ULTIMATE.start_main_~#t1247~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1248~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:33:50,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1246~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1246~0.base_13|)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1246~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1246~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1246~0.base_13| 4) |v_#length_23|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1246~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1246~0.base_13|) |v_ULTIMATE.start_main_~#t1246~0.offset_11| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1246~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1246~0.offset=|v_ULTIMATE.start_main_~#t1246~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1246~0.base=|v_ULTIMATE.start_main_~#t1246~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1246~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1246~0.base] because there is no mapped edge [2019-12-18 21:33:50,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1247~0.base_12| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t1247~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1247~0.offset_10| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1247~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1247~0.base_12|) |v_ULTIMATE.start_main_~#t1247~0.offset_10| 2)) |v_#memory_int_17|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1247~0.base_12|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1247~0.base_12|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1247~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1247~0.offset=|v_ULTIMATE.start_main_~#t1247~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1247~0.base=|v_ULTIMATE.start_main_~#t1247~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1247~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1247~0.base] because there is no mapped edge [2019-12-18 21:33:50,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1248~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1248~0.base_12| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1248~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1248~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1248~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1248~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1248~0.base_12|) |v_ULTIMATE.start_main_~#t1248~0.offset_10| 3)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1248~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1248~0.base=|v_ULTIMATE.start_main_~#t1248~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1248~0.offset=|v_ULTIMATE.start_main_~#t1248~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1248~0.base, ULTIMATE.start_main_~#t1248~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 21:33:50,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} 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-18 21:33:50,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:33:50,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 1 v_~y~0_6) (= 1 v_~x~0_7) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_6, ~x~0=v_~x~0_7, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:33:51,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1963411235 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1963411235 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1963411235| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1963411235| ~z$w_buff0_used~0_In-1963411235)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1963411235, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1963411235} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1963411235, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1963411235, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1963411235|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:33:51,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-391852053 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-391852053 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out-391852053| ~z$w_buff1~0_In-391852053) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In-391852053 |P2Thread1of1ForFork2_#t~ite3_Out-391852053|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-391852053, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-391852053, ~z$w_buff1~0=~z$w_buff1~0_In-391852053, ~z~0=~z~0_In-391852053} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-391852053|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-391852053, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-391852053, ~z$w_buff1~0=~z$w_buff1~0_In-391852053, ~z~0=~z~0_In-391852053} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:33:51,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2131407437 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2131407437 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2131407437 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In2131407437 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out2131407437|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In2131407437 |P3Thread1of1ForFork3_#t~ite12_Out2131407437|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2131407437, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2131407437, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2131407437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2131407437} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2131407437, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2131407437, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2131407437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2131407437, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out2131407437|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:33:51,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In837052878 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In837052878 256)))) (or (and (= ~z$r_buff0_thd4~0_Out837052878 ~z$r_buff0_thd4~0_In837052878) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out837052878 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In837052878, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In837052878} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In837052878, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out837052878, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out837052878|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:33:51,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2050067730 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-2050067730 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2050067730 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-2050067730 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-2050067730 |P3Thread1of1ForFork3_#t~ite14_Out-2050067730|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P3Thread1of1ForFork3_#t~ite14_Out-2050067730| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2050067730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2050067730, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2050067730, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2050067730} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2050067730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2050067730, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-2050067730|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2050067730, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2050067730} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:33:51,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:33:51,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:33:51,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-475237708 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-475237708 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-475237708|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-475237708 |P2Thread1of1ForFork2_#t~ite5_Out-475237708|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-475237708, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-475237708} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-475237708|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-475237708, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-475237708} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:33:51,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-802922116 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-802922116 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-802922116 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-802922116 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-802922116|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-802922116 |P2Thread1of1ForFork2_#t~ite6_Out-802922116|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-802922116, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-802922116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-802922116, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-802922116} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-802922116|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-802922116, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-802922116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-802922116, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-802922116} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:33:51,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1956778635 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1956778635 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out1956778635| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out1956778635| ~z$r_buff0_thd3~0_In1956778635) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1956778635, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1956778635} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1956778635, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1956778635, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1956778635|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:33:51,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-121410380 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-121410380 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-121410380 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-121410380 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite8_Out-121410380| ~z$r_buff1_thd3~0_In-121410380)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite8_Out-121410380| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-121410380, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-121410380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-121410380, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-121410380} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-121410380, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-121410380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-121410380, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-121410380, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-121410380|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:33:51,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:33:51,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 21:33:51,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1483948892 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1483948892 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In1483948892 |ULTIMATE.start_main_#t~ite19_Out1483948892|) (not .cse1)) (and (= ~z~0_In1483948892 |ULTIMATE.start_main_#t~ite19_Out1483948892|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1483948892, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1483948892, ~z$w_buff1~0=~z$w_buff1~0_In1483948892, ~z~0=~z~0_In1483948892} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1483948892|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1483948892, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1483948892, ~z$w_buff1~0=~z$w_buff1~0_In1483948892, ~z~0=~z~0_In1483948892} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:33:51,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:33:51,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1984655405 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1984655405 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1984655405|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1984655405 |ULTIMATE.start_main_#t~ite21_Out-1984655405|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1984655405, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1984655405} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1984655405, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1984655405, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1984655405|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:33:51,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1527699586 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1527699586 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1527699586 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1527699586 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out1527699586| ~z$w_buff1_used~0_In1527699586)) (and (= |ULTIMATE.start_main_#t~ite22_Out1527699586| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1527699586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1527699586, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1527699586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1527699586} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1527699586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1527699586, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1527699586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1527699586, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1527699586|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:33:51,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-877492703 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-877492703 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-877492703|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-877492703 |ULTIMATE.start_main_#t~ite23_Out-877492703|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-877492703, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-877492703} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-877492703, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-877492703, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-877492703|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:33:51,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1447578125 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1447578125 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1447578125 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1447578125 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1447578125 |ULTIMATE.start_main_#t~ite24_Out-1447578125|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite24_Out-1447578125|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1447578125, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1447578125, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1447578125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1447578125} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1447578125, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1447578125, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1447578125, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1447578125|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1447578125} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:33:51,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1984192187 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1984192187| ~z$w_buff1_used~0_In-1984192187) (= |ULTIMATE.start_main_#t~ite39_In-1984192187| |ULTIMATE.start_main_#t~ite39_Out-1984192187|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1984192187| |ULTIMATE.start_main_#t~ite40_Out-1984192187|) .cse0 (= |ULTIMATE.start_main_#t~ite39_Out-1984192187| ~z$w_buff1_used~0_In-1984192187) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1984192187 256)))) (or (and (= (mod ~z$r_buff1_thd0~0_In-1984192187 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1984192187 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-1984192187 256) 0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1984192187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1984192187, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1984192187|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1984192187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1984192187, ~weak$$choice2~0=~weak$$choice2~0_In-1984192187} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1984192187, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1984192187|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1984192187|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1984192187, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1984192187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1984192187, ~weak$$choice2~0=~weak$$choice2~0_In-1984192187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:33:51,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:33:51,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1304645245 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1304645245 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite46_Out-1304645245| |ULTIMATE.start_main_#t~ite45_Out-1304645245|)) (.cse5 (= (mod ~z$w_buff1_used~0_In-1304645245 256) 0)) (.cse1 (= (mod ~weak$$choice2~0_In-1304645245 256) 0)) (.cse4 (= (mod ~z$r_buff0_thd0~0_In-1304645245 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_In-1304645245| |ULTIMATE.start_main_#t~ite44_Out-1304645245|) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite45_Out-1304645245| ~z$r_buff1_thd0~0_In-1304645245) .cse1 (or .cse2 (and .cse3 .cse4) (and .cse5 .cse4))) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1304645245| |ULTIMATE.start_main_#t~ite45_In-1304645245|) (= |ULTIMATE.start_main_#t~ite46_Out-1304645245| ~z$r_buff1_thd0~0_In-1304645245)))) (let ((.cse6 (not .cse4))) (and (not .cse2) (or (not .cse3) .cse6) (= |ULTIMATE.start_main_#t~ite45_Out-1304645245| |ULTIMATE.start_main_#t~ite44_Out-1304645245|) .cse0 (or (not .cse5) .cse6) .cse1 (= |ULTIMATE.start_main_#t~ite44_Out-1304645245| 0))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1304645245, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1304645245, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1304645245, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1304645245, ~weak$$choice2~0=~weak$$choice2~0_In-1304645245, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1304645245|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1304645245|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1304645245, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1304645245, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1304645245, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1304645245, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1304645245|, ~weak$$choice2~0=~weak$$choice2~0_In-1304645245, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1304645245|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1304645245|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:33:51,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:33:51,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:33:51,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:33:51 BasicIcfg [2019-12-18 21:33:51,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:33:51,132 INFO L168 Benchmark]: Toolchain (without parser) took 28945.13 ms. Allocated memory was 138.9 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 100.7 MB in the beginning and 631.6 MB in the end (delta: -530.9 MB). Peak memory consumption was 856.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:51,133 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 21:33:51,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.82 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 156.9 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:51,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.56 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:51,135 INFO L168 Benchmark]: Boogie Preprocessor took 42.46 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:51,135 INFO L168 Benchmark]: RCFGBuilder took 826.69 ms. Allocated memory is still 203.4 MB. Free memory was 151.0 MB in the beginning and 101.5 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:51,136 INFO L168 Benchmark]: TraceAbstraction took 27113.75 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.8 MB in the beginning and 631.6 MB in the end (delta: -530.8 MB). Peak memory consumption was 792.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:51,139 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 882.82 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 156.9 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.56 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.46 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 826.69 ms. Allocated memory is still 203.4 MB. Free memory was 151.0 MB in the beginning and 101.5 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27113.75 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.8 MB in the beginning and 631.6 MB in the end (delta: -530.8 MB). Peak memory consumption was 792.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L835] FCALL, FORK 0 pthread_create(&t1246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L837] FCALL, FORK 0 pthread_create(&t1247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L839] FCALL, FORK 0 pthread_create(&t1248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] 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_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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 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) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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=0, weak$$choice2=0, x=1, y=2, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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=0, weak$$choice2=0, x=1, y=2, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 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 [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2081 SDtfs, 2491 SDslu, 5760 SDs, 0 SdLazy, 2806 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 37 SyntacticMatches, 16 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 10958 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 865 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 182895 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...