/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/mix042_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:13:15,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:13:15,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:13:15,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:13:15,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:13:15,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:13:15,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:13:15,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:13:15,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:13:15,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:13:15,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:13:15,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:13:15,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:13:15,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:13:15,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:13:15,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:13:15,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:13:15,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:13:15,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:13:15,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:13:15,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:13:15,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:13:15,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:13:15,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:13:15,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:13:15,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:13:15,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:13:15,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:13:15,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:13:15,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:13:15,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:13:15,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:13:15,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:13:15,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:13:15,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:13:15,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:13:15,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:13:15,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:13:15,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:13:15,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:13:15,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:13:15,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:13:15,941 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:13:15,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:13:15,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:13:15,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:13:15,943 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:13:15,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:13:15,944 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:13:15,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:13:15,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:13:15,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:13:15,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:13:15,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:13:15,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:13:15,945 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:13:15,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:13:15,945 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:13:15,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:13:15,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:13:15,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:13:15,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:13:15,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:13:15,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:13:15,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:13:15,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:13:15,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:13:15,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:13:15,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:13:15,949 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:13:15,949 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:13:15,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:13:15,951 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:13:15,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:13:16,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:13:16,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:13:16,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:13:16,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:13:16,266 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:13:16,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i [2019-12-27 21:13:16,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49ae95f7/dc4ad0f5139a4d4aa03776d4670b291c/FLAG7ee7b29ab [2019-12-27 21:13:16,883 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:13:16,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i [2019-12-27 21:13:16,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49ae95f7/dc4ad0f5139a4d4aa03776d4670b291c/FLAG7ee7b29ab [2019-12-27 21:13:17,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49ae95f7/dc4ad0f5139a4d4aa03776d4670b291c [2019-12-27 21:13:17,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:13:17,175 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:13:17,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:13:17,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:13:17,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:13:17,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:13:17" (1/1) ... [2019-12-27 21:13:17,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfdc9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:17, skipping insertion in model container [2019-12-27 21:13:17,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:13:17" (1/1) ... [2019-12-27 21:13:17,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:13:17,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:13:17,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:13:17,800 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:13:17,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:13:18,040 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:13:18,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18 WrapperNode [2019-12-27 21:13:18,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:13:18,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:13:18,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:13:18,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:13:18,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (1/1) ... [2019-12-27 21:13:18,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (1/1) ... [2019-12-27 21:13:18,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:13:18,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:13:18,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:13:18,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:13:18,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (1/1) ... [2019-12-27 21:13:18,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (1/1) ... [2019-12-27 21:13:18,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (1/1) ... [2019-12-27 21:13:18,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (1/1) ... [2019-12-27 21:13:18,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (1/1) ... [2019-12-27 21:13:18,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (1/1) ... [2019-12-27 21:13:18,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (1/1) ... [2019-12-27 21:13:18,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:13:18,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:13:18,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:13:18,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:13:18,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:13:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:13:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:13:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:13:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:13:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:13:18,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:13:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:13:18,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:13:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:13:18,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:13:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:13:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:13:18,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:13:18,308 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:13:19,086 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:13:19,086 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:13:19,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:13:19 BoogieIcfgContainer [2019-12-27 21:13:19,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:13:19,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:13:19,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:13:19,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:13:19,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:13:17" (1/3) ... [2019-12-27 21:13:19,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3cd9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:13:19, skipping insertion in model container [2019-12-27 21:13:19,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:18" (2/3) ... [2019-12-27 21:13:19,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3cd9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:13:19, skipping insertion in model container [2019-12-27 21:13:19,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:13:19" (3/3) ... [2019-12-27 21:13:19,097 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_rmo.oepc.i [2019-12-27 21:13:19,108 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:13:19,109 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:13:19,119 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:13:19,120 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:13:19,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,204 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,220 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,221 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,267 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,269 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,285 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,292 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,293 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:19,312 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:13:19,336 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:13:19,337 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:13:19,337 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:13:19,337 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:13:19,337 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:13:19,337 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:13:19,337 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:13:19,337 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:13:19,354 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 21:13:19,356 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 21:13:19,484 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 21:13:19,484 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:13:19,500 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 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:13:19,525 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 21:13:19,611 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 21:13:19,611 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:13:19,620 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 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:13:19,641 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:13:19,642 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:13:23,250 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 21:13:23,371 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:13:23,390 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-27 21:13:23,390 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 21:13:23,394 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 21:13:40,008 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 21:13:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 21:13:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:13:40,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:40,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:13:40,017 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 21:13:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:40,023 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-27 21:13:40,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:40,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056129396] [2019-12-27 21:13:40,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:40,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056129396] [2019-12-27 21:13:40,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:40,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:13:40,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1730800993] [2019-12-27 21:13:40,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:40,289 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:40,303 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:13:40,303 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:40,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:40,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:40,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:40,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:40,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:40,326 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 21:13:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:41,436 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-27 21:13:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:41,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:13:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:44,552 INFO L225 Difference]: With dead ends: 104092 [2019-12-27 21:13:44,552 INFO L226 Difference]: Without dead ends: 97696 [2019-12-27 21:13:44,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-27 21:13:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-27 21:13:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-27 21:13:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-27 21:13:54,402 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-27 21:13:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:54,402 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-27 21:13:54,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-27 21:13:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:13:54,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:54,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:54,407 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 21:13:54,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-27 21:13:54,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:54,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854711221] [2019-12-27 21:13:54,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:54,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854711221] [2019-12-27 21:13:54,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:54,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:54,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [125517351] [2019-12-27 21:13:54,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:54,521 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:54,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:13:54,525 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:54,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:54,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:54,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:54,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:54,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:54,527 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-27 21:13:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:59,851 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-27 21:13:59,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:59,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:13:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:00,553 INFO L225 Difference]: With dead ends: 155904 [2019-12-27 21:14:00,553 INFO L226 Difference]: Without dead ends: 155855 [2019-12-27 21:14:00,555 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 21:14:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-27 21:14:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-27 21:14:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-27 21:14:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-27 21:14:09,727 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-27 21:14:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:09,727 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-27 21:14:09,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:14:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-27 21:14:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:14:09,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:09,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:14:09,734 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 21:14:09,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:09,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-27 21:14:09,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:09,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185958746] [2019-12-27 21:14:09,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:09,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185958746] [2019-12-27 21:14:09,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:09,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:14:09,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1769229730] [2019-12-27 21:14:09,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:09,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:09,803 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:14:09,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:09,804 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:14:09,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:14:09,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:09,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:14:09,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:09,806 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-27 21:14:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:09,936 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-27 21:14:09,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:09,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:14:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:09,988 INFO L225 Difference]: With dead ends: 31684 [2019-12-27 21:14:09,988 INFO L226 Difference]: Without dead ends: 31684 [2019-12-27 21:14:09,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-27 21:14:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-27 21:14:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-27 21:14:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-27 21:14:14,849 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-27 21:14:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:14,849 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-27 21:14:14,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:14:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-27 21:14:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:14:14,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:14,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:14:14,852 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 21:14:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-27 21:14:14,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:14,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984899425] [2019-12-27 21:14:14,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:14,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984899425] [2019-12-27 21:14:14,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:14,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:14:14,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2122075164] [2019-12-27 21:14:14,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:14,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:14,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:14:14,971 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:14,971 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:14:14,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:14:14,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:14,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:14:14,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:14:14,973 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-27 21:14:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:15,369 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-27 21:14:15,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:14:15,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:14:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:15,433 INFO L225 Difference]: With dead ends: 39269 [2019-12-27 21:14:15,434 INFO L226 Difference]: Without dead ends: 39269 [2019-12-27 21:14:15,434 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 21:14:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-27 21:14:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-27 21:14:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-27 21:14:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-27 21:14:16,091 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-27 21:14:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:16,093 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-27 21:14:16,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:14:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-27 21:14:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:14:16,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:16,102 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 21:14:16,102 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 21:14:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:16,102 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-27 21:14:16,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:16,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246948805] [2019-12-27 21:14:16,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:16,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246948805] [2019-12-27 21:14:16,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:16,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:16,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [344543994] [2019-12-27 21:14:16,201 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:16,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:16,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 21:14:16,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:16,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:16,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:14:16,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:16,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:14:16,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:14:16,744 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 8 states. [2019-12-27 21:14:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:18,032 INFO L93 Difference]: Finished difference Result 73117 states and 235583 transitions. [2019-12-27 21:14:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:14:18,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 21:14:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:18,155 INFO L225 Difference]: With dead ends: 73117 [2019-12-27 21:14:18,155 INFO L226 Difference]: Without dead ends: 73110 [2019-12-27 21:14:18,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:14:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73110 states. [2019-12-27 21:14:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73110 to 34913. [2019-12-27 21:14:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34913 states. [2019-12-27 21:14:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34913 states to 34913 states and 112936 transitions. [2019-12-27 21:14:19,515 INFO L78 Accepts]: Start accepts. Automaton has 34913 states and 112936 transitions. Word has length 22 [2019-12-27 21:14:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:19,515 INFO L462 AbstractCegarLoop]: Abstraction has 34913 states and 112936 transitions. [2019-12-27 21:14:19,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:14:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 34913 states and 112936 transitions. [2019-12-27 21:14:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:14:19,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:19,527 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 21:14:19,527 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 21:14:19,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-27 21:14:19,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:19,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219620184] [2019-12-27 21:14:19,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:19,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219620184] [2019-12-27 21:14:19,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:19,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:19,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424510127] [2019-12-27 21:14:19,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:19,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:19,598 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:14:19,599 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:19,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:14:19,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:14:19,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:19,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:14:19,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:14:19,620 INFO L87 Difference]: Start difference. First operand 34913 states and 112936 transitions. Second operand 5 states. [2019-12-27 21:14:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:19,688 INFO L93 Difference]: Finished difference Result 14109 states and 42996 transitions. [2019-12-27 21:14:19,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:14:19,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:14:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:19,710 INFO L225 Difference]: With dead ends: 14109 [2019-12-27 21:14:19,710 INFO L226 Difference]: Without dead ends: 14109 [2019-12-27 21:14:19,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:14:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14109 states. [2019-12-27 21:14:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14109 to 13809. [2019-12-27 21:14:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-27 21:14:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 42140 transitions. [2019-12-27 21:14:19,934 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 42140 transitions. Word has length 25 [2019-12-27 21:14:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:19,934 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 42140 transitions. [2019-12-27 21:14:19,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:14:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 42140 transitions. [2019-12-27 21:14:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:14:19,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:19,945 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 21:14:19,945 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 21:14:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-27 21:14:19,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:19,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757388053] [2019-12-27 21:14:19,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:19,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757388053] [2019-12-27 21:14:19,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:19,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:19,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282325913] [2019-12-27 21:14:19,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:19,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:20,006 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:14:20,006 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:20,006 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:14:20,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:14:20,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:20,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:14:20,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:20,007 INFO L87 Difference]: Start difference. First operand 13809 states and 42140 transitions. Second operand 3 states. [2019-12-27 21:14:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:20,119 INFO L93 Difference]: Finished difference Result 19650 states and 58966 transitions. [2019-12-27 21:14:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:20,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 21:14:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:20,158 INFO L225 Difference]: With dead ends: 19650 [2019-12-27 21:14:20,159 INFO L226 Difference]: Without dead ends: 19650 [2019-12-27 21:14:20,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19650 states. [2019-12-27 21:14:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19650 to 14555. [2019-12-27 21:14:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14555 states. [2019-12-27 21:14:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 44278 transitions. [2019-12-27 21:14:20,459 INFO L78 Accepts]: Start accepts. Automaton has 14555 states and 44278 transitions. Word has length 27 [2019-12-27 21:14:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:20,459 INFO L462 AbstractCegarLoop]: Abstraction has 14555 states and 44278 transitions. [2019-12-27 21:14:20,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:14:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 14555 states and 44278 transitions. [2019-12-27 21:14:20,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:14:20,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:20,469 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 21:14:20,469 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 21:14:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:20,469 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-27 21:14:20,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:20,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119243103] [2019-12-27 21:14:20,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:20,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119243103] [2019-12-27 21:14:20,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:20,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:14:20,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1430028785] [2019-12-27 21:14:20,575 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:20,579 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:20,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:14:20,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:20,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:14:20,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:14:20,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:14:20,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:14:20,587 INFO L87 Difference]: Start difference. First operand 14555 states and 44278 transitions. Second operand 6 states. [2019-12-27 21:14:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:21,386 INFO L93 Difference]: Finished difference Result 37188 states and 111594 transitions. [2019-12-27 21:14:21,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:14:21,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:14:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:21,453 INFO L225 Difference]: With dead ends: 37188 [2019-12-27 21:14:21,453 INFO L226 Difference]: Without dead ends: 37188 [2019-12-27 21:14:21,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37188 states. [2019-12-27 21:14:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37188 to 20478. [2019-12-27 21:14:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 21:14:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 63215 transitions. [2019-12-27 21:14:22,168 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 63215 transitions. Word has length 27 [2019-12-27 21:14:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:22,168 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 63215 transitions. [2019-12-27 21:14:22,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:14:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 63215 transitions. [2019-12-27 21:14:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:14:22,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:22,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:14:22,185 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 21:14:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-27 21:14:22,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:22,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218249639] [2019-12-27 21:14:22,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:22,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218249639] [2019-12-27 21:14:22,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:22,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:14:22,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1742510670] [2019-12-27 21:14:22,294 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:22,299 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:22,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 21:14:22,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:22,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:14:22,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:14:22,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:22,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:14:22,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:14:22,308 INFO L87 Difference]: Start difference. First operand 20478 states and 63215 transitions. Second operand 6 states. [2019-12-27 21:14:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:22,993 INFO L93 Difference]: Finished difference Result 34478 states and 103330 transitions. [2019-12-27 21:14:22,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:14:22,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 21:14:22,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:23,041 INFO L225 Difference]: With dead ends: 34478 [2019-12-27 21:14:23,041 INFO L226 Difference]: Without dead ends: 34478 [2019-12-27 21:14:23,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34478 states. [2019-12-27 21:14:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34478 to 20240. [2019-12-27 21:14:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20240 states. [2019-12-27 21:14:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20240 states to 20240 states and 62600 transitions. [2019-12-27 21:14:23,451 INFO L78 Accepts]: Start accepts. Automaton has 20240 states and 62600 transitions. Word has length 28 [2019-12-27 21:14:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:23,452 INFO L462 AbstractCegarLoop]: Abstraction has 20240 states and 62600 transitions. [2019-12-27 21:14:23,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:14:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 20240 states and 62600 transitions. [2019-12-27 21:14:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:14:23,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:23,473 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 21:14:23,473 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 21:14:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:23,473 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-27 21:14:23,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:23,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81334317] [2019-12-27 21:14:23,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:23,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81334317] [2019-12-27 21:14:23,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:23,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:14:23,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1106074755] [2019-12-27 21:14:23,568 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:23,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:23,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 65 transitions. [2019-12-27 21:14:23,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:23,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:23,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:14:23,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:23,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:14:23,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:14:23,786 INFO L87 Difference]: Start difference. First operand 20240 states and 62600 transitions. Second operand 10 states. [2019-12-27 21:14:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:26,710 INFO L93 Difference]: Finished difference Result 69823 states and 209190 transitions. [2019-12-27 21:14:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:14:26,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-12-27 21:14:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:26,823 INFO L225 Difference]: With dead ends: 69823 [2019-12-27 21:14:26,824 INFO L226 Difference]: Without dead ends: 69823 [2019-12-27 21:14:26,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:14:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69823 states. [2019-12-27 21:14:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69823 to 21771. [2019-12-27 21:14:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21771 states. [2019-12-27 21:14:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21771 states to 21771 states and 67265 transitions. [2019-12-27 21:14:27,546 INFO L78 Accepts]: Start accepts. Automaton has 21771 states and 67265 transitions. Word has length 33 [2019-12-27 21:14:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:27,547 INFO L462 AbstractCegarLoop]: Abstraction has 21771 states and 67265 transitions. [2019-12-27 21:14:27,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:14:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 21771 states and 67265 transitions. [2019-12-27 21:14:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:14:27,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:27,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, 1, 1, 1] [2019-12-27 21:14:27,569 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 21:14:27,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-27 21:14:27,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:27,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720450517] [2019-12-27 21:14:27,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:27,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720450517] [2019-12-27 21:14:27,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:27,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:27,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124511590] [2019-12-27 21:14:27,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:27,616 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:27,633 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 21:14:27,634 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:27,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:14:27,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:14:27,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:27,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:14:27,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:27,637 INFO L87 Difference]: Start difference. First operand 21771 states and 67265 transitions. Second operand 3 states. [2019-12-27 21:14:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:27,784 INFO L93 Difference]: Finished difference Result 29013 states and 86739 transitions. [2019-12-27 21:14:27,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:27,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 21:14:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:27,849 INFO L225 Difference]: With dead ends: 29013 [2019-12-27 21:14:27,850 INFO L226 Difference]: Without dead ends: 29013 [2019-12-27 21:14:27,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29013 states. [2019-12-27 21:14:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29013 to 20501. [2019-12-27 21:14:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20501 states. [2019-12-27 21:14:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20501 states to 20501 states and 61416 transitions. [2019-12-27 21:14:28,573 INFO L78 Accepts]: Start accepts. Automaton has 20501 states and 61416 transitions. Word has length 33 [2019-12-27 21:14:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:28,573 INFO L462 AbstractCegarLoop]: Abstraction has 20501 states and 61416 transitions. [2019-12-27 21:14:28,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:14:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 20501 states and 61416 transitions. [2019-12-27 21:14:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:14:28,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:28,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:14:28,593 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 21:14:28,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:28,593 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-27 21:14:28,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:28,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814378285] [2019-12-27 21:14:28,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:28,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814378285] [2019-12-27 21:14:28,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:28,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:14:28,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392155053] [2019-12-27 21:14:28,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:28,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:28,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 21:14:28,748 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:28,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:14:28,786 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:14:28,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:14:28,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:14:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:14:28,787 INFO L87 Difference]: Start difference. First operand 20501 states and 61416 transitions. Second operand 9 states. [2019-12-27 21:14:31,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:31,868 INFO L93 Difference]: Finished difference Result 62586 states and 182614 transitions. [2019-12-27 21:14:31,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 21:14:31,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 21:14:31,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:32,021 INFO L225 Difference]: With dead ends: 62586 [2019-12-27 21:14:32,021 INFO L226 Difference]: Without dead ends: 62586 [2019-12-27 21:14:32,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 21:14:32,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62586 states. [2019-12-27 21:14:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62586 to 23222. [2019-12-27 21:14:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23222 states. [2019-12-27 21:14:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23222 states to 23222 states and 69697 transitions. [2019-12-27 21:14:33,092 INFO L78 Accepts]: Start accepts. Automaton has 23222 states and 69697 transitions. Word has length 33 [2019-12-27 21:14:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:33,093 INFO L462 AbstractCegarLoop]: Abstraction has 23222 states and 69697 transitions. [2019-12-27 21:14:33,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:14:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 23222 states and 69697 transitions. [2019-12-27 21:14:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:14:33,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:33,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:14:33,115 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 21:14:33,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:33,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-27 21:14:33,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:33,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502703734] [2019-12-27 21:14:33,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:33,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502703734] [2019-12-27 21:14:33,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:33,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:14:33,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862163391] [2019-12-27 21:14:33,208 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:33,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:33,232 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 66 transitions. [2019-12-27 21:14:33,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:33,413 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:33,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:14:33,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:33,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:14:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:14:33,415 INFO L87 Difference]: Start difference. First operand 23222 states and 69697 transitions. Second operand 10 states. [2019-12-27 21:14:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:35,822 INFO L93 Difference]: Finished difference Result 53461 states and 158997 transitions. [2019-12-27 21:14:35,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:14:35,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 21:14:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:35,904 INFO L225 Difference]: With dead ends: 53461 [2019-12-27 21:14:35,904 INFO L226 Difference]: Without dead ends: 53461 [2019-12-27 21:14:35,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:14:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53461 states. [2019-12-27 21:14:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53461 to 22086. [2019-12-27 21:14:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22086 states. [2019-12-27 21:14:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22086 states to 22086 states and 66380 transitions. [2019-12-27 21:14:36,500 INFO L78 Accepts]: Start accepts. Automaton has 22086 states and 66380 transitions. Word has length 34 [2019-12-27 21:14:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:36,501 INFO L462 AbstractCegarLoop]: Abstraction has 22086 states and 66380 transitions. [2019-12-27 21:14:36,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:14:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 22086 states and 66380 transitions. [2019-12-27 21:14:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:14:36,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:36,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:14:36,522 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 21:14:36,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-27 21:14:36,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:36,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78505899] [2019-12-27 21:14:36,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:36,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78505899] [2019-12-27 21:14:36,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:36,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:14:36,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1919721567] [2019-12-27 21:14:36,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:36,670 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:36,685 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 21:14:36,686 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:36,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:14:36,708 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:14:36,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:14:36,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:14:36,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:14:36,709 INFO L87 Difference]: Start difference. First operand 22086 states and 66380 transitions. Second operand 9 states. [2019-12-27 21:14:38,121 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-12-27 21:14:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:39,963 INFO L93 Difference]: Finished difference Result 52131 states and 150802 transitions. [2019-12-27 21:14:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 21:14:39,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 21:14:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:40,048 INFO L225 Difference]: With dead ends: 52131 [2019-12-27 21:14:40,048 INFO L226 Difference]: Without dead ends: 52131 [2019-12-27 21:14:40,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 21:14:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52131 states. [2019-12-27 21:14:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52131 to 20362. [2019-12-27 21:14:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20362 states. [2019-12-27 21:14:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20362 states to 20362 states and 61192 transitions. [2019-12-27 21:14:40,626 INFO L78 Accepts]: Start accepts. Automaton has 20362 states and 61192 transitions. Word has length 34 [2019-12-27 21:14:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:40,626 INFO L462 AbstractCegarLoop]: Abstraction has 20362 states and 61192 transitions. [2019-12-27 21:14:40,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:14:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 20362 states and 61192 transitions. [2019-12-27 21:14:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:14:40,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:40,657 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] [2019-12-27 21:14:40,657 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 21:14:40,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2067431116, now seen corresponding path program 1 times [2019-12-27 21:14:40,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:40,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617733654] [2019-12-27 21:14:40,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:40,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617733654] [2019-12-27 21:14:40,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:40,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:40,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1666094645] [2019-12-27 21:14:40,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:40,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:40,789 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 355 transitions. [2019-12-27 21:14:40,789 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:40,842 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:14:40,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:14:40,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:14:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:40,843 INFO L87 Difference]: Start difference. First operand 20362 states and 61192 transitions. Second operand 7 states. [2019-12-27 21:14:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:41,304 INFO L93 Difference]: Finished difference Result 39737 states and 119836 transitions. [2019-12-27 21:14:41,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:14:41,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 21:14:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:41,337 INFO L225 Difference]: With dead ends: 39737 [2019-12-27 21:14:41,337 INFO L226 Difference]: Without dead ends: 22421 [2019-12-27 21:14:41,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 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 21:14:41,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22421 states. [2019-12-27 21:14:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22421 to 18680. [2019-12-27 21:14:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18680 states. [2019-12-27 21:14:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18680 states to 18680 states and 55148 transitions. [2019-12-27 21:14:41,966 INFO L78 Accepts]: Start accepts. Automaton has 18680 states and 55148 transitions. Word has length 39 [2019-12-27 21:14:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:41,966 INFO L462 AbstractCegarLoop]: Abstraction has 18680 states and 55148 transitions. [2019-12-27 21:14:41,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:14:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 18680 states and 55148 transitions. [2019-12-27 21:14:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:14:41,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:41,983 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] [2019-12-27 21:14:41,983 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 21:14:41,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:41,985 INFO L82 PathProgramCache]: Analyzing trace with hash -757785660, now seen corresponding path program 2 times [2019-12-27 21:14:41,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:41,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105138003] [2019-12-27 21:14:41,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:42,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105138003] [2019-12-27 21:14:42,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:42,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:14:42,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [366954544] [2019-12-27 21:14:42,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:42,047 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:42,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 21:14:42,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:42,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:14:42,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:14:42,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:42,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:14:42,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:14:42,122 INFO L87 Difference]: Start difference. First operand 18680 states and 55148 transitions. Second operand 4 states. [2019-12-27 21:14:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:42,288 INFO L93 Difference]: Finished difference Result 33681 states and 99419 transitions. [2019-12-27 21:14:42,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:42,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 21:14:42,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:42,325 INFO L225 Difference]: With dead ends: 33681 [2019-12-27 21:14:42,326 INFO L226 Difference]: Without dead ends: 17341 [2019-12-27 21:14:42,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:14:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17341 states. [2019-12-27 21:14:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17341 to 17285. [2019-12-27 21:14:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17285 states. [2019-12-27 21:14:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17285 states to 17285 states and 49738 transitions. [2019-12-27 21:14:42,711 INFO L78 Accepts]: Start accepts. Automaton has 17285 states and 49738 transitions. Word has length 39 [2019-12-27 21:14:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:42,711 INFO L462 AbstractCegarLoop]: Abstraction has 17285 states and 49738 transitions. [2019-12-27 21:14:42,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:14:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 17285 states and 49738 transitions. [2019-12-27 21:14:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:14:42,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:42,734 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 21:14:42,734 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 21:14:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:42,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 1 times [2019-12-27 21:14:42,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:42,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536149975] [2019-12-27 21:14:42,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:42,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536149975] [2019-12-27 21:14:42,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:42,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:14:42,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [434107701] [2019-12-27 21:14:42,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:42,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:42,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 21:14:42,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:42,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:14:42,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:14:42,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:42,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:14:42,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:42,926 INFO L87 Difference]: Start difference. First operand 17285 states and 49738 transitions. Second operand 7 states. [2019-12-27 21:14:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:42,994 INFO L93 Difference]: Finished difference Result 16059 states and 46972 transitions. [2019-12-27 21:14:42,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:14:42,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 21:14:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:43,013 INFO L225 Difference]: With dead ends: 16059 [2019-12-27 21:14:43,013 INFO L226 Difference]: Without dead ends: 13131 [2019-12-27 21:14:43,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13131 states. [2019-12-27 21:14:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13131 to 12213. [2019-12-27 21:14:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12213 states. [2019-12-27 21:14:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12213 states to 12213 states and 37837 transitions. [2019-12-27 21:14:43,205 INFO L78 Accepts]: Start accepts. Automaton has 12213 states and 37837 transitions. Word has length 40 [2019-12-27 21:14:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:43,205 INFO L462 AbstractCegarLoop]: Abstraction has 12213 states and 37837 transitions. [2019-12-27 21:14:43,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:14:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 12213 states and 37837 transitions. [2019-12-27 21:14:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:43,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:43,219 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] [2019-12-27 21:14:43,219 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 21:14:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1729634848, now seen corresponding path program 1 times [2019-12-27 21:14:43,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:43,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691598984] [2019-12-27 21:14:43,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:43,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691598984] [2019-12-27 21:14:43,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:43,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:14:43,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [739492427] [2019-12-27 21:14:43,354 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:43,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:43,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 487 transitions. [2019-12-27 21:14:43,633 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:43,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 21:14:43,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:14:43,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:43,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:14:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:43,860 INFO L87 Difference]: Start difference. First operand 12213 states and 37837 transitions. Second operand 11 states. [2019-12-27 21:14:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:47,510 INFO L93 Difference]: Finished difference Result 80487 states and 241300 transitions. [2019-12-27 21:14:47,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 21:14:47,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:14:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:47,597 INFO L225 Difference]: With dead ends: 80487 [2019-12-27 21:14:47,597 INFO L226 Difference]: Without dead ends: 60492 [2019-12-27 21:14:47,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 14 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=710, Invalid=2830, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 21:14:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60492 states. [2019-12-27 21:14:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60492 to 14200. [2019-12-27 21:14:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14200 states. [2019-12-27 21:14:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14200 states to 14200 states and 44003 transitions. [2019-12-27 21:14:48,154 INFO L78 Accepts]: Start accepts. Automaton has 14200 states and 44003 transitions. Word has length 64 [2019-12-27 21:14:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:48,154 INFO L462 AbstractCegarLoop]: Abstraction has 14200 states and 44003 transitions. [2019-12-27 21:14:48,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:14:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 14200 states and 44003 transitions. [2019-12-27 21:14:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:48,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:48,170 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] [2019-12-27 21:14:48,170 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 21:14:48,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:48,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2099431100, now seen corresponding path program 2 times [2019-12-27 21:14:48,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:48,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465231140] [2019-12-27 21:14:48,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:48,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465231140] [2019-12-27 21:14:48,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:48,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:14:48,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [766781268] [2019-12-27 21:14:48,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:48,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:48,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 332 transitions. [2019-12-27 21:14:48,696 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:48,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:48,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:14:48,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:48,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:14:48,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:14:48,769 INFO L87 Difference]: Start difference. First operand 14200 states and 44003 transitions. Second operand 10 states. [2019-12-27 21:14:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:50,342 INFO L93 Difference]: Finished difference Result 36699 states and 110238 transitions. [2019-12-27 21:14:50,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:14:50,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 21:14:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:50,384 INFO L225 Difference]: With dead ends: 36699 [2019-12-27 21:14:50,384 INFO L226 Difference]: Without dead ends: 27159 [2019-12-27 21:14:50,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:14:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27159 states. [2019-12-27 21:14:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27159 to 16055. [2019-12-27 21:14:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16055 states. [2019-12-27 21:14:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16055 states to 16055 states and 49323 transitions. [2019-12-27 21:14:50,747 INFO L78 Accepts]: Start accepts. Automaton has 16055 states and 49323 transitions. Word has length 64 [2019-12-27 21:14:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:50,747 INFO L462 AbstractCegarLoop]: Abstraction has 16055 states and 49323 transitions. [2019-12-27 21:14:50,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:14:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 16055 states and 49323 transitions. [2019-12-27 21:14:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:50,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:50,770 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] [2019-12-27 21:14:50,770 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 21:14:50,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1686766406, now seen corresponding path program 3 times [2019-12-27 21:14:50,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:50,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013225746] [2019-12-27 21:14:50,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:50,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013225746] [2019-12-27 21:14:50,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:50,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:14:50,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360925062] [2019-12-27 21:14:50,851 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:50,887 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:51,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 284 states and 557 transitions. [2019-12-27 21:14:51,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:51,413 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 21:14:51,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:14:51,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:51,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:14:51,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:51,414 INFO L87 Difference]: Start difference. First operand 16055 states and 49323 transitions. Second operand 11 states. [2019-12-27 21:14:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:53,082 INFO L93 Difference]: Finished difference Result 33035 states and 100301 transitions. [2019-12-27 21:14:53,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:14:53,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:14:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:53,121 INFO L225 Difference]: With dead ends: 33035 [2019-12-27 21:14:53,121 INFO L226 Difference]: Without dead ends: 24689 [2019-12-27 21:14:53,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:14:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-27 21:14:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16343. [2019-12-27 21:14:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16343 states. [2019-12-27 21:14:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16343 states to 16343 states and 50175 transitions. [2019-12-27 21:14:53,686 INFO L78 Accepts]: Start accepts. Automaton has 16343 states and 50175 transitions. Word has length 64 [2019-12-27 21:14:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:53,686 INFO L462 AbstractCegarLoop]: Abstraction has 16343 states and 50175 transitions. [2019-12-27 21:14:53,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:14:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 16343 states and 50175 transitions. [2019-12-27 21:14:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:53,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:53,705 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] [2019-12-27 21:14:53,705 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 21:14:53,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:53,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2033773150, now seen corresponding path program 4 times [2019-12-27 21:14:53,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:53,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571608196] [2019-12-27 21:14:53,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:53,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571608196] [2019-12-27 21:14:53,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:53,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:14:53,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1865027709] [2019-12-27 21:14:53,895 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:53,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:54,079 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 339 transitions. [2019-12-27 21:14:54,080 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:54,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 21:14:54,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:14:54,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:54,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:14:54,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:54,268 INFO L87 Difference]: Start difference. First operand 16343 states and 50175 transitions. Second operand 11 states. [2019-12-27 21:14:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:59,156 INFO L93 Difference]: Finished difference Result 66342 states and 201578 transitions. [2019-12-27 21:14:59,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 21:14:59,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:14:59,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:59,283 INFO L225 Difference]: With dead ends: 66342 [2019-12-27 21:14:59,284 INFO L226 Difference]: Without dead ends: 66342 [2019-12-27 21:14:59,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=362, Invalid=1278, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 21:14:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66342 states. [2019-12-27 21:15:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66342 to 16343. [2019-12-27 21:15:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16343 states. [2019-12-27 21:15:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16343 states to 16343 states and 50175 transitions. [2019-12-27 21:15:00,183 INFO L78 Accepts]: Start accepts. Automaton has 16343 states and 50175 transitions. Word has length 64 [2019-12-27 21:15:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:00,184 INFO L462 AbstractCegarLoop]: Abstraction has 16343 states and 50175 transitions. [2019-12-27 21:15:00,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:15:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 16343 states and 50175 transitions. [2019-12-27 21:15:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:15:00,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:15:00,202 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 21:15:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1056383140, now seen corresponding path program 5 times [2019-12-27 21:15:00,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:00,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251592718] [2019-12-27 21:15:00,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:15:00,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251592718] [2019-12-27 21:15:00,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:00,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:15:00,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1886794652] [2019-12-27 21:15:00,263 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:00,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:00,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 397 transitions. [2019-12-27 21:15:00,490 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:00,491 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:15:00,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:15:00,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:00,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:15:00,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:15:00,492 INFO L87 Difference]: Start difference. First operand 16343 states and 50175 transitions. Second operand 3 states. [2019-12-27 21:15:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:00,583 INFO L93 Difference]: Finished difference Result 18900 states and 57905 transitions. [2019-12-27 21:15:00,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:15:00,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:15:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:00,608 INFO L225 Difference]: With dead ends: 18900 [2019-12-27 21:15:00,608 INFO L226 Difference]: Without dead ends: 18900 [2019-12-27 21:15:00,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:15:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18900 states. [2019-12-27 21:15:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18900 to 16943. [2019-12-27 21:15:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16943 states. [2019-12-27 21:15:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16943 states to 16943 states and 52160 transitions. [2019-12-27 21:15:00,895 INFO L78 Accepts]: Start accepts. Automaton has 16943 states and 52160 transitions. Word has length 64 [2019-12-27 21:15:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:00,896 INFO L462 AbstractCegarLoop]: Abstraction has 16943 states and 52160 transitions. [2019-12-27 21:15:00,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:15:00,896 INFO L276 IsEmpty]: Start isEmpty. Operand 16943 states and 52160 transitions. [2019-12-27 21:15:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:15:00,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:00,917 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] [2019-12-27 21:15:00,917 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 21:15:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1170002163, now seen corresponding path program 1 times [2019-12-27 21:15:00,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:00,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414428757] [2019-12-27 21:15:00,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:15:00,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414428757] [2019-12-27 21:15:00,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:00,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:15:00,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512117444] [2019-12-27 21:15:00,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:00,985 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:01,688 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 441 transitions. [2019-12-27 21:15:01,689 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:01,719 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:15:01,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:15:01,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:01,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:15:01,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:15:01,721 INFO L87 Difference]: Start difference. First operand 16943 states and 52160 transitions. Second operand 5 states. [2019-12-27 21:15:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:02,226 INFO L93 Difference]: Finished difference Result 32273 states and 98975 transitions. [2019-12-27 21:15:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:15:02,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 21:15:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:02,274 INFO L225 Difference]: With dead ends: 32273 [2019-12-27 21:15:02,274 INFO L226 Difference]: Without dead ends: 32273 [2019-12-27 21:15:02,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:15:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32273 states. [2019-12-27 21:15:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32273 to 18786. [2019-12-27 21:15:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18786 states. [2019-12-27 21:15:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18786 states to 18786 states and 58154 transitions. [2019-12-27 21:15:02,732 INFO L78 Accepts]: Start accepts. Automaton has 18786 states and 58154 transitions. Word has length 65 [2019-12-27 21:15:02,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:02,732 INFO L462 AbstractCegarLoop]: Abstraction has 18786 states and 58154 transitions. [2019-12-27 21:15:02,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:15:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 18786 states and 58154 transitions. [2019-12-27 21:15:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:15:02,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:02,753 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] [2019-12-27 21:15:02,753 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 21:15:02,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash -162352739, now seen corresponding path program 2 times [2019-12-27 21:15:02,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:02,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398171814] [2019-12-27 21:15:02,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:15:02,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398171814] [2019-12-27 21:15:02,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:02,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:15:02,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1609877726] [2019-12-27 21:15:02,802 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:02,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:03,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 421 transitions. [2019-12-27 21:15:03,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:03,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:15:03,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:15:03,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:03,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:15:03,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:15:03,024 INFO L87 Difference]: Start difference. First operand 18786 states and 58154 transitions. Second operand 3 states. [2019-12-27 21:15:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:03,224 INFO L93 Difference]: Finished difference Result 27204 states and 84265 transitions. [2019-12-27 21:15:03,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:15:03,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:15:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:03,263 INFO L225 Difference]: With dead ends: 27204 [2019-12-27 21:15:03,263 INFO L226 Difference]: Without dead ends: 27204 [2019-12-27 21:15:03,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:15:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27204 states. [2019-12-27 21:15:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27204 to 18918. [2019-12-27 21:15:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18918 states. [2019-12-27 21:15:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18918 states to 18918 states and 58536 transitions. [2019-12-27 21:15:03,608 INFO L78 Accepts]: Start accepts. Automaton has 18918 states and 58536 transitions. Word has length 65 [2019-12-27 21:15:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:03,608 INFO L462 AbstractCegarLoop]: Abstraction has 18918 states and 58536 transitions. [2019-12-27 21:15:03,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:15:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 18918 states and 58536 transitions. [2019-12-27 21:15:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:15:03,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:03,629 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] [2019-12-27 21:15:03,629 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 21:15:03,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1707397215, now seen corresponding path program 3 times [2019-12-27 21:15:03,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:03,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311967631] [2019-12-27 21:15:03,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:15:03,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311967631] [2019-12-27 21:15:03,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:03,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:15:03,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729892259] [2019-12-27 21:15:03,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:03,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:04,250 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 407 transitions. [2019-12-27 21:15:04,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:04,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:15:04,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:15:04,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:15:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:15:04,456 INFO L87 Difference]: Start difference. First operand 18918 states and 58536 transitions. Second operand 12 states. [2019-12-27 21:15:05,944 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:15:06,306 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:15:06,734 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 21:15:06,877 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:15:07,719 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 21:15:08,701 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 21:15:08,976 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:15:09,203 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:15:09,415 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 21:15:10,466 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:15:11,310 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 21:15:12,712 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-12-27 21:15:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:13,543 INFO L93 Difference]: Finished difference Result 58066 states and 175891 transitions. [2019-12-27 21:15:13,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-27 21:15:13,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:15:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:13,615 INFO L225 Difference]: With dead ends: 58066 [2019-12-27 21:15:13,615 INFO L226 Difference]: Without dead ends: 50130 [2019-12-27 21:15:13,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1103, Invalid=5539, Unknown=0, NotChecked=0, Total=6642 [2019-12-27 21:15:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50130 states. [2019-12-27 21:15:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50130 to 19126. [2019-12-27 21:15:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19126 states. [2019-12-27 21:15:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 59069 transitions. [2019-12-27 21:15:14,140 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 59069 transitions. Word has length 65 [2019-12-27 21:15:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:14,140 INFO L462 AbstractCegarLoop]: Abstraction has 19126 states and 59069 transitions. [2019-12-27 21:15:14,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:15:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 59069 transitions. [2019-12-27 21:15:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:15:14,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:14,159 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] [2019-12-27 21:15:14,159 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 21:15:14,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:14,160 INFO L82 PathProgramCache]: Analyzing trace with hash 812378529, now seen corresponding path program 4 times [2019-12-27 21:15:14,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:14,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392952068] [2019-12-27 21:15:14,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:15:14,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392952068] [2019-12-27 21:15:14,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:14,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:15:14,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1136583351] [2019-12-27 21:15:14,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:14,294 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:14,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 408 transitions. [2019-12-27 21:15:14,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:14,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:15:14,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:15:14,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:15:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:15:14,551 INFO L87 Difference]: Start difference. First operand 19126 states and 59069 transitions. Second operand 10 states. [2019-12-27 21:15:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:15,794 INFO L93 Difference]: Finished difference Result 48643 states and 146148 transitions. [2019-12-27 21:15:15,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:15:15,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 21:15:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:15,853 INFO L225 Difference]: With dead ends: 48643 [2019-12-27 21:15:15,854 INFO L226 Difference]: Without dead ends: 41291 [2019-12-27 21:15:15,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2019-12-27 21:15:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41291 states. [2019-12-27 21:15:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41291 to 18471. [2019-12-27 21:15:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18471 states. [2019-12-27 21:15:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18471 states to 18471 states and 56699 transitions. [2019-12-27 21:15:16,628 INFO L78 Accepts]: Start accepts. Automaton has 18471 states and 56699 transitions. Word has length 65 [2019-12-27 21:15:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:16,628 INFO L462 AbstractCegarLoop]: Abstraction has 18471 states and 56699 transitions. [2019-12-27 21:15:16,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:15:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 18471 states and 56699 transitions. [2019-12-27 21:15:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:15:16,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:16,649 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] [2019-12-27 21:15:16,649 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 21:15:16,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash 393402024, now seen corresponding path program 1 times [2019-12-27 21:15:16,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:16,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311461977] [2019-12-27 21:15:16,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:15:16,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311461977] [2019-12-27 21:15:16,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:16,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:15:16,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222319938] [2019-12-27 21:15:16,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:16,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:17,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 250 states and 458 transitions. [2019-12-27 21:15:17,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:17,548 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 21:15:17,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:15:17,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:17,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:15:17,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:15:17,549 INFO L87 Difference]: Start difference. First operand 18471 states and 56699 transitions. Second operand 11 states. [2019-12-27 21:15:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:22,051 INFO L93 Difference]: Finished difference Result 48154 states and 145306 transitions. [2019-12-27 21:15:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 21:15:22,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 21:15:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:22,116 INFO L225 Difference]: With dead ends: 48154 [2019-12-27 21:15:22,116 INFO L226 Difference]: Without dead ends: 47902 [2019-12-27 21:15:22,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 21:15:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47902 states. [2019-12-27 21:15:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47902 to 21159. [2019-12-27 21:15:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21159 states. [2019-12-27 21:15:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21159 states to 21159 states and 64252 transitions. [2019-12-27 21:15:22,856 INFO L78 Accepts]: Start accepts. Automaton has 21159 states and 64252 transitions. Word has length 65 [2019-12-27 21:15:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:22,856 INFO L462 AbstractCegarLoop]: Abstraction has 21159 states and 64252 transitions. [2019-12-27 21:15:22,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:15:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 21159 states and 64252 transitions. [2019-12-27 21:15:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:15:22,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:22,879 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] [2019-12-27 21:15:22,879 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:15:22,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1874509426, now seen corresponding path program 2 times [2019-12-27 21:15:22,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:22,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437062140] [2019-12-27 21:15:22,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:15:22,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437062140] [2019-12-27 21:15:22,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:22,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:15:22,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [709281183] [2019-12-27 21:15:22,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:23,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:23,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 409 transitions. [2019-12-27 21:15:23,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:23,570 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 21:15:23,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:15:23,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:23,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:15:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:15:23,572 INFO L87 Difference]: Start difference. First operand 21159 states and 64252 transitions. Second operand 10 states. [2019-12-27 21:15:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:26,026 INFO L93 Difference]: Finished difference Result 42361 states and 128488 transitions. [2019-12-27 21:15:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:15:26,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 21:15:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:26,094 INFO L225 Difference]: With dead ends: 42361 [2019-12-27 21:15:26,094 INFO L226 Difference]: Without dead ends: 42361 [2019-12-27 21:15:26,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:15:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42361 states. [2019-12-27 21:15:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42361 to 20781. [2019-12-27 21:15:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20781 states. [2019-12-27 21:15:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20781 states to 20781 states and 63193 transitions. [2019-12-27 21:15:26,629 INFO L78 Accepts]: Start accepts. Automaton has 20781 states and 63193 transitions. Word has length 65 [2019-12-27 21:15:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:26,629 INFO L462 AbstractCegarLoop]: Abstraction has 20781 states and 63193 transitions. [2019-12-27 21:15:26,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:15:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 20781 states and 63193 transitions. [2019-12-27 21:15:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:15:26,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:26,650 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] [2019-12-27 21:15:26,650 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:15:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:26,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2087285624, now seen corresponding path program 3 times [2019-12-27 21:15:26,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:26,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678119189] [2019-12-27 21:15:26,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:15:26,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678119189] [2019-12-27 21:15:26,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:26,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:15:26,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2043126391] [2019-12-27 21:15:26,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:26,736 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:27,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 218 transitions. [2019-12-27 21:15:27,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:27,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:15:27,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:15:27,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:27,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:15:27,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:15:27,146 INFO L87 Difference]: Start difference. First operand 20781 states and 63193 transitions. Second operand 3 states. [2019-12-27 21:15:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:27,239 INFO L93 Difference]: Finished difference Result 20781 states and 63192 transitions. [2019-12-27 21:15:27,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:15:27,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:15:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:27,278 INFO L225 Difference]: With dead ends: 20781 [2019-12-27 21:15:27,278 INFO L226 Difference]: Without dead ends: 20781 [2019-12-27 21:15:27,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:15:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20781 states. [2019-12-27 21:15:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20781 to 17716. [2019-12-27 21:15:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17716 states. [2019-12-27 21:15:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17716 states to 17716 states and 54710 transitions. [2019-12-27 21:15:27,715 INFO L78 Accepts]: Start accepts. Automaton has 17716 states and 54710 transitions. Word has length 65 [2019-12-27 21:15:27,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:27,715 INFO L462 AbstractCegarLoop]: Abstraction has 17716 states and 54710 transitions. [2019-12-27 21:15:27,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:15:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 17716 states and 54710 transitions. [2019-12-27 21:15:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:15:27,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:27,734 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 21:15:27,734 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:15:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1214771677, now seen corresponding path program 1 times [2019-12-27 21:15:27,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:27,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013990573] [2019-12-27 21:15:27,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:15:27,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013990573] [2019-12-27 21:15:27,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:27,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:15:27,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1370703325] [2019-12-27 21:15:27,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:27,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:28,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 438 transitions. [2019-12-27 21:15:28,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:28,159 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:15:28,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:15:28,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:28,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:15:28,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:15:28,161 INFO L87 Difference]: Start difference. First operand 17716 states and 54710 transitions. Second operand 4 states. [2019-12-27 21:15:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:28,257 INFO L93 Difference]: Finished difference Result 12011 states and 36883 transitions. [2019-12-27 21:15:28,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:15:28,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:15:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:28,289 INFO L225 Difference]: With dead ends: 12011 [2019-12-27 21:15:28,289 INFO L226 Difference]: Without dead ends: 12011 [2019-12-27 21:15:28,292 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 21:15:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12011 states. [2019-12-27 21:15:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12011 to 12011. [2019-12-27 21:15:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12011 states. [2019-12-27 21:15:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12011 states to 12011 states and 36883 transitions. [2019-12-27 21:15:28,608 INFO L78 Accepts]: Start accepts. Automaton has 12011 states and 36883 transitions. Word has length 66 [2019-12-27 21:15:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:28,609 INFO L462 AbstractCegarLoop]: Abstraction has 12011 states and 36883 transitions. [2019-12-27 21:15:28,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:15:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 12011 states and 36883 transitions. [2019-12-27 21:15:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:15:28,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:28,629 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 21:15:28,629 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:15:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:28,630 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-27 21:15:28,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:28,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272821933] [2019-12-27 21:15:28,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:15:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:15:28,808 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:15:28,809 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:15:28,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= 0 v_~a$mem_tmp~0_9) (= v_~a~0_26 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y~0_14 0) (= v_~a$r_buff0_thd2~0_19 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= |v_ULTIMATE.start_main_~#t1117~0.offset_18| 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1117~0.base_23|)) (= 0 v_~a$r_buff1_thd1~0_19) (= 0 v_~z~0_6) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~a$r_buff1_thd3~0_52) (= v_~a$r_buff0_thd3~0_77 0) (= v_~a$flush_delayed~0_12 0) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1117~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1117~0.base_23|) |v_ULTIMATE.start_main_~#t1117~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1117~0.base_23|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1117~0.base_23| 1) |v_#valid_63|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1117~0.base_23| 4) |v_#length_25|) (= 0 v_~a$w_buff1_used~0_76))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1118~0.base=|v_ULTIMATE.start_main_~#t1118~0.base_21|, ULTIMATE.start_main_~#t1117~0.offset=|v_ULTIMATE.start_main_~#t1117~0.offset_18|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ULTIMATE.start_main_~#t1117~0.base=|v_ULTIMATE.start_main_~#t1117~0.base_23|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_11, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ULTIMATE.start_main_~#t1118~0.offset=|v_ULTIMATE.start_main_~#t1118~0.offset_15|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_14, ULTIMATE.start_main_~#t1119~0.offset=|v_ULTIMATE.start_main_~#t1119~0.offset_16|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_6, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_76, ULTIMATE.start_main_~#t1119~0.base=|v_ULTIMATE.start_main_~#t1119~0.base_20|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1118~0.base, ULTIMATE.start_main_~#t1117~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t1117~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1118~0.offset, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t1119~0.offset, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ULTIMATE.start_main_~#t1119~0.base, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 21:15:28,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1118~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1118~0.base_9|) |v_ULTIMATE.start_main_~#t1118~0.offset_7| 1))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1118~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1118~0.base_9| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1118~0.base_9| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1118~0.base_9| 1) |v_#valid_34|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1118~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1118~0.offset_7| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1118~0.base=|v_ULTIMATE.start_main_~#t1118~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1118~0.offset=|v_ULTIMATE.start_main_~#t1118~0.offset_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1118~0.base, ULTIMATE.start_main_~#t1118~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:15:28,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t1119~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1119~0.base_9| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1119~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1119~0.base_9|) |v_ULTIMATE.start_main_~#t1119~0.offset_8| 2)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1119~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1119~0.base_9| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1119~0.base_9|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1119~0.base_9| 1) |v_#valid_32|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1119~0.offset=|v_ULTIMATE.start_main_~#t1119~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1119~0.base=|v_ULTIMATE.start_main_~#t1119~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1119~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1119~0.base] because there is no mapped edge [2019-12-27 21:15:28,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~a$r_buff0_thd0~0_In1766931967 ~a$r_buff1_thd0~0_Out1766931967) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1766931967 0)) (= ~x~0_In1766931967 ~__unbuffered_p0_EAX~0_Out1766931967) (= ~a$r_buff0_thd1~0_Out1766931967 1) (= ~a$r_buff0_thd1~0_In1766931967 ~a$r_buff1_thd1~0_Out1766931967) (= ~a$r_buff1_thd2~0_Out1766931967 ~a$r_buff0_thd2~0_In1766931967) (= ~a$r_buff1_thd3~0_Out1766931967 ~a$r_buff0_thd3~0_In1766931967)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1766931967, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1766931967, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1766931967, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1766931967, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1766931967, ~x~0=~x~0_In1766931967} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1766931967, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out1766931967, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out1766931967, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out1766931967, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1766931967, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1766931967, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1766931967, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1766931967, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1766931967, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1766931967, ~x~0=~x~0_In1766931967} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:15:28,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-1712148126| |P1Thread1of1ForFork2_#t~ite9_Out-1712148126|)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1712148126 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1712148126 256)))) (or (and .cse0 (= ~a~0_In-1712148126 |P1Thread1of1ForFork2_#t~ite9_Out-1712148126|) (or .cse1 .cse2)) (and (= ~a$w_buff1~0_In-1712148126 |P1Thread1of1ForFork2_#t~ite9_Out-1712148126|) .cse0 (not .cse1) (not .cse2)))) InVars {~a~0=~a~0_In-1712148126, ~a$w_buff1~0=~a$w_buff1~0_In-1712148126, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1712148126, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1712148126} OutVars{~a~0=~a~0_In-1712148126, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1712148126|, ~a$w_buff1~0=~a$w_buff1~0_In-1712148126, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1712148126, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1712148126|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1712148126} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 21:15:28,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In423656946 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out423656946| ~a$w_buff0~0_In423656946) (= |P2Thread1of1ForFork0_#t~ite20_In423656946| |P2Thread1of1ForFork0_#t~ite20_Out423656946|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In423656946 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In423656946 256)) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In423656946 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In423656946 256)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out423656946| ~a$w_buff0~0_In423656946) (= |P2Thread1of1ForFork0_#t~ite21_Out423656946| |P2Thread1of1ForFork0_#t~ite20_Out423656946|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In423656946, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In423656946, ~a$w_buff0_used~0=~a$w_buff0_used~0_In423656946, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In423656946, ~a$w_buff1_used~0=~a$w_buff1_used~0_In423656946, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In423656946|, ~weak$$choice2~0=~weak$$choice2~0_In423656946} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out423656946|, ~a$w_buff0~0=~a$w_buff0~0_In423656946, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In423656946, ~a$w_buff0_used~0=~a$w_buff0_used~0_In423656946, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In423656946, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out423656946|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In423656946, ~weak$$choice2~0=~weak$$choice2~0_In423656946} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 21:15:28,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In310797707 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In310797707 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out310797707| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out310797707| ~a$w_buff0_used~0_In310797707)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In310797707, ~a$w_buff0_used~0=~a$w_buff0_used~0_In310797707} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In310797707, ~a$w_buff0_used~0=~a$w_buff0_used~0_In310797707, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out310797707|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:15:28,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-451368670 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-451368670 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-451368670 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-451368670 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-451368670 |P1Thread1of1ForFork2_#t~ite12_Out-451368670|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-451368670|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-451368670, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-451368670, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-451368670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-451368670} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-451368670, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-451368670, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-451368670, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-451368670|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-451368670} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:15:28,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-143769573 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out-143769573| |P2Thread1of1ForFork0_#t~ite24_Out-143769573|) (= |P2Thread1of1ForFork0_#t~ite23_Out-143769573| ~a$w_buff1~0_In-143769573) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-143769573 256) 0))) (or (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In-143769573 256))) (and (= (mod ~a$r_buff1_thd3~0_In-143769573 256) 0) .cse0) (= 0 (mod ~a$w_buff0_used~0_In-143769573 256)))) .cse1) (and (= ~a$w_buff1~0_In-143769573 |P2Thread1of1ForFork0_#t~ite24_Out-143769573|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In-143769573| |P2Thread1of1ForFork0_#t~ite23_Out-143769573|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-143769573, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-143769573|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-143769573, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-143769573, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-143769573, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-143769573, ~weak$$choice2~0=~weak$$choice2~0_In-143769573} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-143769573, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-143769573|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-143769573|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-143769573, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-143769573, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-143769573, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-143769573, ~weak$$choice2~0=~weak$$choice2~0_In-143769573} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 21:15:28,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1163661638 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1163661638 256)))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1163661638 256) 0) .cse0) (and (= 0 (mod ~a$w_buff1_used~0_In-1163661638 256)) .cse0) (= 0 (mod ~a$w_buff0_used~0_In-1163661638 256)))) (= |P2Thread1of1ForFork0_#t~ite27_Out-1163661638| |P2Thread1of1ForFork0_#t~ite26_Out-1163661638|) .cse1 (= ~a$w_buff0_used~0_In-1163661638 |P2Thread1of1ForFork0_#t~ite26_Out-1163661638|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In-1163661638| |P2Thread1of1ForFork0_#t~ite26_Out-1163661638|) (= ~a$w_buff0_used~0_In-1163661638 |P2Thread1of1ForFork0_#t~ite27_Out-1163661638|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1163661638|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1163661638, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1163661638, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1163661638, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1163661638, ~weak$$choice2~0=~weak$$choice2~0_In-1163661638} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1163661638|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1163661638|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1163661638, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1163661638, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1163661638, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1163661638, ~weak$$choice2~0=~weak$$choice2~0_In-1163661638} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 21:15:28,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-401138406 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-401138406 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-401138406| ~a$r_buff0_thd2~0_In-401138406) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-401138406| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-401138406, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-401138406} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-401138406, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-401138406, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-401138406|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 21:15:28,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1463776124 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1463776124 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1463776124 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1463776124 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1463776124| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1463776124| ~a$r_buff1_thd2~0_In-1463776124) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1463776124, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1463776124, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1463776124, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1463776124} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1463776124, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1463776124, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1463776124, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1463776124, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1463776124|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:15:28,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L772-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 21:15:28,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_51 v_~a$r_buff0_thd3~0_50)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:15:28,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_19 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_19, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 21:15:28,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-616644468 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-616644468 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-616644468| ~a~0_In-616644468)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-616644468| ~a$w_buff1~0_In-616644468) (not .cse1)))) InVars {~a~0=~a~0_In-616644468, ~a$w_buff1~0=~a$w_buff1~0_In-616644468, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-616644468, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-616644468} OutVars{~a~0=~a~0_In-616644468, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-616644468|, ~a$w_buff1~0=~a$w_buff1~0_In-616644468, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-616644468, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-616644468} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:15:28,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:15:28,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In876796992 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In876796992 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out876796992|) (not .cse1)) (and (= ~a$w_buff0_used~0_In876796992 |P2Thread1of1ForFork0_#t~ite40_Out876796992|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In876796992, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In876796992} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out876796992|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In876796992, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In876796992} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 21:15:28,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In833890006 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In833890006 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In833890006 |P0Thread1of1ForFork1_#t~ite5_Out833890006|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out833890006|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In833890006, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In833890006} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out833890006|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In833890006, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In833890006} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:15:28,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1503316999 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1503316999 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1503316999 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-1503316999 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1503316999| ~a$w_buff1_used~0_In-1503316999)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1503316999|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1503316999, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1503316999, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1503316999, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503316999} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1503316999|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1503316999, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1503316999, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1503316999, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503316999} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:15:28,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-77179902 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-77179902 256)))) (or (and (= ~a$r_buff0_thd1~0_In-77179902 ~a$r_buff0_thd1~0_Out-77179902) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-77179902) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-77179902, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-77179902} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-77179902|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-77179902, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-77179902} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:15:28,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In2139381170 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In2139381170 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd1~0_In2139381170 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In2139381170 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out2139381170| ~a$r_buff1_thd1~0_In2139381170)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out2139381170| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2139381170, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2139381170, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2139381170, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2139381170} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out2139381170|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2139381170, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2139381170, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2139381170, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2139381170} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:15:28,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L752-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:15:28,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-1058024551 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-1058024551 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1058024551 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1058024551 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1058024551 |P2Thread1of1ForFork0_#t~ite41_Out-1058024551|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1058024551|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1058024551, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1058024551, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1058024551, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1058024551} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1058024551, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1058024551, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1058024551, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1058024551, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1058024551|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 21:15:28,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-633106512 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-633106512 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-633106512| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-633106512| ~a$r_buff0_thd3~0_In-633106512) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-633106512, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-633106512} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-633106512, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-633106512, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-633106512|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 21:15:28,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In216572401 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In216572401 256))) (.cse2 (= (mod ~a$r_buff1_thd3~0_In216572401 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In216572401 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In216572401 |P2Thread1of1ForFork0_#t~ite43_Out216572401|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out216572401|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In216572401, ~a$w_buff0_used~0=~a$w_buff0_used~0_In216572401, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In216572401, ~a$w_buff1_used~0=~a$w_buff1_used~0_In216572401} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out216572401|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In216572401, ~a$w_buff0_used~0=~a$w_buff0_used~0_In216572401, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In216572401, ~a$w_buff1_used~0=~a$w_buff1_used~0_In216572401} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 21:15:28,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 21:15:28,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:15:28,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1038510281| |ULTIMATE.start_main_#t~ite48_Out1038510281|)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In1038510281 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1038510281 256)))) (or (and .cse0 (= ~a~0_In1038510281 |ULTIMATE.start_main_#t~ite47_Out1038510281|) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= ~a$w_buff1~0_In1038510281 |ULTIMATE.start_main_#t~ite47_Out1038510281|)))) InVars {~a~0=~a~0_In1038510281, ~a$w_buff1~0=~a$w_buff1~0_In1038510281, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1038510281, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1038510281} OutVars{~a~0=~a~0_In1038510281, ~a$w_buff1~0=~a$w_buff1~0_In1038510281, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1038510281|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1038510281, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1038510281|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1038510281} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:15:28,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-434300008 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-434300008 256) 0))) (or (and (= ~a$w_buff0_used~0_In-434300008 |ULTIMATE.start_main_#t~ite49_Out-434300008|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-434300008|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-434300008, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-434300008} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-434300008, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-434300008|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-434300008} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:15:28,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In1176875024 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1176875024 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1176875024 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In1176875024 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1176875024|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In1176875024 |ULTIMATE.start_main_#t~ite50_Out1176875024|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1176875024, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1176875024, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1176875024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1176875024} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1176875024|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1176875024, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1176875024, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1176875024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1176875024} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:15:28,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1599845806 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1599845806 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1599845806|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In1599845806 |ULTIMATE.start_main_#t~ite51_Out1599845806|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1599845806, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1599845806} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1599845806|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1599845806, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1599845806} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:15:28,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In172130274 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In172130274 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In172130274 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In172130274 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In172130274 |ULTIMATE.start_main_#t~ite52_Out172130274|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite52_Out172130274|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In172130274, ~a$w_buff0_used~0=~a$w_buff0_used~0_In172130274, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In172130274, ~a$w_buff1_used~0=~a$w_buff1_used~0_In172130274} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out172130274|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In172130274, ~a$w_buff0_used~0=~a$w_buff0_used~0_In172130274, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In172130274, ~a$w_buff1_used~0=~a$w_buff1_used~0_In172130274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:15:28,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_10 0) (= 2 v_~y~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:15:28,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:15:28 BasicIcfg [2019-12-27 21:15:28,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:15:28,940 INFO L168 Benchmark]: Toolchain (without parser) took 131766.65 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 101.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:15:28,941 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:15:28,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.32 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 156.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:15:28,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.30 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:15:28,947 INFO L168 Benchmark]: Boogie Preprocessor took 74.81 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:15:28,947 INFO L168 Benchmark]: RCFGBuilder took 866.15 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 100.7 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:15:28,948 INFO L168 Benchmark]: TraceAbstraction took 129849.54 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:15:28,951 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 865.32 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 156.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 105.30 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.81 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 866.15 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 100.7 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 129849.54 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 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, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7189 VarBasedMoverChecksPositive, 222 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80962 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1117, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1118, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1119, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 129.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 58.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7738 SDtfs, 13263 SDslu, 22132 SDs, 0 SdLazy, 23897 SolverSat, 948 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 754 GetRequests, 206 SyntacticMatches, 67 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5731 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141665occurred 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: 39.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 501265 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1365 NumberOfCodeBlocks, 1365 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1268 ConstructedInterpolants, 0 QuantifiedInterpolants, 206838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...