/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/mix016_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:10:44,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:10:44,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:10:44,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:10:44,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:10:44,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:10:44,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:10:44,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:10:44,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:10:44,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:10:44,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:10:44,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:10:44,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:10:44,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:10:44,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:10:44,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:10:44,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:10:44,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:10:44,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:10:44,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:10:44,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:10:44,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:10:44,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:10:44,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:10:44,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:10:44,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:10:44,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:10:44,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:10:44,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:10:44,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:10:44,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:10:44,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:10:44,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:10:44,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:10:44,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:10:44,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:10:44,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:10:44,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:10:44,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:10:44,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:10:44,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:10:44,851 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 20:10:44,865 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:10:44,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:10:44,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:10:44,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:10:44,867 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:10:44,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:10:44,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:10:44,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:10:44,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:10:44,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:10:44,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:10:44,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:10:44,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:10:44,869 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:10:44,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:10:44,869 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:10:44,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:10:44,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:10:44,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:10:44,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:10:44,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:10:44,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:10:44,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:10:44,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:10:44,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:10:44,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:10:44,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:10:44,872 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:10:44,872 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:10:44,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:10:44,872 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:10:44,872 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:10:45,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:10:45,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:10:45,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:10:45,156 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:10:45,156 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:10:45,157 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.oepc.i [2019-12-27 20:10:45,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2e4da04c/8001f209c0cd4c2ba2147ffa8eb82daa/FLAG49cfccae1 [2019-12-27 20:10:45,750 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:10:45,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.oepc.i [2019-12-27 20:10:45,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2e4da04c/8001f209c0cd4c2ba2147ffa8eb82daa/FLAG49cfccae1 [2019-12-27 20:10:46,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2e4da04c/8001f209c0cd4c2ba2147ffa8eb82daa [2019-12-27 20:10:46,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:10:46,048 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:10:46,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:10:46,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:10:46,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:10:46,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9b7dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46, skipping insertion in model container [2019-12-27 20:10:46,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:10:46,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:10:46,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:10:46,699 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:10:46,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:10:46,876 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:10:46,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46 WrapperNode [2019-12-27 20:10:46,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:10:46,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:10:46,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:10:46,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:10:46,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:10:46,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:10:46,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:10:46,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:10:46,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... [2019-12-27 20:10:46,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:10:46,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:10:46,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:10:46,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:10:46,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:10:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:10:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:10:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:10:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:10:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:10:47,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:10:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:10:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:10:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:10:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:10:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:10:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:10:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:10:47,062 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 20:10:47,809 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:10:47,809 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:10:47,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:10:47 BoogieIcfgContainer [2019-12-27 20:10:47,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:10:47,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:10:47,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:10:47,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:10:47,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:10:46" (1/3) ... [2019-12-27 20:10:47,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60688a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:10:47, skipping insertion in model container [2019-12-27 20:10:47,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:46" (2/3) ... [2019-12-27 20:10:47,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60688a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:10:47, skipping insertion in model container [2019-12-27 20:10:47,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:10:47" (3/3) ... [2019-12-27 20:10:47,820 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_pso.oepc.i [2019-12-27 20:10:47,830 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:10:47,831 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:10:47,838 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:10:47,839 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:10:47,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,880 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,880 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,881 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,881 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,889 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,890 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,914 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,914 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,942 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,944 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,952 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,952 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,958 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:47,975 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:10:47,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:10:47,995 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:10:47,995 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:10:47,995 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:10:47,995 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:10:47,996 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:10:47,996 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:10:47,996 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:10:48,013 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 20:10:48,015 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 20:10:48,117 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 20:10:48,117 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:10:48,134 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:10:48,164 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 20:10:48,223 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 20:10:48,223 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:10:48,242 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:10:48,266 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:10:48,268 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:10:51,607 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-27 20:10:51,736 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-27 20:10:51,965 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 20:10:52,080 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 20:10:52,111 INFO L206 etLargeBlockEncoding]: Checked pairs total: 92501 [2019-12-27 20:10:52,111 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 20:10:52,115 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-27 20:11:08,978 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-27 20:11:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-27 20:11:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:11:08,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:08,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:11:08,987 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:08,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:08,993 INFO L82 PathProgramCache]: Analyzing trace with hash 918816, now seen corresponding path program 1 times [2019-12-27 20:11:09,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:09,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310638136] [2019-12-27 20:11:09,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:09,254 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 20:11:09,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310638136] [2019-12-27 20:11:09,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:09,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:11:09,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115257540] [2019-12-27 20:11:09,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:09,269 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:09,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:11:09,283 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:09,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:09,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:11:09,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:09,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:11:09,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:11:09,306 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-27 20:11:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:12,673 INFO L93 Difference]: Finished difference Result 108764 states and 466654 transitions. [2019-12-27 20:11:12,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:11:12,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:11:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:13,344 INFO L225 Difference]: With dead ends: 108764 [2019-12-27 20:11:13,344 INFO L226 Difference]: Without dead ends: 102524 [2019-12-27 20:11:13,347 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 20:11:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102524 states. [2019-12-27 20:11:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102524 to 102524. [2019-12-27 20:11:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102524 states. [2019-12-27 20:11:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102524 states to 102524 states and 439302 transitions. [2019-12-27 20:11:22,438 INFO L78 Accepts]: Start accepts. Automaton has 102524 states and 439302 transitions. Word has length 3 [2019-12-27 20:11:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:22,438 INFO L462 AbstractCegarLoop]: Abstraction has 102524 states and 439302 transitions. [2019-12-27 20:11:22,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:11:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 102524 states and 439302 transitions. [2019-12-27 20:11:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:11:22,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:22,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:22,443 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:22,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:22,443 INFO L82 PathProgramCache]: Analyzing trace with hash 289019227, now seen corresponding path program 1 times [2019-12-27 20:11:22,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:22,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880587494] [2019-12-27 20:11:22,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:22,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880587494] [2019-12-27 20:11:22,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:22,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:11:22,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1081749050] [2019-12-27 20:11:22,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:22,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:22,593 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:11:22,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:22,594 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:22,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:11:22,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:22,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:11:22,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:11:22,596 INFO L87 Difference]: Start difference. First operand 102524 states and 439302 transitions. Second operand 4 states. [2019-12-27 20:11:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:27,970 INFO L93 Difference]: Finished difference Result 163542 states and 670978 transitions. [2019-12-27 20:11:27,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:11:27,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:11:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:28,718 INFO L225 Difference]: With dead ends: 163542 [2019-12-27 20:11:28,718 INFO L226 Difference]: Without dead ends: 163493 [2019-12-27 20:11:28,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:11:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163493 states. [2019-12-27 20:11:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163493 to 148037. [2019-12-27 20:11:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148037 states. [2019-12-27 20:11:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148037 states to 148037 states and 616165 transitions. [2019-12-27 20:11:42,734 INFO L78 Accepts]: Start accepts. Automaton has 148037 states and 616165 transitions. Word has length 11 [2019-12-27 20:11:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:42,734 INFO L462 AbstractCegarLoop]: Abstraction has 148037 states and 616165 transitions. [2019-12-27 20:11:42,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:11:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 148037 states and 616165 transitions. [2019-12-27 20:11:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:11:42,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:42,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:42,741 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1142061067, now seen corresponding path program 1 times [2019-12-27 20:11:42,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:42,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918230850] [2019-12-27 20:11:42,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:42,851 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 20:11:42,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918230850] [2019-12-27 20:11:42,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:42,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:42,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033684648] [2019-12-27 20:11:42,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:42,855 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:42,858 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:11:42,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:42,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:42,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:11:42,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:42,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:11:42,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:11:42,860 INFO L87 Difference]: Start difference. First operand 148037 states and 616165 transitions. Second operand 4 states. [2019-12-27 20:11:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:43,124 INFO L93 Difference]: Finished difference Result 43692 states and 150602 transitions. [2019-12-27 20:11:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:11:43,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:11:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:43,207 INFO L225 Difference]: With dead ends: 43692 [2019-12-27 20:11:43,207 INFO L226 Difference]: Without dead ends: 33563 [2019-12-27 20:11:43,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:11:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33563 states. [2019-12-27 20:11:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33563 to 33467. [2019-12-27 20:11:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33467 states. [2019-12-27 20:11:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33467 states to 33467 states and 109644 transitions. [2019-12-27 20:11:43,850 INFO L78 Accepts]: Start accepts. Automaton has 33467 states and 109644 transitions. Word has length 13 [2019-12-27 20:11:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:43,851 INFO L462 AbstractCegarLoop]: Abstraction has 33467 states and 109644 transitions. [2019-12-27 20:11:43,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:11:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 33467 states and 109644 transitions. [2019-12-27 20:11:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:11:43,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:43,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:43,855 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:43,855 INFO L82 PathProgramCache]: Analyzing trace with hash 600624420, now seen corresponding path program 1 times [2019-12-27 20:11:43,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:43,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801559742] [2019-12-27 20:11:43,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:43,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801559742] [2019-12-27 20:11:43,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:43,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:11:43,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912550549] [2019-12-27 20:11:43,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:43,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:43,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:11:43,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:43,949 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:43,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:11:43,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:11:43,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:11:43,950 INFO L87 Difference]: Start difference. First operand 33467 states and 109644 transitions. Second operand 4 states. [2019-12-27 20:11:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:45,722 INFO L93 Difference]: Finished difference Result 42187 states and 137227 transitions. [2019-12-27 20:11:45,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:11:45,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:11:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:45,841 INFO L225 Difference]: With dead ends: 42187 [2019-12-27 20:11:45,841 INFO L226 Difference]: Without dead ends: 42187 [2019-12-27 20:11:45,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:11:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42187 states. [2019-12-27 20:11:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42187 to 37860. [2019-12-27 20:11:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37860 states. [2019-12-27 20:11:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37860 states to 37860 states and 123683 transitions. [2019-12-27 20:11:46,514 INFO L78 Accepts]: Start accepts. Automaton has 37860 states and 123683 transitions. Word has length 16 [2019-12-27 20:11:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:46,514 INFO L462 AbstractCegarLoop]: Abstraction has 37860 states and 123683 transitions. [2019-12-27 20:11:46,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:11:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 37860 states and 123683 transitions. [2019-12-27 20:11:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:11:46,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:46,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:46,517 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:46,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash 600531203, now seen corresponding path program 1 times [2019-12-27 20:11:46,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:46,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551328016] [2019-12-27 20:11:46,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:46,616 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 20:11:46,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551328016] [2019-12-27 20:11:46,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:46,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:11:46,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971330294] [2019-12-27 20:11:46,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:46,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:46,622 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:11:46,622 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:46,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:46,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:11:46,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:46,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:11:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:11:46,624 INFO L87 Difference]: Start difference. First operand 37860 states and 123683 transitions. Second operand 4 states. [2019-12-27 20:11:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:47,012 INFO L93 Difference]: Finished difference Result 45671 states and 148239 transitions. [2019-12-27 20:11:47,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:11:47,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:11:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:47,104 INFO L225 Difference]: With dead ends: 45671 [2019-12-27 20:11:47,105 INFO L226 Difference]: Without dead ends: 45671 [2019-12-27 20:11:47,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:11:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45671 states. [2019-12-27 20:11:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45671 to 37589. [2019-12-27 20:11:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37589 states. [2019-12-27 20:11:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37589 states to 37589 states and 122601 transitions. [2019-12-27 20:11:48,715 INFO L78 Accepts]: Start accepts. Automaton has 37589 states and 122601 transitions. Word has length 16 [2019-12-27 20:11:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:48,715 INFO L462 AbstractCegarLoop]: Abstraction has 37589 states and 122601 transitions. [2019-12-27 20:11:48,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:11:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 37589 states and 122601 transitions. [2019-12-27 20:11:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:11:48,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:48,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:48,725 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:48,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2018922146, now seen corresponding path program 1 times [2019-12-27 20:11:48,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:48,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254502522] [2019-12-27 20:11:48,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:48,863 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 20:11:48,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254502522] [2019-12-27 20:11:48,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:48,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:48,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771094773] [2019-12-27 20:11:48,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:48,874 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:48,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 20:11:48,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:48,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:48,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:11:48,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:48,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:11:48,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:11:48,886 INFO L87 Difference]: Start difference. First operand 37589 states and 122601 transitions. Second operand 5 states. [2019-12-27 20:11:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:49,572 INFO L93 Difference]: Finished difference Result 56482 states and 180914 transitions. [2019-12-27 20:11:49,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:11:49,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:11:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:49,688 INFO L225 Difference]: With dead ends: 56482 [2019-12-27 20:11:49,689 INFO L226 Difference]: Without dead ends: 56426 [2019-12-27 20:11:49,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:11:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56426 states. [2019-12-27 20:11:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56426 to 39475. [2019-12-27 20:11:50,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39475 states. [2019-12-27 20:11:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39475 states to 39475 states and 128727 transitions. [2019-12-27 20:11:50,476 INFO L78 Accepts]: Start accepts. Automaton has 39475 states and 128727 transitions. Word has length 22 [2019-12-27 20:11:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:50,477 INFO L462 AbstractCegarLoop]: Abstraction has 39475 states and 128727 transitions. [2019-12-27 20:11:50,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:11:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 39475 states and 128727 transitions. [2019-12-27 20:11:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:11:50,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:50,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:50,485 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2018828929, now seen corresponding path program 1 times [2019-12-27 20:11:50,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:50,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980434710] [2019-12-27 20:11:50,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:50,555 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 20:11:50,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980434710] [2019-12-27 20:11:50,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:50,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:50,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671094230] [2019-12-27 20:11:50,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:50,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:50,566 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 20:11:50,566 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:50,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:50,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:11:50,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:50,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:11:50,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:11:50,568 INFO L87 Difference]: Start difference. First operand 39475 states and 128727 transitions. Second operand 5 states. [2019-12-27 20:11:51,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:51,309 INFO L93 Difference]: Finished difference Result 58667 states and 187217 transitions. [2019-12-27 20:11:51,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:11:51,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:11:51,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:51,470 INFO L225 Difference]: With dead ends: 58667 [2019-12-27 20:11:51,471 INFO L226 Difference]: Without dead ends: 58611 [2019-12-27 20:11:51,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:11:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58611 states. [2019-12-27 20:11:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58611 to 36929. [2019-12-27 20:11:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36929 states. [2019-12-27 20:11:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36929 states to 36929 states and 120183 transitions. [2019-12-27 20:11:53,151 INFO L78 Accepts]: Start accepts. Automaton has 36929 states and 120183 transitions. Word has length 22 [2019-12-27 20:11:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:53,152 INFO L462 AbstractCegarLoop]: Abstraction has 36929 states and 120183 transitions. [2019-12-27 20:11:53,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:11:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 36929 states and 120183 transitions. [2019-12-27 20:11:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:11:53,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:53,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:53,164 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:53,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash -730444715, now seen corresponding path program 1 times [2019-12-27 20:11:53,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:53,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92391026] [2019-12-27 20:11:53,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:53,254 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 20:11:53,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92391026] [2019-12-27 20:11:53,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:53,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:53,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1079535956] [2019-12-27 20:11:53,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:53,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:53,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:11:53,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:53,270 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:53,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:11:53,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:53,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:11:53,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:11:53,271 INFO L87 Difference]: Start difference. First operand 36929 states and 120183 transitions. Second operand 5 states. [2019-12-27 20:11:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:53,874 INFO L93 Difference]: Finished difference Result 52105 states and 165736 transitions. [2019-12-27 20:11:53,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:11:53,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:11:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:53,959 INFO L225 Difference]: With dead ends: 52105 [2019-12-27 20:11:53,959 INFO L226 Difference]: Without dead ends: 52092 [2019-12-27 20:11:53,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:11:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52092 states. [2019-12-27 20:11:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52092 to 43014. [2019-12-27 20:11:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43014 states. [2019-12-27 20:11:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43014 states to 43014 states and 139482 transitions. [2019-12-27 20:11:56,850 INFO L78 Accepts]: Start accepts. Automaton has 43014 states and 139482 transitions. Word has length 25 [2019-12-27 20:11:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:56,850 INFO L462 AbstractCegarLoop]: Abstraction has 43014 states and 139482 transitions. [2019-12-27 20:11:56,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:11:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 43014 states and 139482 transitions. [2019-12-27 20:11:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:11:56,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:56,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:56,863 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash -309567519, now seen corresponding path program 1 times [2019-12-27 20:11:56,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:56,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244365011] [2019-12-27 20:11:56,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:56,903 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 20:11:56,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244365011] [2019-12-27 20:11:56,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:56,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:56,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2022211112] [2019-12-27 20:11:56,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:56,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:56,915 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:11:56,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:56,916 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:56,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:11:56,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:11:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:11:56,917 INFO L87 Difference]: Start difference. First operand 43014 states and 139482 transitions. Second operand 3 states. [2019-12-27 20:11:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:57,269 INFO L93 Difference]: Finished difference Result 65941 states and 213004 transitions. [2019-12-27 20:11:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:11:57,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 20:11:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:57,436 INFO L225 Difference]: With dead ends: 65941 [2019-12-27 20:11:57,436 INFO L226 Difference]: Without dead ends: 65941 [2019-12-27 20:11:57,436 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 20:11:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65941 states. [2019-12-27 20:11:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65941 to 50347. [2019-12-27 20:11:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50347 states. [2019-12-27 20:11:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50347 states to 50347 states and 164069 transitions. [2019-12-27 20:11:58,833 INFO L78 Accepts]: Start accepts. Automaton has 50347 states and 164069 transitions. Word has length 27 [2019-12-27 20:11:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:58,834 INFO L462 AbstractCegarLoop]: Abstraction has 50347 states and 164069 transitions. [2019-12-27 20:11:58,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:11:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 50347 states and 164069 transitions. [2019-12-27 20:11:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:11:58,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:58,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:58,849 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:58,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1484978850, now seen corresponding path program 1 times [2019-12-27 20:11:58,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:58,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791760346] [2019-12-27 20:11:58,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:58,886 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 20:11:58,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791760346] [2019-12-27 20:11:58,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:58,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:58,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [312728466] [2019-12-27 20:11:58,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:58,892 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:58,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:11:58,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:58,898 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:58,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:11:58,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:58,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:11:58,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:11:58,899 INFO L87 Difference]: Start difference. First operand 50347 states and 164069 transitions. Second operand 3 states. [2019-12-27 20:11:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:59,247 INFO L93 Difference]: Finished difference Result 65941 states and 207511 transitions. [2019-12-27 20:11:59,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:11:59,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 20:11:59,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:59,402 INFO L225 Difference]: With dead ends: 65941 [2019-12-27 20:11:59,403 INFO L226 Difference]: Without dead ends: 65941 [2019-12-27 20:11:59,403 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 20:11:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65941 states. [2019-12-27 20:12:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65941 to 50347. [2019-12-27 20:12:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50347 states. [2019-12-27 20:12:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50347 states to 50347 states and 158576 transitions. [2019-12-27 20:12:00,311 INFO L78 Accepts]: Start accepts. Automaton has 50347 states and 158576 transitions. Word has length 27 [2019-12-27 20:12:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:00,311 INFO L462 AbstractCegarLoop]: Abstraction has 50347 states and 158576 transitions. [2019-12-27 20:12:00,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 50347 states and 158576 transitions. [2019-12-27 20:12:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:12:00,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:00,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:00,326 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:00,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1430659206, now seen corresponding path program 1 times [2019-12-27 20:12:00,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:00,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203486633] [2019-12-27 20:12:00,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:00,747 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 20:12:00,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203486633] [2019-12-27 20:12:00,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:00,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:12:00,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1287007917] [2019-12-27 20:12:00,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:00,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:00,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:12:00,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:00,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:00,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:12:00,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:00,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:12:00,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:00,761 INFO L87 Difference]: Start difference. First operand 50347 states and 158576 transitions. Second operand 5 states. [2019-12-27 20:12:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:01,246 INFO L93 Difference]: Finished difference Result 61716 states and 192056 transitions. [2019-12-27 20:12:01,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:12:01,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 20:12:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:01,344 INFO L225 Difference]: With dead ends: 61716 [2019-12-27 20:12:01,344 INFO L226 Difference]: Without dead ends: 61540 [2019-12-27 20:12:01,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:12:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61540 states. [2019-12-27 20:12:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61540 to 54795. [2019-12-27 20:12:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54795 states. [2019-12-27 20:12:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54795 states to 54795 states and 172182 transitions. [2019-12-27 20:12:02,265 INFO L78 Accepts]: Start accepts. Automaton has 54795 states and 172182 transitions. Word has length 27 [2019-12-27 20:12:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:02,265 INFO L462 AbstractCegarLoop]: Abstraction has 54795 states and 172182 transitions. [2019-12-27 20:12:02,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:12:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 54795 states and 172182 transitions. [2019-12-27 20:12:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:12:02,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:02,282 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] [2019-12-27 20:12:02,282 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:02,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:02,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1923083153, now seen corresponding path program 1 times [2019-12-27 20:12:02,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:02,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526373265] [2019-12-27 20:12:02,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:02,330 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 20:12:02,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526373265] [2019-12-27 20:12:02,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:02,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:12:02,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72648761] [2019-12-27 20:12:02,331 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:02,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:02,349 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 116 transitions. [2019-12-27 20:12:02,349 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:02,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:02,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:12:02,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:02,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:12:02,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:02,351 INFO L87 Difference]: Start difference. First operand 54795 states and 172182 transitions. Second operand 3 states. [2019-12-27 20:12:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:03,009 INFO L93 Difference]: Finished difference Result 54744 states and 172030 transitions. [2019-12-27 20:12:03,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:03,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-27 20:12:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:03,090 INFO L225 Difference]: With dead ends: 54744 [2019-12-27 20:12:03,090 INFO L226 Difference]: Without dead ends: 54744 [2019-12-27 20:12:03,090 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 20:12:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54744 states. [2019-12-27 20:12:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54744 to 54744. [2019-12-27 20:12:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54744 states. [2019-12-27 20:12:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54744 states to 54744 states and 172030 transitions. [2019-12-27 20:12:03,907 INFO L78 Accepts]: Start accepts. Automaton has 54744 states and 172030 transitions. Word has length 28 [2019-12-27 20:12:03,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:03,908 INFO L462 AbstractCegarLoop]: Abstraction has 54744 states and 172030 transitions. [2019-12-27 20:12:03,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 54744 states and 172030 transitions. [2019-12-27 20:12:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:12:03,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:03,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:03,926 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:03,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1720505979, now seen corresponding path program 1 times [2019-12-27 20:12:03,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:03,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976708013] [2019-12-27 20:12:03,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:04,003 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 20:12:04,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976708013] [2019-12-27 20:12:04,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:04,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:12:04,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602744492] [2019-12-27 20:12:04,004 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:04,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:04,016 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 20:12:04,016 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:04,016 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:04,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:12:04,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:04,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:12:04,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:04,017 INFO L87 Difference]: Start difference. First operand 54744 states and 172030 transitions. Second operand 5 states. [2019-12-27 20:12:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:04,312 INFO L93 Difference]: Finished difference Result 70784 states and 220798 transitions. [2019-12-27 20:12:04,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:12:04,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:12:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:04,427 INFO L225 Difference]: With dead ends: 70784 [2019-12-27 20:12:04,427 INFO L226 Difference]: Without dead ends: 70784 [2019-12-27 20:12:04,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:12:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70784 states. [2019-12-27 20:12:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70784 to 55890. [2019-12-27 20:12:05,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55890 states. [2019-12-27 20:12:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55890 states to 55890 states and 175322 transitions. [2019-12-27 20:12:05,893 INFO L78 Accepts]: Start accepts. Automaton has 55890 states and 175322 transitions. Word has length 28 [2019-12-27 20:12:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:05,893 INFO L462 AbstractCegarLoop]: Abstraction has 55890 states and 175322 transitions. [2019-12-27 20:12:05,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:12:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 55890 states and 175322 transitions. [2019-12-27 20:12:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 20:12:05,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:05,911 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 20:12:05,911 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash 395930080, now seen corresponding path program 1 times [2019-12-27 20:12:05,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:05,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240286494] [2019-12-27 20:12:05,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:05,989 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 20:12:05,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240286494] [2019-12-27 20:12:05,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:05,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:12:05,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [402976138] [2019-12-27 20:12:05,990 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:05,996 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:06,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 59 transitions. [2019-12-27 20:12:06,007 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:06,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:12:06,175 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:12:06,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:12:06,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:06,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:12:06,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:12:06,176 INFO L87 Difference]: Start difference. First operand 55890 states and 175322 transitions. Second operand 7 states. [2019-12-27 20:12:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:07,353 INFO L93 Difference]: Finished difference Result 76456 states and 237590 transitions. [2019-12-27 20:12:07,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:12:07,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-27 20:12:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:07,484 INFO L225 Difference]: With dead ends: 76456 [2019-12-27 20:12:07,485 INFO L226 Difference]: Without dead ends: 76456 [2019-12-27 20:12:07,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:12:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76456 states. [2019-12-27 20:12:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76456 to 66515. [2019-12-27 20:12:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66515 states. [2019-12-27 20:12:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66515 states to 66515 states and 208576 transitions. [2019-12-27 20:12:08,980 INFO L78 Accepts]: Start accepts. Automaton has 66515 states and 208576 transitions. Word has length 29 [2019-12-27 20:12:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:08,980 INFO L462 AbstractCegarLoop]: Abstraction has 66515 states and 208576 transitions. [2019-12-27 20:12:08,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:12:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 66515 states and 208576 transitions. [2019-12-27 20:12:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 20:12:09,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:09,002 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 20:12:09,002 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:09,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:09,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1894062912, now seen corresponding path program 1 times [2019-12-27 20:12:09,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:09,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406867857] [2019-12-27 20:12:09,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:09,076 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 20:12:09,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406867857] [2019-12-27 20:12:09,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:09,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:12:09,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216768597] [2019-12-27 20:12:09,077 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:09,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:09,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 20:12:09,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:09,090 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:09,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:12:09,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:09,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:12:09,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:09,090 INFO L87 Difference]: Start difference. First operand 66515 states and 208576 transitions. Second operand 5 states. [2019-12-27 20:12:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:09,617 INFO L93 Difference]: Finished difference Result 77864 states and 241325 transitions. [2019-12-27 20:12:09,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:12:09,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 20:12:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:09,741 INFO L225 Difference]: With dead ends: 77864 [2019-12-27 20:12:09,741 INFO L226 Difference]: Without dead ends: 77680 [2019-12-27 20:12:09,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:12:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77680 states. [2019-12-27 20:12:11,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77680 to 67079. [2019-12-27 20:12:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67079 states. [2019-12-27 20:12:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67079 states to 67079 states and 210199 transitions. [2019-12-27 20:12:11,450 INFO L78 Accepts]: Start accepts. Automaton has 67079 states and 210199 transitions. Word has length 29 [2019-12-27 20:12:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:11,451 INFO L462 AbstractCegarLoop]: Abstraction has 67079 states and 210199 transitions. [2019-12-27 20:12:11,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:12:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 67079 states and 210199 transitions. [2019-12-27 20:12:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 20:12:11,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:11,477 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] [2019-12-27 20:12:11,477 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:11,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:11,477 INFO L82 PathProgramCache]: Analyzing trace with hash 383073557, now seen corresponding path program 1 times [2019-12-27 20:12:11,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:11,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713906971] [2019-12-27 20:12:11,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:11,536 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 20:12:11,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713906971] [2019-12-27 20:12:11,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:11,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:12:11,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1504582992] [2019-12-27 20:12:11,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:11,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:11,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 110 transitions. [2019-12-27 20:12:11,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:11,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:12:11,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:12:11,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:12:11,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:11,560 INFO L87 Difference]: Start difference. First operand 67079 states and 210199 transitions. Second operand 5 states. [2019-12-27 20:12:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:12,431 INFO L93 Difference]: Finished difference Result 91317 states and 282923 transitions. [2019-12-27 20:12:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:12:12,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 20:12:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:12,590 INFO L225 Difference]: With dead ends: 91317 [2019-12-27 20:12:12,590 INFO L226 Difference]: Without dead ends: 91310 [2019-12-27 20:12:12,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:12:12,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91310 states. [2019-12-27 20:12:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91310 to 72300. [2019-12-27 20:12:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72300 states. [2019-12-27 20:12:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72300 states to 72300 states and 227025 transitions. [2019-12-27 20:12:14,527 INFO L78 Accepts]: Start accepts. Automaton has 72300 states and 227025 transitions. Word has length 30 [2019-12-27 20:12:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:14,527 INFO L462 AbstractCegarLoop]: Abstraction has 72300 states and 227025 transitions. [2019-12-27 20:12:14,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:12:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 72300 states and 227025 transitions. [2019-12-27 20:12:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 20:12:14,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:14,569 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] [2019-12-27 20:12:14,569 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:14,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:14,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1125685633, now seen corresponding path program 1 times [2019-12-27 20:12:14,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:14,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746421017] [2019-12-27 20:12:14,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:14,629 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 20:12:14,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746421017] [2019-12-27 20:12:14,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:14,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:12:14,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [998244053] [2019-12-27 20:12:14,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:14,635 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:14,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 60 transitions. [2019-12-27 20:12:14,646 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:14,646 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:14,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:12:14,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:14,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:12:14,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:14,648 INFO L87 Difference]: Start difference. First operand 72300 states and 227025 transitions. Second operand 5 states. [2019-12-27 20:12:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:14,821 INFO L93 Difference]: Finished difference Result 36862 states and 109767 transitions. [2019-12-27 20:12:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:12:14,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 20:12:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:14,867 INFO L225 Difference]: With dead ends: 36862 [2019-12-27 20:12:14,867 INFO L226 Difference]: Without dead ends: 32158 [2019-12-27 20:12:14,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:12:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32158 states. [2019-12-27 20:12:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32158 to 29774. [2019-12-27 20:12:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29774 states. [2019-12-27 20:12:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29774 states to 29774 states and 88551 transitions. [2019-12-27 20:12:15,312 INFO L78 Accepts]: Start accepts. Automaton has 29774 states and 88551 transitions. Word has length 30 [2019-12-27 20:12:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:15,313 INFO L462 AbstractCegarLoop]: Abstraction has 29774 states and 88551 transitions. [2019-12-27 20:12:15,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:12:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 29774 states and 88551 transitions. [2019-12-27 20:12:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:12:15,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:15,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:15,335 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:15,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:15,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1323394120, now seen corresponding path program 1 times [2019-12-27 20:12:15,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:15,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925183012] [2019-12-27 20:12:15,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:15,427 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 20:12:15,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925183012] [2019-12-27 20:12:15,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:15,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:12:15,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1704822740] [2019-12-27 20:12:15,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:15,436 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:15,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 20:12:15,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:15,449 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:15,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:12:15,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:15,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:12:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:12:15,451 INFO L87 Difference]: Start difference. First operand 29774 states and 88551 transitions. Second operand 6 states. [2019-12-27 20:12:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:16,146 INFO L93 Difference]: Finished difference Result 37417 states and 109732 transitions. [2019-12-27 20:12:16,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:12:16,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 20:12:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:16,197 INFO L225 Difference]: With dead ends: 37417 [2019-12-27 20:12:16,197 INFO L226 Difference]: Without dead ends: 37096 [2019-12-27 20:12:16,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:12:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37096 states. [2019-12-27 20:12:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37096 to 30982. [2019-12-27 20:12:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30982 states. [2019-12-27 20:12:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30982 states to 30982 states and 92059 transitions. [2019-12-27 20:12:16,657 INFO L78 Accepts]: Start accepts. Automaton has 30982 states and 92059 transitions. Word has length 33 [2019-12-27 20:12:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:16,657 INFO L462 AbstractCegarLoop]: Abstraction has 30982 states and 92059 transitions. [2019-12-27 20:12:16,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:12:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30982 states and 92059 transitions. [2019-12-27 20:12:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 20:12:16,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:16,682 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] [2019-12-27 20:12:16,682 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1896595454, now seen corresponding path program 1 times [2019-12-27 20:12:16,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:16,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329413875] [2019-12-27 20:12:16,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:16,778 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 20:12:16,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329413875] [2019-12-27 20:12:16,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:16,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:12:16,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142509574] [2019-12-27 20:12:16,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:16,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:16,801 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 63 transitions. [2019-12-27 20:12:16,801 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:16,801 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:16,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:12:16,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:16,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:12:16,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:12:16,802 INFO L87 Difference]: Start difference. First operand 30982 states and 92059 transitions. Second operand 6 states. [2019-12-27 20:12:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:17,672 INFO L93 Difference]: Finished difference Result 37919 states and 111079 transitions. [2019-12-27 20:12:17,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:12:17,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 20:12:17,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:17,721 INFO L225 Difference]: With dead ends: 37919 [2019-12-27 20:12:17,721 INFO L226 Difference]: Without dead ends: 37544 [2019-12-27 20:12:17,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:12:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37544 states. [2019-12-27 20:12:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37544 to 29872. [2019-12-27 20:12:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29872 states. [2019-12-27 20:12:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29872 states to 29872 states and 88864 transitions. [2019-12-27 20:12:18,173 INFO L78 Accepts]: Start accepts. Automaton has 29872 states and 88864 transitions. Word has length 35 [2019-12-27 20:12:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:18,173 INFO L462 AbstractCegarLoop]: Abstraction has 29872 states and 88864 transitions. [2019-12-27 20:12:18,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:12:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 29872 states and 88864 transitions. [2019-12-27 20:12:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:12:18,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:18,201 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] [2019-12-27 20:12:18,202 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:18,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:18,202 INFO L82 PathProgramCache]: Analyzing trace with hash 384052449, now seen corresponding path program 1 times [2019-12-27 20:12:18,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:18,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820885298] [2019-12-27 20:12:18,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:18,253 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 20:12:18,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820885298] [2019-12-27 20:12:18,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:18,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:12:18,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [949552534] [2019-12-27 20:12:18,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:18,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:18,341 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 354 transitions. [2019-12-27 20:12:18,341 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:18,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:12:18,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:12:18,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:18,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:12:18,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:12:18,414 INFO L87 Difference]: Start difference. First operand 29872 states and 88864 transitions. Second operand 7 states. [2019-12-27 20:12:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:18,892 INFO L93 Difference]: Finished difference Result 56540 states and 168840 transitions. [2019-12-27 20:12:18,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:12:18,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 20:12:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:18,934 INFO L225 Difference]: With dead ends: 56540 [2019-12-27 20:12:18,934 INFO L226 Difference]: Without dead ends: 30690 [2019-12-27 20:12:18,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:12:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30690 states. [2019-12-27 20:12:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30690 to 25584. [2019-12-27 20:12:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25584 states. [2019-12-27 20:12:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25584 states to 25584 states and 74973 transitions. [2019-12-27 20:12:19,318 INFO L78 Accepts]: Start accepts. Automaton has 25584 states and 74973 transitions. Word has length 40 [2019-12-27 20:12:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:19,318 INFO L462 AbstractCegarLoop]: Abstraction has 25584 states and 74973 transitions. [2019-12-27 20:12:19,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:12:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 25584 states and 74973 transitions. [2019-12-27 20:12:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:12:19,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:19,342 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] [2019-12-27 20:12:19,342 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1462223457, now seen corresponding path program 2 times [2019-12-27 20:12:19,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:19,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818564696] [2019-12-27 20:12:19,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:19,392 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 20:12:19,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818564696] [2019-12-27 20:12:19,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:19,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:12:19,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [829218237] [2019-12-27 20:12:19,393 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:19,402 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:19,429 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 104 transitions. [2019-12-27 20:12:19,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:19,431 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:12:19,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:12:19,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:19,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:12:19,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:12:19,432 INFO L87 Difference]: Start difference. First operand 25584 states and 74973 transitions. Second operand 4 states. [2019-12-27 20:12:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:19,600 INFO L93 Difference]: Finished difference Result 43709 states and 128402 transitions. [2019-12-27 20:12:19,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:12:19,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 20:12:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:19,631 INFO L225 Difference]: With dead ends: 43709 [2019-12-27 20:12:19,631 INFO L226 Difference]: Without dead ends: 21361 [2019-12-27 20:12:19,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21361 states. [2019-12-27 20:12:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21361 to 21188. [2019-12-27 20:12:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21188 states. [2019-12-27 20:12:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21188 states to 21188 states and 60700 transitions. [2019-12-27 20:12:19,917 INFO L78 Accepts]: Start accepts. Automaton has 21188 states and 60700 transitions. Word has length 40 [2019-12-27 20:12:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:19,917 INFO L462 AbstractCegarLoop]: Abstraction has 21188 states and 60700 transitions. [2019-12-27 20:12:19,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:12:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 21188 states and 60700 transitions. [2019-12-27 20:12:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:12:19,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:19,939 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] [2019-12-27 20:12:19,939 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:19,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:19,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1281999815, now seen corresponding path program 3 times [2019-12-27 20:12:19,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:19,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469908665] [2019-12-27 20:12:19,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:20,094 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 20:12:20,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469908665] [2019-12-27 20:12:20,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:20,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:12:20,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2076125904] [2019-12-27 20:12:20,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:20,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:20,168 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 345 transitions. [2019-12-27 20:12:20,168 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:20,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:12:20,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:12:20,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:20,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:12:20,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:20,171 INFO L87 Difference]: Start difference. First operand 21188 states and 60700 transitions. Second operand 3 states. [2019-12-27 20:12:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:20,237 INFO L93 Difference]: Finished difference Result 21117 states and 60470 transitions. [2019-12-27 20:12:20,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:20,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 20:12:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:20,264 INFO L225 Difference]: With dead ends: 21117 [2019-12-27 20:12:20,264 INFO L226 Difference]: Without dead ends: 21117 [2019-12-27 20:12:20,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21117 states. [2019-12-27 20:12:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21117 to 18590. [2019-12-27 20:12:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18590 states. [2019-12-27 20:12:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18590 states to 18590 states and 53999 transitions. [2019-12-27 20:12:20,544 INFO L78 Accepts]: Start accepts. Automaton has 18590 states and 53999 transitions. Word has length 40 [2019-12-27 20:12:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:20,545 INFO L462 AbstractCegarLoop]: Abstraction has 18590 states and 53999 transitions. [2019-12-27 20:12:20,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 18590 states and 53999 transitions. [2019-12-27 20:12:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:12:20,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:20,562 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] [2019-12-27 20:12:20,563 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash -886920520, now seen corresponding path program 1 times [2019-12-27 20:12:20,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:20,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053099507] [2019-12-27 20:12:20,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:20,613 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 20:12:20,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053099507] [2019-12-27 20:12:20,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:20,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:12:20,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550530902] [2019-12-27 20:12:20,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:20,623 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:20,668 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 108 states and 187 transitions. [2019-12-27 20:12:20,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:20,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:12:20,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:12:20,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:20,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:12:20,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:12:20,679 INFO L87 Difference]: Start difference. First operand 18590 states and 53999 transitions. Second operand 4 states. [2019-12-27 20:12:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:20,771 INFO L93 Difference]: Finished difference Result 14947 states and 42143 transitions. [2019-12-27 20:12:20,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:20,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 20:12:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:20,805 INFO L225 Difference]: With dead ends: 14947 [2019-12-27 20:12:20,805 INFO L226 Difference]: Without dead ends: 14947 [2019-12-27 20:12:20,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:12:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2019-12-27 20:12:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 14804. [2019-12-27 20:12:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14804 states. [2019-12-27 20:12:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14804 states to 14804 states and 41755 transitions. [2019-12-27 20:12:21,215 INFO L78 Accepts]: Start accepts. Automaton has 14804 states and 41755 transitions. Word has length 41 [2019-12-27 20:12:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:21,216 INFO L462 AbstractCegarLoop]: Abstraction has 14804 states and 41755 transitions. [2019-12-27 20:12:21,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:12:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 14804 states and 41755 transitions. [2019-12-27 20:12:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:12:21,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:21,242 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] [2019-12-27 20:12:21,243 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:21,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash 919425009, now seen corresponding path program 1 times [2019-12-27 20:12:21,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:21,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294111180] [2019-12-27 20:12:21,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:21,387 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 20:12:21,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294111180] [2019-12-27 20:12:21,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:21,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:12:21,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682725603] [2019-12-27 20:12:21,390 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:21,429 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:21,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 194 transitions. [2019-12-27 20:12:21,498 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:21,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:12:21,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:12:21,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:21,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:12:21,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:12:21,503 INFO L87 Difference]: Start difference. First operand 14804 states and 41755 transitions. Second operand 6 states. [2019-12-27 20:12:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:21,635 INFO L93 Difference]: Finished difference Result 13845 states and 39693 transitions. [2019-12-27 20:12:21,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:12:21,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 20:12:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:21,653 INFO L225 Difference]: With dead ends: 13845 [2019-12-27 20:12:21,653 INFO L226 Difference]: Without dead ends: 10612 [2019-12-27 20:12:21,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:12:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10612 states. [2019-12-27 20:12:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10612 to 10612. [2019-12-27 20:12:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10612 states. [2019-12-27 20:12:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10612 states to 10612 states and 32465 transitions. [2019-12-27 20:12:21,879 INFO L78 Accepts]: Start accepts. Automaton has 10612 states and 32465 transitions. Word has length 42 [2019-12-27 20:12:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:21,879 INFO L462 AbstractCegarLoop]: Abstraction has 10612 states and 32465 transitions. [2019-12-27 20:12:21,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:12:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 10612 states and 32465 transitions. [2019-12-27 20:12:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:12:21,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:21,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:21,893 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:21,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1971896379, now seen corresponding path program 1 times [2019-12-27 20:12:21,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:21,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062012107] [2019-12-27 20:12:21,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:21,969 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 20:12:21,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062012107] [2019-12-27 20:12:21,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:21,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:12:21,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048049858] [2019-12-27 20:12:21,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:22,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:22,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 422 transitions. [2019-12-27 20:12:22,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:22,264 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:12:22,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:12:22,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:12:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:12:22,265 INFO L87 Difference]: Start difference. First operand 10612 states and 32465 transitions. Second operand 6 states. [2019-12-27 20:12:22,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:22,450 INFO L93 Difference]: Finished difference Result 20307 states and 60988 transitions. [2019-12-27 20:12:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:12:22,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 20:12:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:22,470 INFO L225 Difference]: With dead ends: 20307 [2019-12-27 20:12:22,470 INFO L226 Difference]: Without dead ends: 14463 [2019-12-27 20:12:22,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:12:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14463 states. [2019-12-27 20:12:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14463 to 11908. [2019-12-27 20:12:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11908 states. [2019-12-27 20:12:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11908 states to 11908 states and 36093 transitions. [2019-12-27 20:12:22,721 INFO L78 Accepts]: Start accepts. Automaton has 11908 states and 36093 transitions. Word has length 66 [2019-12-27 20:12:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:22,721 INFO L462 AbstractCegarLoop]: Abstraction has 11908 states and 36093 transitions. [2019-12-27 20:12:22,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:12:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 11908 states and 36093 transitions. [2019-12-27 20:12:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:12:22,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:22,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:22,734 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:22,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 811898523, now seen corresponding path program 2 times [2019-12-27 20:12:22,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:22,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009188272] [2019-12-27 20:12:22,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:22,793 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 20:12:22,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009188272] [2019-12-27 20:12:22,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:22,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:12:22,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1113979135] [2019-12-27 20:12:22,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:22,815 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:23,033 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 435 transitions. [2019-12-27 20:12:23,033 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:23,034 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:12:23,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:12:23,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:23,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:12:23,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:23,035 INFO L87 Difference]: Start difference. First operand 11908 states and 36093 transitions. Second operand 3 states. [2019-12-27 20:12:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:23,111 INFO L93 Difference]: Finished difference Result 13444 states and 40549 transitions. [2019-12-27 20:12:23,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:23,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:12:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:23,127 INFO L225 Difference]: With dead ends: 13444 [2019-12-27 20:12:23,128 INFO L226 Difference]: Without dead ends: 13444 [2019-12-27 20:12:23,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 20:12:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13444 states. [2019-12-27 20:12:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13444 to 11299. [2019-12-27 20:12:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-27 20:12:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 34327 transitions. [2019-12-27 20:12:23,302 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 34327 transitions. Word has length 66 [2019-12-27 20:12:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:23,303 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 34327 transitions. [2019-12-27 20:12:23,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 34327 transitions. [2019-12-27 20:12:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:12:23,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:23,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:23,314 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1635669227, now seen corresponding path program 1 times [2019-12-27 20:12:23,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:23,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400049458] [2019-12-27 20:12:23,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:12:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:12:23,441 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:12:23,441 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:12:23,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= v_~z$r_buff0_thd3~0_83 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t415~0.base_28| 4) |v_#length_23|) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_29 0) (= 0 |v_ULTIMATE.start_main_~#t415~0.offset_22|) (= 0 v_~z$w_buff0~0_27) (= v_~main$tmp_guard0~0_12 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t415~0.base_28|) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~z$w_buff1~0_28) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t415~0.base_28| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t415~0.base_28|) |v_ULTIMATE.start_main_~#t415~0.offset_22| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$r_buff1_thd1~0_22) (= 0 v_~z$r_buff1_thd2~0_22) (= 0 v_~z$r_buff1_thd0~0_22) (= v_~z$mem_tmp~0_10 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t415~0.base_28| 1) |v_#valid_55|) (= 0 v_~z$w_buff1_used~0_74) (= v_~z~0_27 0) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z$r_buff0_thd2~0_21 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t415~0.base_28|)) (= v_~z$w_buff0_used~0_121 0) (= v_~z$r_buff0_thd0~0_23 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t415~0.offset=|v_ULTIMATE.start_main_~#t415~0.offset_22|, ULTIMATE.start_main_~#t417~0.base=|v_ULTIMATE.start_main_~#t417~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_12|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t416~0.base=|v_ULTIMATE.start_main_~#t416~0.base_28|, ULTIMATE.start_main_~#t416~0.offset=|v_ULTIMATE.start_main_~#t416~0.offset_22|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_22, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_~#t415~0.base=|v_ULTIMATE.start_main_~#t415~0.base_28|, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t417~0.offset=|v_ULTIMATE.start_main_~#t417~0.offset_17|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_12|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t415~0.offset, ULTIMATE.start_main_~#t417~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t416~0.base, ULTIMATE.start_main_~#t416~0.offset, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t415~0.base, ~x~0, ULTIMATE.start_main_~#t417~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:12:23,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L827-1-->L829: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t416~0.base_13|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t416~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t416~0.base_13|) |v_ULTIMATE.start_main_~#t416~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t416~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t416~0.offset_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t416~0.base_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t416~0.base_13| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t416~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t416~0.base=|v_ULTIMATE.start_main_~#t416~0.base_13|, ULTIMATE.start_main_~#t416~0.offset=|v_ULTIMATE.start_main_~#t416~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t416~0.base, ULTIMATE.start_main_~#t416~0.offset] because there is no mapped edge [2019-12-27 20:12:23,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t417~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t417~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t417~0.base_10|) |v_ULTIMATE.start_main_~#t417~0.offset_9| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t417~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t417~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t417~0.offset_9| 0) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t417~0.base_10| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t417~0.base_10| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t417~0.base=|v_ULTIMATE.start_main_~#t417~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t417~0.offset=|v_ULTIMATE.start_main_~#t417~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t417~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t417~0.offset] because there is no mapped edge [2019-12-27 20:12:23,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~z$r_buff1_thd3~0_Out1480368562 ~z$r_buff0_thd3~0_In1480368562) (= ~z$r_buff1_thd0~0_Out1480368562 ~z$r_buff0_thd0~0_In1480368562) (= ~x~0_In1480368562 ~__unbuffered_p0_EAX~0_Out1480368562) (= ~z$r_buff1_thd2~0_Out1480368562 ~z$r_buff0_thd2~0_In1480368562) (= ~z$r_buff0_thd1~0_Out1480368562 1) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1480368562 0)) (= ~z$r_buff0_thd1~0_In1480368562 ~z$r_buff1_thd1~0_Out1480368562)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1480368562, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1480368562, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1480368562, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1480368562, ~x~0=~x~0_In1480368562, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1480368562} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1480368562, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1480368562, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1480368562, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1480368562, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1480368562, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1480368562, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1480368562, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1480368562, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1480368562, ~x~0=~x~0_In1480368562, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1480368562} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:12:23,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out1242897951| |P1Thread1of1ForFork2_#t~ite10_Out1242897951|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1242897951 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In1242897951 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1242897951| ~z$w_buff1~0_In1242897951) .cse1 (not .cse2)) (and .cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out1242897951| ~z~0_In1242897951) (or .cse0 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1242897951, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1242897951, ~z$w_buff1~0=~z$w_buff1~0_In1242897951, ~z~0=~z~0_In1242897951} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1242897951|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1242897951, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1242897951|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1242897951, ~z$w_buff1~0=~z$w_buff1~0_In1242897951, ~z~0=~z~0_In1242897951} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:12:23,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-629221283 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-629221283 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-629221283|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-629221283 |P1Thread1of1ForFork2_#t~ite11_Out-629221283|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-629221283, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-629221283} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-629221283, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-629221283|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-629221283} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:12:23,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1695469732 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1695469732 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1695469732 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1695469732 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1695469732| ~z$w_buff1_used~0_In-1695469732) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1695469732| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1695469732, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1695469732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1695469732, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1695469732} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1695469732, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1695469732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1695469732, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1695469732|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1695469732} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:12:23,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-72271890 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-72271890 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-72271890 |P1Thread1of1ForFork2_#t~ite13_Out-72271890|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-72271890| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-72271890, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-72271890} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-72271890, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-72271890|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-72271890} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:12:23,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L793-->L793-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1400981698 256)))) (or (and (= ~z$w_buff0~0_In-1400981698 |P2Thread1of1ForFork0_#t~ite21_Out-1400981698|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-1400981698| |P2Thread1of1ForFork0_#t~ite20_Out-1400981698|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1400981698 256)))) (or (= (mod ~z$w_buff0_used~0_In-1400981698 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-1400981698 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1400981698 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite20_Out-1400981698| |P2Thread1of1ForFork0_#t~ite21_Out-1400981698|) (= |P2Thread1of1ForFork0_#t~ite20_Out-1400981698| ~z$w_buff0~0_In-1400981698) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1400981698, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1400981698, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1400981698, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1400981698, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1400981698, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1400981698|, ~weak$$choice2~0=~weak$$choice2~0_In-1400981698} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1400981698|, ~z$w_buff0~0=~z$w_buff0~0_In-1400981698, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1400981698, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1400981698, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1400981698, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1400981698, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1400981698|, ~weak$$choice2~0=~weak$$choice2~0_In-1400981698} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 20:12:23,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L794-->L794-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-563839151 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-563839151| |P2Thread1of1ForFork0_#t~ite24_Out-563839151|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-563839151 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-563839151 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-563839151 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-563839151 256))))) (= ~z$w_buff1~0_In-563839151 |P2Thread1of1ForFork0_#t~ite23_Out-563839151|)) (and (= ~z$w_buff1~0_In-563839151 |P2Thread1of1ForFork0_#t~ite24_Out-563839151|) (= |P2Thread1of1ForFork0_#t~ite23_In-563839151| |P2Thread1of1ForFork0_#t~ite23_Out-563839151|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-563839151, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-563839151, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-563839151|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-563839151, ~z$w_buff1~0=~z$w_buff1~0_In-563839151, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-563839151, ~weak$$choice2~0=~weak$$choice2~0_In-563839151} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-563839151, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-563839151|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-563839151, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-563839151|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-563839151, ~z$w_buff1~0=~z$w_buff1~0_In-563839151, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-563839151, ~weak$$choice2~0=~weak$$choice2~0_In-563839151} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 20:12:23,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd3~0_72 v_~z$r_buff0_thd3~0_71)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_71, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:12:23,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 20:12:23,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1501700653 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1501700653 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1501700653 |P0Thread1of1ForFork1_#t~ite5_Out-1501700653|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1501700653| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1501700653, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1501700653} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1501700653|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1501700653, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1501700653} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:12:23,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1707501455 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1707501455 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1707501455 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1707501455 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1707501455| ~z$w_buff1_used~0_In-1707501455)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1707501455|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1707501455, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1707501455, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1707501455, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1707501455} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1707501455, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1707501455|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1707501455, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1707501455, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1707501455} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:12:23,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In137509571 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In137509571 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out137509571) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In137509571 ~z$r_buff0_thd1~0_Out137509571)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In137509571, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In137509571} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In137509571, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out137509571|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out137509571} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:12:23,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1523458567 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1523458567 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1523458567 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1523458567 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1523458567| ~z$r_buff1_thd1~0_In1523458567) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite8_Out1523458567| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1523458567, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1523458567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1523458567, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1523458567} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1523458567|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1523458567, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1523458567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1523458567, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1523458567} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:12:23,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L752-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_17 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:12:23,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1617437188 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1617437188 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1617437188| ~z~0_In1617437188) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1617437188| ~z$w_buff1~0_In1617437188) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1617437188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1617437188, ~z$w_buff1~0=~z$w_buff1~0_In1617437188, ~z~0=~z~0_In1617437188} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1617437188|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1617437188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1617437188, ~z$w_buff1~0=~z$w_buff1~0_In1617437188, ~z~0=~z~0_In1617437188} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:12:23,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 20:12:23,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2074424584 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-2074424584 256) 0))) (or (and (= ~z$w_buff0_used~0_In-2074424584 |P2Thread1of1ForFork0_#t~ite40_Out-2074424584|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-2074424584|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2074424584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2074424584} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2074424584, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-2074424584|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2074424584} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:12:23,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1896050819 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1896050819 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1896050819 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1896050819 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-1896050819| ~z$w_buff1_used~0_In-1896050819)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1896050819|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1896050819, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1896050819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1896050819, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1896050819} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1896050819, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1896050819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1896050819, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1896050819, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1896050819|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:12:23,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1705505880 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1705505880 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In1705505880 |P2Thread1of1ForFork0_#t~ite42_Out1705505880|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1705505880|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1705505880, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1705505880} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1705505880, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1705505880, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1705505880|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:12:23,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In895535181 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In895535181 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In895535181 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In895535181 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out895535181| ~z$r_buff1_thd3~0_In895535181) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out895535181| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In895535181, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In895535181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In895535181, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In895535181} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out895535181|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In895535181, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In895535181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In895535181, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In895535181} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:12:23,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:12:23,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-555622129 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-555622129 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-555622129 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-555622129 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-555622129 |P1Thread1of1ForFork2_#t~ite14_Out-555622129|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-555622129|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-555622129, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-555622129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-555622129, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-555622129} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-555622129, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-555622129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-555622129, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-555622129|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-555622129} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:12:23,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:12:23,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= (mod v_~z$w_buff0_used~0_95 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:12:23,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In36651856 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In36651856 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out36651856| ~z$w_buff1~0_In36651856) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In36651856 |ULTIMATE.start_main_#t~ite47_Out36651856|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In36651856, ~z$w_buff1_used~0=~z$w_buff1_used~0_In36651856, ~z$w_buff1~0=~z$w_buff1~0_In36651856, ~z~0=~z~0_In36651856} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In36651856, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out36651856|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In36651856, ~z$w_buff1~0=~z$w_buff1~0_In36651856, ~z~0=~z~0_In36651856} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:12:23,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 20:12:23,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-32390208 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-32390208 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-32390208 |ULTIMATE.start_main_#t~ite49_Out-32390208|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-32390208| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-32390208, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-32390208} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-32390208, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-32390208, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-32390208|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:12:23,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In638640096 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In638640096 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In638640096 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In638640096 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out638640096| ~z$w_buff1_used~0_In638640096) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out638640096| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In638640096, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638640096, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In638640096, ~z$w_buff1_used~0=~z$w_buff1_used~0_In638640096} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out638640096|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In638640096, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638640096, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In638640096, ~z$w_buff1_used~0=~z$w_buff1_used~0_In638640096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:12:23,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In878973973 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In878973973 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out878973973| ~z$r_buff0_thd0~0_In878973973) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out878973973| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In878973973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In878973973} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In878973973, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out878973973|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In878973973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:12:23,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1352066232 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1352066232 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1352066232 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1352066232 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1352066232|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In1352066232 |ULTIMATE.start_main_#t~ite52_Out1352066232|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1352066232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1352066232, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1352066232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1352066232} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1352066232|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1352066232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1352066232, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1352066232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1352066232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:12:23,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [892] [892] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite52_14| v_~z$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~__unbuffered_p2_EBX~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_10) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:12:23,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:12:23 BasicIcfg [2019-12-27 20:12:23,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:12:23,590 INFO L168 Benchmark]: Toolchain (without parser) took 97542.60 ms. Allocated memory was 145.2 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 101.6 MB in the beginning and 953.4 MB in the end (delta: -851.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 20:12:23,591 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 20:12:23,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.45 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.2 MB in the beginning and 156.0 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:23,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.94 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 153.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:23,592 INFO L168 Benchmark]: Boogie Preprocessor took 40.44 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:23,593 INFO L168 Benchmark]: RCFGBuilder took 820.45 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 99.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:23,593 INFO L168 Benchmark]: TraceAbstraction took 95776.82 ms. Allocated memory was 202.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 99.9 MB in the beginning and 953.4 MB in the end (delta: -853.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 20:12:23,597 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 827.45 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.2 MB in the beginning and 156.0 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.94 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 153.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.44 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.45 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 99.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95776.82 ms. Allocated memory was 202.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 99.9 MB in the beginning and 953.4 MB in the end (delta: -853.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6931 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 92501 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t415, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t416, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] FCALL, FORK 0 pthread_create(&t417, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L770] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 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 [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 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 [L840] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 95.4s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4669 SDtfs, 5174 SDslu, 7982 SDs, 0 SdLazy, 4594 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 61 SyntacticMatches, 26 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148037occurred 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: 45.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 196870 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 853 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 105268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...