/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:17:11,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:17:11,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:17:11,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:17:11,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:17:11,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:17:11,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:17:11,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:17:11,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:17:11,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:17:11,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:17:11,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:17:11,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:17:11,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:17:11,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:17:11,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:17:11,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:17:11,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:17:11,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:17:11,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:17:11,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:17:11,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:17:11,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:17:11,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:17:11,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:17:11,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:17:11,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:17:11,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:17:11,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:17:11,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:17:11,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:17:11,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:17:11,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:17:11,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:17:11,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:17:11,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:17:11,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:17:11,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:17:11,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:17:11,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:17:11,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:17:11,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:17:11,901 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:17:11,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:17:11,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:17:11,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:17:11,905 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:17:11,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:17:11,905 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:17:11,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:17:11,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:17:11,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:17:11,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:17:11,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:17:11,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:17:11,907 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:17:11,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:17:11,908 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:17:11,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:17:11,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:17:11,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:17:11,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:17:11,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:17:11,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:17:11,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:17:11,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:17:11,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:17:11,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:17:11,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:17:11,911 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:17:11,911 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:17:11,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:17:11,913 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:17:11,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:17:12,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:17:12,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:17:12,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:17:12,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:17:12,215 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:17:12,215 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2019-12-27 21:17:12,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/647715549/d52e6284a28447b18b98e15a035a7686/FLAGa69cb7651 [2019-12-27 21:17:12,880 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:17:12,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2019-12-27 21:17:12,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/647715549/d52e6284a28447b18b98e15a035a7686/FLAGa69cb7651 [2019-12-27 21:17:13,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/647715549/d52e6284a28447b18b98e15a035a7686 [2019-12-27 21:17:13,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:17:13,198 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:17:13,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:17:13,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:17:13,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:17:13,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:13,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13, skipping insertion in model container [2019-12-27 21:17:13,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:13,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:17:13,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:17:13,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:17:13,760 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:17:13,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:17:13,918 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:17:13,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13 WrapperNode [2019-12-27 21:17:13,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:17:13,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:17:13,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:17:13,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:17:13,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:13,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:13,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:17:13,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:17:13,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:17:13,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:17:13,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:14,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:14,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:14,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:14,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:14,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:14,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (1/1) ... [2019-12-27 21:17:14,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:17:14,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:17:14,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:17:14,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:17:14,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:17:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:17:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:17:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:17:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:17:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:17:14,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:17:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:17:14,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:17:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:17:14,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:17:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:17:14,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:17:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:17:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:17:14,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:17:14,101 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:17:14,871 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:17:14,871 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:17:14,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:17:14 BoogieIcfgContainer [2019-12-27 21:17:14,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:17:14,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:17:14,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:17:14,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:17:14,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:17:13" (1/3) ... [2019-12-27 21:17:14,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529c5b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:17:14, skipping insertion in model container [2019-12-27 21:17:14,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:17:13" (2/3) ... [2019-12-27 21:17:14,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529c5b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:17:14, skipping insertion in model container [2019-12-27 21:17:14,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:17:14" (3/3) ... [2019-12-27 21:17:14,883 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_rmo.opt.i [2019-12-27 21:17:14,894 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:17:14,895 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:17:14,906 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:17:14,907 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:17:14,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,947 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,948 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,954 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,954 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,968 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,968 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,969 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,969 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,969 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,969 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,998 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:14,998 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,014 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,014 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,017 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:17:15,040 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:17:15,056 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:17:15,057 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:17:15,057 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:17:15,057 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:17:15,057 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:17:15,057 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:17:15,057 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:17:15,057 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:17:15,075 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 21:17:15,077 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 21:17:15,177 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 21:17:15,177 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:17:15,193 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. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:17:15,214 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 21:17:15,266 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 21:17:15,266 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:17:15,272 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. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:17:15,288 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:17:15,290 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:17:19,061 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 21:17:19,209 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 21:17:19,235 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-27 21:17:19,236 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 21:17:19,240 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-27 21:17:22,538 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-27 21:17:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-27 21:17:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:17:22,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:22,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:17:22,549 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-27 21:17:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:22,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-27 21:17:22,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:22,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300991811] [2019-12-27 21:17:22,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:22,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300991811] [2019-12-27 21:17:22,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:22,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:17:22,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2095336758] [2019-12-27 21:17:22,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:22,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:22,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:17:22,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:22,896 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:17:22,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:17:22,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:17:22,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:17:22,917 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-27 21:17:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:23,571 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-27 21:17:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:17:23,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:17:23,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:24,098 INFO L225 Difference]: With dead ends: 36830 [2019-12-27 21:17:24,098 INFO L226 Difference]: Without dead ends: 36102 [2019-12-27 21:17:24,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:17:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-27 21:17:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-27 21:17:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-27 21:17:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-27 21:17:25,825 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-27 21:17:25,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:25,826 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-27 21:17:25,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:17:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-27 21:17:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:17:25,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:25,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:17:25,834 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-27 21:17:25,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:25,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-27 21:17:25,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:25,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153887080] [2019-12-27 21:17:25,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:25,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153887080] [2019-12-27 21:17:25,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:25,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:17:25,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1027102123] [2019-12-27 21:17:25,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:25,971 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:25,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:17:25,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:26,027 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:17:26,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:17:26,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:26,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:17:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:17:26,030 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 5 states. [2019-12-27 21:17:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:28,315 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-27 21:17:28,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:17:28,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:17:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:28,577 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 21:17:28,578 INFO L226 Difference]: Without dead ends: 56106 [2019-12-27 21:17:28,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:17:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-27 21:17:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-27 21:17:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-27 21:17:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-27 21:17:30,779 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-27 21:17:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:30,780 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-27 21:17:30,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:17:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-27 21:17:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:17:30,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:30,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:17:30,783 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-27 21:17:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:30,783 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-27 21:17:30,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:30,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225451161] [2019-12-27 21:17:30,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:30,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225451161] [2019-12-27 21:17:30,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:30,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:17:30,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [458297222] [2019-12-27 21:17:30,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:30,852 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:30,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:17:30,854 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:30,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:17:30,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:17:30,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:30,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:17:30,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:17:30,855 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-27 21:17:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:31,043 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-27 21:17:31,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:17:31,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:17:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:31,165 INFO L225 Difference]: With dead ends: 39280 [2019-12-27 21:17:33,304 INFO L226 Difference]: Without dead ends: 39280 [2019-12-27 21:17:33,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:17:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-27 21:17:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-27 21:17:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-27 21:17:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-27 21:17:34,516 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-27 21:17:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:34,517 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-27 21:17:34,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:17:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-27 21:17:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:17:34,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:34,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:17:34,520 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-27 21:17:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:34,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-27 21:17:34,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:34,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146188920] [2019-12-27 21:17:34,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:34,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146188920] [2019-12-27 21:17:34,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:34,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:17:34,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803258314] [2019-12-27 21:17:34,587 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:34,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:34,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:17:34,592 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:34,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:17:34,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:17:34,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:17:34,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:17:34,593 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-27 21:17:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:34,667 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-27 21:17:34,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:17:34,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:17:34,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:34,692 INFO L225 Difference]: With dead ends: 16344 [2019-12-27 21:17:34,693 INFO L226 Difference]: Without dead ends: 16344 [2019-12-27 21:17:34,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:17:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-27 21:17:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-27 21:17:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-27 21:17:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-27 21:17:34,996 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-27 21:17:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:34,996 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-27 21:17:34,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:17:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-27 21:17:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:17:34,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:34,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:17:34,998 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-27 21:17:34,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:34,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-27 21:17:34,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:34,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632547737] [2019-12-27 21:17:34,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:35,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632547737] [2019-12-27 21:17:35,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:35,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:17:35,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1944834736] [2019-12-27 21:17:35,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:35,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:35,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:17:35,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:35,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:17:35,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:17:35,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:35,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:17:35,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:17:35,106 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 6 states. [2019-12-27 21:17:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:35,159 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-27 21:17:35,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:17:35,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 21:17:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:35,164 INFO L225 Difference]: With dead ends: 2799 [2019-12-27 21:17:35,165 INFO L226 Difference]: Without dead ends: 2799 [2019-12-27 21:17:35,165 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-27 21:17:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-27 21:17:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-27 21:17:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-27 21:17:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-27 21:17:35,209 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-27 21:17:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:35,210 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-27 21:17:35,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:17:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-27 21:17:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:17:35,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:35,214 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-27 21:17:35,215 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-27 21:17:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:35,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-27 21:17:35,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:35,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486418014] [2019-12-27 21:17:35,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:35,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486418014] [2019-12-27 21:17:35,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:35,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:17:35,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [480128630] [2019-12-27 21:17:35,326 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:35,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:35,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 97 transitions. [2019-12-27 21:17:35,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:35,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:17:35,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:17:35,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:35,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:17:35,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:17:35,391 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 8 states. [2019-12-27 21:17:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:35,471 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-27 21:17:35,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:17:35,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 21:17:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:35,475 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 21:17:35,475 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 21:17:35,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:17:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 21:17:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-27 21:17:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 21:17:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-27 21:17:35,502 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-27 21:17:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:35,502 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-27 21:17:35,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:17:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-27 21:17:35,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:17:35,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:35,507 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-27 21:17:35,508 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-27 21:17:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-27 21:17:35,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:35,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208637160] [2019-12-27 21:17:35,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:35,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208637160] [2019-12-27 21:17:35,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:35,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:17:35,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964444295] [2019-12-27 21:17:35,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:35,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:35,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 139 transitions. [2019-12-27 21:17:35,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:35,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:17:35,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:17:35,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:35,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:17:35,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:17:35,781 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-27 21:17:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:35,837 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-27 21:17:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:17:35,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:17:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:35,839 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 21:17:35,840 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 21:17:35,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:17:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 21:17:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-27 21:17:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 21:17:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-27 21:17:35,855 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-27 21:17:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:35,856 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-27 21:17:35,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:17:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-27 21:17:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:17:35,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:35,860 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-27 21:17:35,860 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-27 21:17:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:35,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-27 21:17:35,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:35,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758117247] [2019-12-27 21:17:35,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:36,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758117247] [2019-12-27 21:17:36,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:36,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:17:36,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [342301790] [2019-12-27 21:17:36,011 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:36,028 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:36,083 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 139 transitions. [2019-12-27 21:17:36,084 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:36,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:17:36,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:17:36,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:36,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:17:36,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:17:36,090 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-27 21:17:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:36,351 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-27 21:17:36,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:17:36,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:17:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:36,356 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 21:17:36,356 INFO L226 Difference]: Without dead ends: 1763 [2019-12-27 21:17:36,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-27 21:17:36,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-27 21:17:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-27 21:17:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 21:17:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-27 21:17:36,375 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-27 21:17:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:36,375 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-27 21:17:36,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:17:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-27 21:17:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:17:36,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:36,379 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-27 21:17:36,379 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-27 21:17:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:36,380 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-27 21:17:36,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:36,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320119399] [2019-12-27 21:17:36,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:36,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320119399] [2019-12-27 21:17:36,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:36,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:17:36,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [404716205] [2019-12-27 21:17:36,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:36,515 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:36,596 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 153 transitions. [2019-12-27 21:17:36,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:36,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:17:36,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:17:36,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:36,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:17:36,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:17:36,738 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 10 states. [2019-12-27 21:17:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:38,554 INFO L93 Difference]: Finished difference Result 3066 states and 8447 transitions. [2019-12-27 21:17:38,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:17:38,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 21:17:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:38,560 INFO L225 Difference]: With dead ends: 3066 [2019-12-27 21:17:38,560 INFO L226 Difference]: Without dead ends: 3066 [2019-12-27 21:17:38,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:17:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2019-12-27 21:17:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 1502. [2019-12-27 21:17:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-27 21:17:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-27 21:17:38,591 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-27 21:17:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:38,592 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-27 21:17:38,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:17:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-27 21:17:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:17:38,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:38,595 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-27 21:17:38,596 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-27 21:17:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-27 21:17:38,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:38,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499090424] [2019-12-27 21:17:38,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:38,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499090424] [2019-12-27 21:17:38,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:38,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:17:38,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557510260] [2019-12-27 21:17:38,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:38,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:38,794 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 154 transitions. [2019-12-27 21:17:38,794 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:38,795 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:17:38,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:17:38,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:38,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:17:38,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:17:38,796 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 3 states. [2019-12-27 21:17:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:38,851 INFO L93 Difference]: Finished difference Result 1501 states and 4319 transitions. [2019-12-27 21:17:38,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:17:38,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:17:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:38,854 INFO L225 Difference]: With dead ends: 1501 [2019-12-27 21:17:38,854 INFO L226 Difference]: Without dead ends: 1501 [2019-12-27 21:17:38,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:17:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-12-27 21:17:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1080. [2019-12-27 21:17:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-12-27 21:17:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3133 transitions. [2019-12-27 21:17:38,869 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3133 transitions. Word has length 58 [2019-12-27 21:17:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:38,870 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 3133 transitions. [2019-12-27 21:17:38,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:17:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3133 transitions. [2019-12-27 21:17:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:17:38,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:38,872 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-27 21:17:38,872 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-27 21:17:38,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:38,873 INFO L82 PathProgramCache]: Analyzing trace with hash 226928645, now seen corresponding path program 1 times [2019-12-27 21:17:38,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:38,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927208458] [2019-12-27 21:17:38,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:38,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927208458] [2019-12-27 21:17:38,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:38,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:17:38,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097763292] [2019-12-27 21:17:38,965 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:38,997 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:39,085 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 138 transitions. [2019-12-27 21:17:39,086 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:39,111 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:17:39,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:17:39,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:17:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:17:39,113 INFO L87 Difference]: Start difference. First operand 1080 states and 3133 transitions. Second operand 5 states. [2019-12-27 21:17:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:39,304 INFO L93 Difference]: Finished difference Result 1253 states and 3523 transitions. [2019-12-27 21:17:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:17:39,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-27 21:17:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:39,308 INFO L225 Difference]: With dead ends: 1253 [2019-12-27 21:17:39,308 INFO L226 Difference]: Without dead ends: 1253 [2019-12-27 21:17:39,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:17:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2019-12-27 21:17:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 956. [2019-12-27 21:17:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-27 21:17:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2705 transitions. [2019-12-27 21:17:39,320 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2705 transitions. Word has length 59 [2019-12-27 21:17:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:39,320 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2705 transitions. [2019-12-27 21:17:39,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:17:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2705 transitions. [2019-12-27 21:17:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:17:39,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:39,323 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-27 21:17:39,323 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-27 21:17:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:39,323 INFO L82 PathProgramCache]: Analyzing trace with hash 692943471, now seen corresponding path program 1 times [2019-12-27 21:17:39,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:39,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728933206] [2019-12-27 21:17:39,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:39,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728933206] [2019-12-27 21:17:39,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:39,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:17:39,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1409252963] [2019-12-27 21:17:39,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:39,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:39,517 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 139 transitions. [2019-12-27 21:17:39,517 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:39,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:17:39,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:17:39,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:39,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:17:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:17:39,519 INFO L87 Difference]: Start difference. First operand 956 states and 2705 transitions. Second operand 6 states. [2019-12-27 21:17:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:39,575 INFO L93 Difference]: Finished difference Result 1329 states and 3561 transitions. [2019-12-27 21:17:39,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:17:39,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 21:17:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:39,578 INFO L225 Difference]: With dead ends: 1329 [2019-12-27 21:17:39,578 INFO L226 Difference]: Without dead ends: 830 [2019-12-27 21:17:39,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:17:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2019-12-27 21:17:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2019-12-27 21:17:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-12-27 21:17:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2281 transitions. [2019-12-27 21:17:39,592 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2281 transitions. Word has length 60 [2019-12-27 21:17:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:39,592 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 2281 transitions. [2019-12-27 21:17:39,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:17:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2281 transitions. [2019-12-27 21:17:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:17:39,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:39,595 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-27 21:17:39,595 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-27 21:17:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:39,595 INFO L82 PathProgramCache]: Analyzing trace with hash -40355053, now seen corresponding path program 2 times [2019-12-27 21:17:39,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:39,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710003521] [2019-12-27 21:17:39,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:39,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710003521] [2019-12-27 21:17:39,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:39,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:17:39,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [613806853] [2019-12-27 21:17:39,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:39,750 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:39,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 194 transitions. [2019-12-27 21:17:39,837 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:39,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:17:39,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:17:39,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:39,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:17:39,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:17:39,839 INFO L87 Difference]: Start difference. First operand 830 states and 2281 transitions. Second operand 6 states. [2019-12-27 21:17:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:39,951 INFO L93 Difference]: Finished difference Result 1159 states and 3005 transitions. [2019-12-27 21:17:39,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:17:39,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 21:17:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:39,953 INFO L225 Difference]: With dead ends: 1159 [2019-12-27 21:17:39,953 INFO L226 Difference]: Without dead ends: 676 [2019-12-27 21:17:39,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:17:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-12-27 21:17:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 604. [2019-12-27 21:17:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 21:17:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1458 transitions. [2019-12-27 21:17:39,964 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1458 transitions. Word has length 60 [2019-12-27 21:17:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:39,964 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1458 transitions. [2019-12-27 21:17:39,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:17:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1458 transitions. [2019-12-27 21:17:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:17:39,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:39,966 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-27 21:17:39,967 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-27 21:17:39,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:39,967 INFO L82 PathProgramCache]: Analyzing trace with hash -528056523, now seen corresponding path program 3 times [2019-12-27 21:17:39,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:39,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903279836] [2019-12-27 21:17:39,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:40,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903279836] [2019-12-27 21:17:40,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:40,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:17:40,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967877808] [2019-12-27 21:17:40,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:40,116 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:40,231 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 253 transitions. [2019-12-27 21:17:40,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:40,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:17:40,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:17:40,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:40,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:17:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:17:40,256 INFO L87 Difference]: Start difference. First operand 604 states and 1458 transitions. Second operand 7 states. [2019-12-27 21:17:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:40,493 INFO L93 Difference]: Finished difference Result 1011 states and 2300 transitions. [2019-12-27 21:17:40,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:17:40,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 21:17:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:40,494 INFO L225 Difference]: With dead ends: 1011 [2019-12-27 21:17:40,494 INFO L226 Difference]: Without dead ends: 336 [2019-12-27 21:17:40,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:17:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-27 21:17:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 236. [2019-12-27 21:17:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-27 21:17:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-27 21:17:40,500 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 60 [2019-12-27 21:17:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:40,500 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-27 21:17:40,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:17:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-27 21:17:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:17:40,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:40,501 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-27 21:17:40,502 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-27 21:17:40,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:40,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 4 times [2019-12-27 21:17:40,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:40,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900984175] [2019-12-27 21:17:40,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:17:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:17:40,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900984175] [2019-12-27 21:17:40,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:17:40,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:17:40,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [425492408] [2019-12-27 21:17:40,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:17:40,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:17:40,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 131 transitions. [2019-12-27 21:17:40,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:17:40,984 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:17:40,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:17:40,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:17:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:17:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:17:40,985 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 14 states. [2019-12-27 21:17:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:17:42,158 INFO L93 Difference]: Finished difference Result 499 states and 858 transitions. [2019-12-27 21:17:42,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:17:42,159 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 21:17:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:17:42,160 INFO L225 Difference]: With dead ends: 499 [2019-12-27 21:17:42,160 INFO L226 Difference]: Without dead ends: 468 [2019-12-27 21:17:42,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:17:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-12-27 21:17:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 344. [2019-12-27 21:17:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 21:17:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-27 21:17:42,165 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-27 21:17:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:17:42,166 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-27 21:17:42,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:17:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-27 21:17:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:17:42,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:17:42,167 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-27 21:17:42,167 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-27 21:17:42,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:17:42,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 5 times [2019-12-27 21:17:42,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:17:42,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665190049] [2019-12-27 21:17:42,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:17:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:17:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:17:42,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:17:42,285 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:17:42,289 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) (= 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_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1181~0.base_19|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1181~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1181~0.base_19|) |v_ULTIMATE.start_main_~#t1181~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$r_buff1_thd1~0_8 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1181~0.base_19|) 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff1_thd4~0_16) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1181~0.base_19| 1)) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1181~0.base_19| 4) |v_#length_29|) (= v_~b~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= 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) (= 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_#NULL.base_7|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_25) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= 0 |v_ULTIMATE.start_main_~#t1181~0.offset_16|) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10) (= 0 v_~y~0_9))) 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|, ULTIMATE.start_main_~#t1182~0.base=|v_ULTIMATE.start_main_~#t1182~0.base_22|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ULTIMATE.start_main_~#t1182~0.offset=|v_ULTIMATE.start_main_~#t1182~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~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|, ~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_~#t1184~0.offset=|v_ULTIMATE.start_main_~#t1184~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_~#t1181~0.base=|v_ULTIMATE.start_main_~#t1181~0.base_19|, ~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, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t1183~0.offset=|v_ULTIMATE.start_main_~#t1183~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_~#t1183~0.base=|v_ULTIMATE.start_main_~#t1183~0.base_21|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_9, ~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_~#t1181~0.offset=|v_ULTIMATE.start_main_~#t1181~0.offset_16|, 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|, ~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, ULTIMATE.start_main_~#t1184~0.base=|v_ULTIMATE.start_main_~#t1184~0.base_22|} 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, ULTIMATE.start_main_~#t1182~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1182~0.offset, ~__unbuffered_p1_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, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_~#t1184~0.offset, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1181~0.base, ~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, ~x~0, ULTIMATE.start_main_~#t1183~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_~#t1183~0.base, 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_~#t1181~0.offset, 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, ~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, ULTIMATE.start_main_~#t1184~0.base] because there is no mapped edge [2019-12-27 21:17:42,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1182~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1182~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1182~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1182~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1182~0.base_13|) |v_ULTIMATE.start_main_~#t1182~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1182~0.base_13| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1182~0.base_13| 1) |v_#valid_48|) (= 0 |v_ULTIMATE.start_main_~#t1182~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1182~0.offset=|v_ULTIMATE.start_main_~#t1182~0.offset_11|, #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_~#t1182~0.base=|v_ULTIMATE.start_main_~#t1182~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1182~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1182~0.base] because there is no mapped edge [2019-12-27 21:17:42,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1183~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1183~0.offset_10|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1183~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1183~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1183~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1183~0.base_12|) |v_ULTIMATE.start_main_~#t1183~0.offset_10| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1183~0.base_12| 4) |v_#length_21|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1183~0.base_12|))) 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_~#t1183~0.offset=|v_ULTIMATE.start_main_~#t1183~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1183~0.base=|v_ULTIMATE.start_main_~#t1183~0.base_12|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1183~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1183~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 21:17:42,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1184~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1184~0.base_12|) |v_ULTIMATE.start_main_~#t1184~0.offset_10| 3)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1184~0.offset_10|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1184~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t1184~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1184~0.base_12|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1184~0.base_12| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1184~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1184~0.offset=|v_ULTIMATE.start_main_~#t1184~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #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|, ULTIMATE.start_main_~#t1184~0.base=|v_ULTIMATE.start_main_~#t1184~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1184~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1184~0.base] because there is no mapped edge [2019-12-27 21:17:42,294 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-27 21:17:42,294 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|) (= 1 v_~x~0_7) (= 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} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, 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_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:17:42,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_5) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= |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, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, 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_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:17:42,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1649887059 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1649887059 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1649887059| ~z$w_buff0_used~0_In-1649887059)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-1649887059|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1649887059, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1649887059} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1649887059, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1649887059, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1649887059|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 21:17:42,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2089003837 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2089003837 256)))) (or (and (= ~z$w_buff1~0_In2089003837 |P2Thread1of1ForFork2_#t~ite3_Out2089003837|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In2089003837 |P2Thread1of1ForFork2_#t~ite3_Out2089003837|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2089003837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2089003837, ~z$w_buff1~0=~z$w_buff1~0_In2089003837, ~z~0=~z~0_In2089003837} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out2089003837|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2089003837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2089003837, ~z$w_buff1~0=~z$w_buff1~0_In2089003837, ~z~0=~z~0_In2089003837} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:17:42,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-550471011 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-550471011 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-550471011 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-550471011 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out-550471011| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork3_#t~ite12_Out-550471011| ~z$w_buff1_used~0_In-550471011) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-550471011, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-550471011, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-550471011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-550471011} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-550471011, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-550471011, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-550471011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-550471011, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-550471011|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 21:17:42,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1323152144 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1323152144 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-1323152144 ~z$r_buff0_thd4~0_In-1323152144) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$r_buff0_thd4~0_Out-1323152144 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323152144, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1323152144} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323152144, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1323152144, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1323152144|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 21:17:42,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In-1433148230 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1433148230 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1433148230 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1433148230 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1433148230|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-1433148230 |P3Thread1of1ForFork3_#t~ite14_Out-1433148230|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1433148230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1433148230, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1433148230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1433148230} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1433148230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1433148230, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1433148230|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1433148230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1433148230} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 21:17:42,300 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-27 21:17:42,300 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-27 21:17:42,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1948219065 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1948219065 256) 0))) (or (and (= ~z$w_buff0_used~0_In1948219065 |P2Thread1of1ForFork2_#t~ite5_Out1948219065|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out1948219065|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1948219065, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1948219065} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1948219065|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1948219065, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1948219065} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:17:42,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1728433083 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1728433083 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1728433083 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1728433083 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out1728433083| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite6_Out1728433083| ~z$w_buff1_used~0_In1728433083) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1728433083, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1728433083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1728433083, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1728433083} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1728433083|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1728433083, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1728433083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1728433083, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1728433083} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:17:42,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1284993307 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1284993307 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-1284993307| ~z$r_buff0_thd3~0_In-1284993307)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1284993307| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1284993307, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1284993307} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1284993307, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1284993307, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1284993307|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:17:42,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-424629269 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-424629269 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-424629269 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-424629269 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out-424629269| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-424629269 |P2Thread1of1ForFork2_#t~ite8_Out-424629269|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-424629269, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-424629269, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-424629269, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-424629269} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-424629269, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-424629269, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-424629269, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-424629269, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-424629269|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:17:42,303 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-27 21:17:42,303 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-27 21:17:42,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-583548820 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-583548820 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-583548820 |ULTIMATE.start_main_#t~ite19_Out-583548820|)) (and (not .cse0) (= ~z$w_buff1~0_In-583548820 |ULTIMATE.start_main_#t~ite19_Out-583548820|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-583548820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-583548820, ~z$w_buff1~0=~z$w_buff1~0_In-583548820, ~z~0=~z~0_In-583548820} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-583548820|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-583548820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-583548820, ~z$w_buff1~0=~z$w_buff1~0_In-583548820, ~z~0=~z~0_In-583548820} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:17:42,304 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-27 21:17:42,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1240948582 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1240948582 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1240948582| ~z$w_buff0_used~0_In-1240948582)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1240948582| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1240948582, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1240948582} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1240948582, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1240948582, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1240948582|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:17:42,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-2052843672 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-2052843672 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2052843672 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2052843672 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-2052843672|)) (and (= ~z$w_buff1_used~0_In-2052843672 |ULTIMATE.start_main_#t~ite22_Out-2052843672|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2052843672, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2052843672, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2052843672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2052843672} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2052843672, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2052843672, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2052843672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2052843672, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2052843672|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:17:42,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-798976330 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-798976330 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-798976330| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite23_Out-798976330| ~z$r_buff0_thd0~0_In-798976330) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-798976330, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-798976330} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-798976330, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-798976330, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-798976330|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:17:42,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In862666443 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In862666443 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In862666443 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In862666443 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out862666443|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In862666443 |ULTIMATE.start_main_#t~ite24_Out862666443|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In862666443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In862666443, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In862666443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In862666443} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In862666443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In862666443, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In862666443, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out862666443|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In862666443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:17:42,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1604566497 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In-1604566497| |ULTIMATE.start_main_#t~ite39_Out-1604566497|) (= |ULTIMATE.start_main_#t~ite40_Out-1604566497| ~z$w_buff1_used~0_In-1604566497)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1604566497| ~z$w_buff1_used~0_In-1604566497) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1604566497 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-1604566497 256) 0)) (= (mod ~z$w_buff0_used~0_In-1604566497 256) 0) (and (= (mod ~z$w_buff1_used~0_In-1604566497 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out-1604566497| |ULTIMATE.start_main_#t~ite40_Out-1604566497|) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1604566497, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1604566497, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1604566497|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1604566497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1604566497, ~weak$$choice2~0=~weak$$choice2~0_In-1604566497} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1604566497, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1604566497|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1604566497|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1604566497, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1604566497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1604566497, ~weak$$choice2~0=~weak$$choice2~0_In-1604566497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:17:42,316 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-27 21:17:42,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse4 (= (mod ~z$w_buff1_used~0_In167464084 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In167464084 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In167464084 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In167464084 256) 0)) (.cse5 (= |ULTIMATE.start_main_#t~ite46_Out167464084| |ULTIMATE.start_main_#t~ite45_Out167464084|)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In167464084 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_In167464084| |ULTIMATE.start_main_#t~ite44_Out167464084|) (or (and (not .cse0) (= ~z$r_buff1_thd0~0_In167464084 |ULTIMATE.start_main_#t~ite46_Out167464084|) (= |ULTIMATE.start_main_#t~ite45_Out167464084| |ULTIMATE.start_main_#t~ite45_In167464084|)) (and (= ~z$r_buff1_thd0~0_In167464084 |ULTIMATE.start_main_#t~ite45_Out167464084|) (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse0 .cse5))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse4)) (= |ULTIMATE.start_main_#t~ite45_Out167464084| |ULTIMATE.start_main_#t~ite44_Out167464084|) (= 0 |ULTIMATE.start_main_#t~ite44_Out167464084|) .cse0 (not .cse1) (or .cse6 (not .cse3)) .cse5)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In167464084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In167464084, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In167464084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In167464084, ~weak$$choice2~0=~weak$$choice2~0_In167464084, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In167464084|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In167464084|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In167464084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In167464084, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In167464084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In167464084, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out167464084|, ~weak$$choice2~0=~weak$$choice2~0_In167464084, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out167464084|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out167464084|} 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-27 21:17:42,317 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-27 21:17:42,317 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-27 21:17:42,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:17:42 BasicIcfg [2019-12-27 21:17:42,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:17:42,431 INFO L168 Benchmark]: Toolchain (without parser) took 29233.82 ms. Allocated memory was 137.9 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 99.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 414.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:17:42,432 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:17:42,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.90 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 155.3 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:17:42,433 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.90 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:17:42,434 INFO L168 Benchmark]: Boogie Preprocessor took 40.51 ms. Allocated memory is still 201.9 MB. Free memory was 152.0 MB in the beginning and 149.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:17:42,434 INFO L168 Benchmark]: RCFGBuilder took 842.56 ms. Allocated memory is still 201.9 MB. Free memory was 149.3 MB in the beginning and 100.1 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:17:42,435 INFO L168 Benchmark]: TraceAbstraction took 27555.72 ms. Allocated memory was 201.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 99.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 350.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:17:42,439 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.90 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 155.3 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.90 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.51 ms. Allocated memory is still 201.9 MB. Free memory was 152.0 MB in the beginning and 149.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.56 ms. Allocated memory is still 201.9 MB. Free memory was 149.3 MB in the beginning and 100.1 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27555.72 ms. Allocated memory was 201.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 99.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 350.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 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(&t1181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t1182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t1183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t1184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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_p1_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=1, 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 = 1 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=2, y=1, 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: 27.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1703 SDtfs, 2296 SDslu, 4292 SDs, 0 SdLazy, 2518 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.0s 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: 5.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 9105 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 121872 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...