/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/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:56:25,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:56:25,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:56:25,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:56:25,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:56:25,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:56:25,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:56:25,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:56:25,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:56:25,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:56:25,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:56:25,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:56:25,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:56:25,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:56:25,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:56:25,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:56:25,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:56:25,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:56:25,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:56:25,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:56:25,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:56:25,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:56:25,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:56:25,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:56:25,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:56:25,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:56:25,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:56:25,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:56:25,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:56:25,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:56:25,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:56:25,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:56:25,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:56:25,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:56:25,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:56:25,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:56:25,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:56:25,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:56:25,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:56:25,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:56:25,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:56:25,117 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 22:56:25,139 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:56:25,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:56:25,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:56:25,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:56:25,142 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:56:25,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:56:25,143 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:56:25,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:56:25,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:56:25,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:56:25,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:56:25,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:56:25,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:56:25,145 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:56:25,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:56:25,146 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:56:25,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:56:25,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:56:25,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:56:25,147 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:56:25,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:56:25,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:56:25,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:56:25,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:56:25,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:56:25,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:56:25,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:56:25,148 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:56:25,149 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:56:25,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:56:25,150 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:56:25,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:56:25,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:56:25,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:56:25,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:56:25,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:56:25,476 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:56:25,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-27 22:56:25,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcba1d46/bd9b410280154ce88b94cfee0c276efb/FLAG08c1bd4da [2019-12-27 22:56:26,115 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:56:26,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-27 22:56:26,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcba1d46/bd9b410280154ce88b94cfee0c276efb/FLAG08c1bd4da [2019-12-27 22:56:26,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcba1d46/bd9b410280154ce88b94cfee0c276efb [2019-12-27 22:56:26,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:56:26,356 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:56:26,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:56:26,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:56:26,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:56:26,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:56:26" (1/1) ... [2019-12-27 22:56:26,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c126812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:26, skipping insertion in model container [2019-12-27 22:56:26,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:56:26" (1/1) ... [2019-12-27 22:56:26,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:56:26,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:56:26,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:56:26,910 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:56:26,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:56:27,064 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:56:27,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27 WrapperNode [2019-12-27 22:56:27,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:56:27,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:56:27,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:56:27,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:56:27,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (1/1) ... [2019-12-27 22:56:27,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (1/1) ... [2019-12-27 22:56:27,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:56:27,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:56:27,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:56:27,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:56:27,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (1/1) ... [2019-12-27 22:56:27,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (1/1) ... [2019-12-27 22:56:27,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (1/1) ... [2019-12-27 22:56:27,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (1/1) ... [2019-12-27 22:56:27,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (1/1) ... [2019-12-27 22:56:27,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (1/1) ... [2019-12-27 22:56:27,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (1/1) ... [2019-12-27 22:56:27,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:56:27,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:56:27,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:56:27,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:56:27,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (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 22:56:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:56:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:56:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:56:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:56:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:56:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:56:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:56:27,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:56:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:56:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:56:27,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:56:27,238 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 22:56:27,947 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:56:27,948 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:56:27,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:56:27 BoogieIcfgContainer [2019-12-27 22:56:27,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:56:27,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:56:27,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:56:27,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:56:27,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:56:26" (1/3) ... [2019-12-27 22:56:27,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cda5f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:56:27, skipping insertion in model container [2019-12-27 22:56:27,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:27" (2/3) ... [2019-12-27 22:56:27,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cda5f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:56:27, skipping insertion in model container [2019-12-27 22:56:27,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:56:27" (3/3) ... [2019-12-27 22:56:27,961 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2019-12-27 22:56:27,972 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:56:27,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:56:27,986 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:56:27,987 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:56:28,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,035 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,035 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,045 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,045 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,067 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,072 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,073 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:28,092 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 22:56:28,109 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:56:28,109 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:56:28,109 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:56:28,109 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:56:28,110 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:56:28,110 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:56:28,124 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:56:28,124 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:56:28,141 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 22:56:28,143 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 22:56:28,263 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 22:56:28,263 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:56:28,279 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:56:28,293 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 22:56:28,367 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 22:56:28,368 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:56:28,373 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:56:28,385 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 22:56:28,387 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:56:31,391 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 22:56:31,509 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48987 [2019-12-27 22:56:31,509 INFO L214 etLargeBlockEncoding]: Total number of compositions: 94 [2019-12-27 22:56:31,512 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-27 22:56:32,045 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9272 states. [2019-12-27 22:56:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 9272 states. [2019-12-27 22:56:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:56:32,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:32,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:56:32,056 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:32,113 INFO L82 PathProgramCache]: Analyzing trace with hash 713212, now seen corresponding path program 1 times [2019-12-27 22:56:32,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:32,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058935146] [2019-12-27 22:56:32,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:56:32,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058935146] [2019-12-27 22:56:32,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:32,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:56:32,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1382973100] [2019-12-27 22:56:32,334 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:32,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:32,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:56:32,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:32,360 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:32,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:56:32,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:32,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:56:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:56:32,380 INFO L87 Difference]: Start difference. First operand 9272 states. Second operand 3 states. [2019-12-27 22:56:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:32,619 INFO L93 Difference]: Finished difference Result 9157 states and 30129 transitions. [2019-12-27 22:56:32,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:56:32,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:56:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:32,721 INFO L225 Difference]: With dead ends: 9157 [2019-12-27 22:56:32,721 INFO L226 Difference]: Without dead ends: 8975 [2019-12-27 22:56:32,723 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 22:56:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8975 states. [2019-12-27 22:56:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8975 to 8975. [2019-12-27 22:56:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8975 states. [2019-12-27 22:56:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8975 states to 8975 states and 29569 transitions. [2019-12-27 22:56:33,238 INFO L78 Accepts]: Start accepts. Automaton has 8975 states and 29569 transitions. Word has length 3 [2019-12-27 22:56:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:33,238 INFO L462 AbstractCegarLoop]: Abstraction has 8975 states and 29569 transitions. [2019-12-27 22:56:33,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:56:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 8975 states and 29569 transitions. [2019-12-27 22:56:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:56:33,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:33,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:33,242 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1430597214, now seen corresponding path program 1 times [2019-12-27 22:56:33,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:33,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616663615] [2019-12-27 22:56:33,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:33,380 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 22:56:33,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616663615] [2019-12-27 22:56:33,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:33,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:56:33,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [44018165] [2019-12-27 22:56:33,382 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:33,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:33,386 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:56:33,386 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:33,386 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:33,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:56:33,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:33,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:56:33,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:56:33,389 INFO L87 Difference]: Start difference. First operand 8975 states and 29569 transitions. Second operand 4 states. [2019-12-27 22:56:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:33,743 INFO L93 Difference]: Finished difference Result 13878 states and 43543 transitions. [2019-12-27 22:56:33,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:56:33,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:56:33,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:33,816 INFO L225 Difference]: With dead ends: 13878 [2019-12-27 22:56:33,816 INFO L226 Difference]: Without dead ends: 13871 [2019-12-27 22:56:33,817 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 22:56:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13871 states. [2019-12-27 22:56:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 12673. [2019-12-27 22:56:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-27 22:56:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 40347 transitions. [2019-12-27 22:56:34,828 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 40347 transitions. Word has length 11 [2019-12-27 22:56:34,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:34,828 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 40347 transitions. [2019-12-27 22:56:34,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:56:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 40347 transitions. [2019-12-27 22:56:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:56:34,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:34,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:34,832 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:34,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash 244087264, now seen corresponding path program 1 times [2019-12-27 22:56:34,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:34,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991493502] [2019-12-27 22:56:34,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:56:34,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991493502] [2019-12-27 22:56:34,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:34,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:56:34,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [504012063] [2019-12-27 22:56:34,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:34,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:34,907 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:56:34,907 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:34,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:34,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:56:34,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:56:34,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:56:34,909 INFO L87 Difference]: Start difference. First operand 12673 states and 40347 transitions. Second operand 4 states. [2019-12-27 22:56:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:35,174 INFO L93 Difference]: Finished difference Result 15173 states and 47858 transitions. [2019-12-27 22:56:35,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:56:35,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:56:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:35,222 INFO L225 Difference]: With dead ends: 15173 [2019-12-27 22:56:35,222 INFO L226 Difference]: Without dead ends: 15173 [2019-12-27 22:56:35,223 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 22:56:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15173 states. [2019-12-27 22:56:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15173 to 13657. [2019-12-27 22:56:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-12-27 22:56:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 43454 transitions. [2019-12-27 22:56:35,764 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 43454 transitions. Word has length 11 [2019-12-27 22:56:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:35,773 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 43454 transitions. [2019-12-27 22:56:35,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:56:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 43454 transitions. [2019-12-27 22:56:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 22:56:35,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:35,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:35,780 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:35,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1210915997, now seen corresponding path program 1 times [2019-12-27 22:56:35,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:35,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046289729] [2019-12-27 22:56:35,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:35,913 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 22:56:35,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046289729] [2019-12-27 22:56:35,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:35,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:56:35,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099830234] [2019-12-27 22:56:35,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:35,919 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:35,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 45 transitions. [2019-12-27 22:56:35,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:35,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:56:35,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:56:35,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:35,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:56:35,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:56:35,931 INFO L87 Difference]: Start difference. First operand 13657 states and 43454 transitions. Second operand 5 states. [2019-12-27 22:56:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:36,567 INFO L93 Difference]: Finished difference Result 18000 states and 55976 transitions. [2019-12-27 22:56:36,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:56:36,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 22:56:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:36,614 INFO L225 Difference]: With dead ends: 18000 [2019-12-27 22:56:36,614 INFO L226 Difference]: Without dead ends: 17993 [2019-12-27 22:56:36,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:56:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17993 states. [2019-12-27 22:56:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17993 to 13513. [2019-12-27 22:56:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13513 states. [2019-12-27 22:56:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13513 states to 13513 states and 42886 transitions. [2019-12-27 22:56:37,043 INFO L78 Accepts]: Start accepts. Automaton has 13513 states and 42886 transitions. Word has length 17 [2019-12-27 22:56:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:37,043 INFO L462 AbstractCegarLoop]: Abstraction has 13513 states and 42886 transitions. [2019-12-27 22:56:37,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:56:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13513 states and 42886 transitions. [2019-12-27 22:56:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:56:37,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:37,057 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 22:56:37,057 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash 368877695, now seen corresponding path program 1 times [2019-12-27 22:56:37,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:37,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201669124] [2019-12-27 22:56:37,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:37,104 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 22:56:37,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201669124] [2019-12-27 22:56:37,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:37,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:56:37,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781391484] [2019-12-27 22:56:37,105 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:37,110 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:37,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:56:37,115 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:37,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:37,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:56:37,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:56:37,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:56:37,117 INFO L87 Difference]: Start difference. First operand 13513 states and 42886 transitions. Second operand 3 states. [2019-12-27 22:56:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:37,431 INFO L93 Difference]: Finished difference Result 16497 states and 51650 transitions. [2019-12-27 22:56:37,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:56:37,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 22:56:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:37,467 INFO L225 Difference]: With dead ends: 16497 [2019-12-27 22:56:37,467 INFO L226 Difference]: Without dead ends: 16497 [2019-12-27 22:56:37,467 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 22:56:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16497 states. [2019-12-27 22:56:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16497 to 14538. [2019-12-27 22:56:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14538 states. [2019-12-27 22:56:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14538 states to 14538 states and 46033 transitions. [2019-12-27 22:56:37,877 INFO L78 Accepts]: Start accepts. Automaton has 14538 states and 46033 transitions. Word has length 25 [2019-12-27 22:56:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:37,878 INFO L462 AbstractCegarLoop]: Abstraction has 14538 states and 46033 transitions. [2019-12-27 22:56:37,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:56:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 14538 states and 46033 transitions. [2019-12-27 22:56:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:56:37,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:37,892 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 22:56:37,892 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash 276108521, now seen corresponding path program 1 times [2019-12-27 22:56:37,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:37,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771157932] [2019-12-27 22:56:37,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:56:38,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771157932] [2019-12-27 22:56:38,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:38,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:56:38,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119891827] [2019-12-27 22:56:38,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:38,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:38,023 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:56:38,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:38,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:38,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:56:38,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:38,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:56:38,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:56:38,024 INFO L87 Difference]: Start difference. First operand 14538 states and 46033 transitions. Second operand 6 states. [2019-12-27 22:56:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:39,187 INFO L93 Difference]: Finished difference Result 20241 states and 62761 transitions. [2019-12-27 22:56:39,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:56:39,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 22:56:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:39,214 INFO L225 Difference]: With dead ends: 20241 [2019-12-27 22:56:39,214 INFO L226 Difference]: Without dead ends: 20225 [2019-12-27 22:56:39,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:56:39,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20225 states. [2019-12-27 22:56:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 16589. [2019-12-27 22:56:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16589 states. [2019-12-27 22:56:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16589 states to 16589 states and 52200 transitions. [2019-12-27 22:56:39,711 INFO L78 Accepts]: Start accepts. Automaton has 16589 states and 52200 transitions. Word has length 25 [2019-12-27 22:56:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:39,711 INFO L462 AbstractCegarLoop]: Abstraction has 16589 states and 52200 transitions. [2019-12-27 22:56:39,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:56:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 16589 states and 52200 transitions. [2019-12-27 22:56:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 22:56:39,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:39,737 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] [2019-12-27 22:56:39,737 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1785185324, now seen corresponding path program 1 times [2019-12-27 22:56:39,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:39,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240118951] [2019-12-27 22:56:39,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:39,824 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 22:56:39,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240118951] [2019-12-27 22:56:39,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:39,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:56:39,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506872773] [2019-12-27 22:56:39,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:39,830 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:39,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 68 transitions. [2019-12-27 22:56:39,842 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:39,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:56:39,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:56:39,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:39,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:56:39,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:56:39,888 INFO L87 Difference]: Start difference. First operand 16589 states and 52200 transitions. Second operand 6 states. [2019-12-27 22:56:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:40,296 INFO L93 Difference]: Finished difference Result 2520 states and 5775 transitions. [2019-12-27 22:56:40,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:56:40,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 22:56:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:40,299 INFO L225 Difference]: With dead ends: 2520 [2019-12-27 22:56:40,299 INFO L226 Difference]: Without dead ends: 2213 [2019-12-27 22:56:40,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:56:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2019-12-27 22:56:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2039. [2019-12-27 22:56:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-12-27 22:56:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 4534 transitions. [2019-12-27 22:56:40,329 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 4534 transitions. Word has length 31 [2019-12-27 22:56:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:40,329 INFO L462 AbstractCegarLoop]: Abstraction has 2039 states and 4534 transitions. [2019-12-27 22:56:40,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:56:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 4534 transitions. [2019-12-27 22:56:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:56:40,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:40,333 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] [2019-12-27 22:56:40,333 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1705539938, now seen corresponding path program 1 times [2019-12-27 22:56:40,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:40,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253425698] [2019-12-27 22:56:40,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:40,449 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 22:56:40,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253425698] [2019-12-27 22:56:40,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:40,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:56:40,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [143895257] [2019-12-27 22:56:40,450 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:40,458 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:40,469 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 22:56:40,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:40,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:40,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:56:40,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:40,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:56:40,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:56:40,472 INFO L87 Difference]: Start difference. First operand 2039 states and 4534 transitions. Second operand 7 states. [2019-12-27 22:56:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:41,055 INFO L93 Difference]: Finished difference Result 2608 states and 5669 transitions. [2019-12-27 22:56:41,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:56:41,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 22:56:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:41,060 INFO L225 Difference]: With dead ends: 2608 [2019-12-27 22:56:41,060 INFO L226 Difference]: Without dead ends: 2606 [2019-12-27 22:56:41,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:56:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2019-12-27 22:56:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2100. [2019-12-27 22:56:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-27 22:56:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4675 transitions. [2019-12-27 22:56:41,083 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4675 transitions. Word has length 37 [2019-12-27 22:56:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:41,083 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 4675 transitions. [2019-12-27 22:56:41,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:56:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4675 transitions. [2019-12-27 22:56:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:56:41,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:41,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:41,087 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1992807550, now seen corresponding path program 1 times [2019-12-27 22:56:41,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:41,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193424102] [2019-12-27 22:56:41,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:41,183 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 22:56:41,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193424102] [2019-12-27 22:56:41,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:41,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:56:41,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [938417121] [2019-12-27 22:56:41,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:41,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:41,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 85 transitions. [2019-12-27 22:56:41,209 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:41,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:56:41,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:56:41,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:56:41,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:56:41,355 INFO L87 Difference]: Start difference. First operand 2100 states and 4675 transitions. Second operand 8 states. [2019-12-27 22:56:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:42,154 INFO L93 Difference]: Finished difference Result 2859 states and 6230 transitions. [2019-12-27 22:56:42,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:56:42,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 22:56:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:42,158 INFO L225 Difference]: With dead ends: 2859 [2019-12-27 22:56:42,158 INFO L226 Difference]: Without dead ends: 2859 [2019-12-27 22:56:42,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:56:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2019-12-27 22:56:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2524. [2019-12-27 22:56:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2019-12-27 22:56:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 5561 transitions. [2019-12-27 22:56:42,192 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 5561 transitions. Word has length 41 [2019-12-27 22:56:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:42,192 INFO L462 AbstractCegarLoop]: Abstraction has 2524 states and 5561 transitions. [2019-12-27 22:56:42,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:56:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 5561 transitions. [2019-12-27 22:56:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:56:42,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:42,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:42,195 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash 621749952, now seen corresponding path program 1 times [2019-12-27 22:56:42,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:42,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422638018] [2019-12-27 22:56:42,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:42,299 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 22:56:42,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422638018] [2019-12-27 22:56:42,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:42,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:56:42,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1694955297] [2019-12-27 22:56:42,300 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:42,309 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:42,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 48 transitions. [2019-12-27 22:56:42,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:42,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:42,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:56:42,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:42,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:56:42,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:56:42,322 INFO L87 Difference]: Start difference. First operand 2524 states and 5561 transitions. Second operand 5 states. [2019-12-27 22:56:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:42,892 INFO L93 Difference]: Finished difference Result 3398 states and 7362 transitions. [2019-12-27 22:56:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:56:42,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 22:56:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:42,897 INFO L225 Difference]: With dead ends: 3398 [2019-12-27 22:56:42,897 INFO L226 Difference]: Without dead ends: 3398 [2019-12-27 22:56:42,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:56:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-12-27 22:56:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 2821. [2019-12-27 22:56:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-12-27 22:56:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 6202 transitions. [2019-12-27 22:56:42,955 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 6202 transitions. Word has length 42 [2019-12-27 22:56:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:42,955 INFO L462 AbstractCegarLoop]: Abstraction has 2821 states and 6202 transitions. [2019-12-27 22:56:42,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:56:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 6202 transitions. [2019-12-27 22:56:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:56:42,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:42,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:42,959 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:42,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:42,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1119205876, now seen corresponding path program 1 times [2019-12-27 22:56:42,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:42,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022537713] [2019-12-27 22:56:42,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:43,589 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 22:56:43,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022537713] [2019-12-27 22:56:43,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:43,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 22:56:43,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1190384158] [2019-12-27 22:56:43,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:43,605 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:43,631 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 86 transitions. [2019-12-27 22:56:43,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:44,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 22:56:44,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 22:56:44,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:44,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 22:56:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:56:44,140 INFO L87 Difference]: Start difference. First operand 2821 states and 6202 transitions. Second operand 24 states. [2019-12-27 22:56:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:47,076 INFO L93 Difference]: Finished difference Result 5130 states and 11111 transitions. [2019-12-27 22:56:47,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 22:56:47,077 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-12-27 22:56:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:47,082 INFO L225 Difference]: With dead ends: 5130 [2019-12-27 22:56:47,082 INFO L226 Difference]: Without dead ends: 4369 [2019-12-27 22:56:47,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=288, Invalid=1692, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 22:56:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2019-12-27 22:56:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 3341. [2019-12-27 22:56:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3341 states. [2019-12-27 22:56:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 7325 transitions. [2019-12-27 22:56:47,119 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 7325 transitions. Word has length 42 [2019-12-27 22:56:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:47,119 INFO L462 AbstractCegarLoop]: Abstraction has 3341 states and 7325 transitions. [2019-12-27 22:56:47,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 22:56:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 7325 transitions. [2019-12-27 22:56:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:56:47,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:47,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:47,125 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:47,126 INFO L82 PathProgramCache]: Analyzing trace with hash 623105743, now seen corresponding path program 1 times [2019-12-27 22:56:47,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:47,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129672817] [2019-12-27 22:56:47,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:47,223 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 22:56:47,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129672817] [2019-12-27 22:56:47,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:47,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:56:47,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866977604] [2019-12-27 22:56:47,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:47,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:47,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 90 transitions. [2019-12-27 22:56:47,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:47,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:56:47,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:56:47,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:47,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:56:47,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:56:47,270 INFO L87 Difference]: Start difference. First operand 3341 states and 7325 transitions. Second operand 6 states. [2019-12-27 22:56:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:47,381 INFO L93 Difference]: Finished difference Result 5584 states and 12361 transitions. [2019-12-27 22:56:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:56:47,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 22:56:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:47,386 INFO L225 Difference]: With dead ends: 5584 [2019-12-27 22:56:47,387 INFO L226 Difference]: Without dead ends: 2620 [2019-12-27 22:56:47,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:56:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2019-12-27 22:56:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2531. [2019-12-27 22:56:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2531 states. [2019-12-27 22:56:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 5549 transitions. [2019-12-27 22:56:47,430 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 5549 transitions. Word has length 42 [2019-12-27 22:56:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:47,431 INFO L462 AbstractCegarLoop]: Abstraction has 2531 states and 5549 transitions. [2019-12-27 22:56:47,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:56:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 5549 transitions. [2019-12-27 22:56:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 22:56:47,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:47,437 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] [2019-12-27 22:56:47,437 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:47,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:47,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1922052399, now seen corresponding path program 1 times [2019-12-27 22:56:47,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:47,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586924743] [2019-12-27 22:56:47,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:47,665 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 22:56:47,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586924743] [2019-12-27 22:56:47,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:47,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:56:47,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2011526936] [2019-12-27 22:56:47,666 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:47,678 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:47,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 22:56:47,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:47,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:47,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:56:47,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:47,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:56:47,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:56:47,696 INFO L87 Difference]: Start difference. First operand 2531 states and 5549 transitions. Second operand 12 states. [2019-12-27 22:56:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:48,020 INFO L93 Difference]: Finished difference Result 2942 states and 6406 transitions. [2019-12-27 22:56:48,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:56:48,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2019-12-27 22:56:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:48,024 INFO L225 Difference]: With dead ends: 2942 [2019-12-27 22:56:48,025 INFO L226 Difference]: Without dead ends: 2810 [2019-12-27 22:56:48,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:56:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2019-12-27 22:56:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2514. [2019-12-27 22:56:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-12-27 22:56:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 5498 transitions. [2019-12-27 22:56:48,068 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 5498 transitions. Word has length 43 [2019-12-27 22:56:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:48,068 INFO L462 AbstractCegarLoop]: Abstraction has 2514 states and 5498 transitions. [2019-12-27 22:56:48,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:56:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 5498 transitions. [2019-12-27 22:56:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 22:56:48,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:48,073 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] [2019-12-27 22:56:48,073 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:48,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:48,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1108667892, now seen corresponding path program 1 times [2019-12-27 22:56:48,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:48,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397392709] [2019-12-27 22:56:48,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:48,182 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 22:56:48,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397392709] [2019-12-27 22:56:48,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:48,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:56:48,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1679972311] [2019-12-27 22:56:48,183 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:48,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:48,204 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 47 transitions. [2019-12-27 22:56:48,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:48,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:48,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:56:48,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:48,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:56:48,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:56:48,206 INFO L87 Difference]: Start difference. First operand 2514 states and 5498 transitions. Second operand 5 states. [2019-12-27 22:56:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:48,251 INFO L93 Difference]: Finished difference Result 576 states and 1045 transitions. [2019-12-27 22:56:48,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:56:48,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 22:56:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:48,252 INFO L225 Difference]: With dead ends: 576 [2019-12-27 22:56:48,252 INFO L226 Difference]: Without dead ends: 471 [2019-12-27 22:56:48,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:56:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-27 22:56:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 388. [2019-12-27 22:56:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 22:56:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 719 transitions. [2019-12-27 22:56:48,259 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 719 transitions. Word has length 43 [2019-12-27 22:56:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:48,259 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 719 transitions. [2019-12-27 22:56:48,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:56:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 719 transitions. [2019-12-27 22:56:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:56:48,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:48,261 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] [2019-12-27 22:56:48,261 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:48,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:48,261 INFO L82 PathProgramCache]: Analyzing trace with hash -302310553, now seen corresponding path program 1 times [2019-12-27 22:56:48,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:48,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344600796] [2019-12-27 22:56:48,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:48,367 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 22:56:48,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344600796] [2019-12-27 22:56:48,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:48,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:56:48,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [810994569] [2019-12-27 22:56:48,368 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:48,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:48,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 117 transitions. [2019-12-27 22:56:48,421 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:48,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:56:48,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:56:48,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:56:48,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:56:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:56:48,491 INFO L87 Difference]: Start difference. First operand 388 states and 719 transitions. Second operand 10 states. [2019-12-27 22:56:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:49,066 INFO L93 Difference]: Finished difference Result 532 states and 975 transitions. [2019-12-27 22:56:49,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:56:49,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-27 22:56:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:49,068 INFO L225 Difference]: With dead ends: 532 [2019-12-27 22:56:49,068 INFO L226 Difference]: Without dead ends: 532 [2019-12-27 22:56:49,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:56:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-27 22:56:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 407. [2019-12-27 22:56:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-27 22:56:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 754 transitions. [2019-12-27 22:56:49,075 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 754 transitions. Word has length 52 [2019-12-27 22:56:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:49,075 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 754 transitions. [2019-12-27 22:56:49,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:56:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 754 transitions. [2019-12-27 22:56:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:56:49,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:49,077 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] [2019-12-27 22:56:49,077 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash -936120261, now seen corresponding path program 1 times [2019-12-27 22:56:49,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:49,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677316669] [2019-12-27 22:56:49,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:49,149 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 22:56:49,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677316669] [2019-12-27 22:56:49,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:49,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:56:49,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260030351] [2019-12-27 22:56:49,150 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:49,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:49,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 110 transitions. [2019-12-27 22:56:49,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:49,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:56:49,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:56:49,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:49,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:56:49,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:56:49,206 INFO L87 Difference]: Start difference. First operand 407 states and 754 transitions. Second operand 4 states. [2019-12-27 22:56:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:49,325 INFO L93 Difference]: Finished difference Result 434 states and 767 transitions. [2019-12-27 22:56:49,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:56:49,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 22:56:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:49,326 INFO L225 Difference]: With dead ends: 434 [2019-12-27 22:56:49,326 INFO L226 Difference]: Without dead ends: 434 [2019-12-27 22:56:49,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 22:56:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-27 22:56:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 357. [2019-12-27 22:56:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-12-27 22:56:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 641 transitions. [2019-12-27 22:56:49,332 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 641 transitions. Word has length 53 [2019-12-27 22:56:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:49,332 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 641 transitions. [2019-12-27 22:56:49,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:56:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 641 transitions. [2019-12-27 22:56:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:56:49,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:49,333 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] [2019-12-27 22:56:49,333 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:49,333 INFO L82 PathProgramCache]: Analyzing trace with hash -504557933, now seen corresponding path program 1 times [2019-12-27 22:56:49,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:49,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526421089] [2019-12-27 22:56:49,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:49,396 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 22:56:49,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526421089] [2019-12-27 22:56:49,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:49,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:56:49,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248281592] [2019-12-27 22:56:49,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:49,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:49,446 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 114 transitions. [2019-12-27 22:56:49,446 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:49,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:49,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:56:49,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:49,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:56:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:56:49,448 INFO L87 Difference]: Start difference. First operand 357 states and 641 transitions. Second operand 3 states. [2019-12-27 22:56:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:49,491 INFO L93 Difference]: Finished difference Result 356 states and 639 transitions. [2019-12-27 22:56:49,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:56:49,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 22:56:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:49,492 INFO L225 Difference]: With dead ends: 356 [2019-12-27 22:56:49,492 INFO L226 Difference]: Without dead ends: 356 [2019-12-27 22:56:49,493 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 22:56:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-27 22:56:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 220. [2019-12-27 22:56:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-27 22:56:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 391 transitions. [2019-12-27 22:56:49,497 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 391 transitions. Word has length 53 [2019-12-27 22:56:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:49,497 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 391 transitions. [2019-12-27 22:56:49,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:56:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 391 transitions. [2019-12-27 22:56:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:56:49,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:49,498 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] [2019-12-27 22:56:49,498 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash 10303747, now seen corresponding path program 1 times [2019-12-27 22:56:49,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:49,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117419319] [2019-12-27 22:56:49,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:49,703 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 22:56:49,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117419319] [2019-12-27 22:56:49,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:49,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:56:49,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575286132] [2019-12-27 22:56:49,704 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:49,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:49,751 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 113 transitions. [2019-12-27 22:56:49,751 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:49,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:56:49,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:56:49,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:56:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:56:49,940 INFO L87 Difference]: Start difference. First operand 220 states and 391 transitions. Second operand 17 states. [2019-12-27 22:56:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:52,033 INFO L93 Difference]: Finished difference Result 566 states and 962 transitions. [2019-12-27 22:56:52,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 22:56:52,033 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-27 22:56:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:52,034 INFO L225 Difference]: With dead ends: 566 [2019-12-27 22:56:52,034 INFO L226 Difference]: Without dead ends: 534 [2019-12-27 22:56:52,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 22:56:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-12-27 22:56:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 320. [2019-12-27 22:56:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 22:56:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 562 transitions. [2019-12-27 22:56:52,040 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 562 transitions. Word has length 54 [2019-12-27 22:56:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:52,040 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 562 transitions. [2019-12-27 22:56:52,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:56:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 562 transitions. [2019-12-27 22:56:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:56:52,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:52,041 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] [2019-12-27 22:56:52,041 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash 691777001, now seen corresponding path program 2 times [2019-12-27 22:56:52,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:52,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669229297] [2019-12-27 22:56:52,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:52,335 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 22:56:52,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669229297] [2019-12-27 22:56:52,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:52,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:56:52,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [662406829] [2019-12-27 22:56:52,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:52,363 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:52,397 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 102 transitions. [2019-12-27 22:56:52,397 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:52,444 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:56:52,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:56:52,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:52,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:56:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:56:52,445 INFO L87 Difference]: Start difference. First operand 320 states and 562 transitions. Second operand 13 states. [2019-12-27 22:56:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:52,827 INFO L93 Difference]: Finished difference Result 422 states and 716 transitions. [2019-12-27 22:56:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 22:56:52,827 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 22:56:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:52,828 INFO L225 Difference]: With dead ends: 422 [2019-12-27 22:56:52,828 INFO L226 Difference]: Without dead ends: 390 [2019-12-27 22:56:52,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-12-27 22:56:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-27 22:56:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 328. [2019-12-27 22:56:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 22:56:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 576 transitions. [2019-12-27 22:56:52,832 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 576 transitions. Word has length 54 [2019-12-27 22:56:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:52,833 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 576 transitions. [2019-12-27 22:56:52,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:56:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 576 transitions. [2019-12-27 22:56:52,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:56:52,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:52,834 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] [2019-12-27 22:56:52,834 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:52,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:52,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1943788027, now seen corresponding path program 3 times [2019-12-27 22:56:52,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:52,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10282416] [2019-12-27 22:56:52,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:56:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:56:52,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:56:52,925 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:56:52,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~x~0_11 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2481~0.base_19| 4)) (= 0 |v_ULTIMATE.start_main_~#t2481~0.offset_16|) (= v_~y$r_buff0_thd1~0_24 0) (= 0 v_~y$r_buff1_thd0~0_45) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_108 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~y$w_buff0~0_29) (= (select .cse0 |v_ULTIMATE.start_main_~#t2481~0.base_19|) 0) (= v_~y~0_28 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2481~0.base_19|) (= v_~y$w_buff1_used~0_62 0) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2481~0.base_19| 1)) (= v_~y$r_buff0_thd0~0_81 0) (= 0 v_~weak$$choice0~0_6) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~y$r_buff1_thd1~0_17) (= 0 v_~weak$$choice2~0_31) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2481~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2481~0.base_19|) |v_ULTIMATE.start_main_~#t2481~0.offset_16| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2481~0.offset=|v_ULTIMATE.start_main_~#t2481~0.offset_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ULTIMATE.start_main_~#t2482~0.base=|v_ULTIMATE.start_main_~#t2482~0.base_19|, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_15|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t2482~0.offset=|v_ULTIMATE.start_main_~#t2482~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_13|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_28, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t2481~0.base=|v_ULTIMATE.start_main_~#t2481~0.base_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_62} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t2481~0.offset, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2482~0.base, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2482~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ULTIMATE.start_main_~#t2481~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:56:52,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L777-1-->L779: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2482~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2482~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2482~0.base_11|) |v_ULTIMATE.start_main_~#t2482~0.offset_10| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2482~0.base_11|) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2482~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2482~0.offset_10|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2482~0.base_11| 4) |v_#length_9|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2482~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2482~0.offset=|v_ULTIMATE.start_main_~#t2482~0.offset_10|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t2482~0.base=|v_ULTIMATE.start_main_~#t2482~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2482~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2482~0.base, #length] because there is no mapped edge [2019-12-27 22:56:52,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 2 v_~y$w_buff0~0_21) (= v_~y$w_buff1_used~0_52 v_~y$w_buff0_used~0_89) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff0~0_22 v_~y$w_buff1~0_18) (= 0 (mod v_~y$w_buff1_used~0_52 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= 1 v_~y$w_buff0_used~0_88)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_21, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_52} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:56:52,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In839008742 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In839008742 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out839008742|)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out839008742| ~y$w_buff0_used~0_In839008742)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In839008742, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In839008742} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out839008742|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In839008742, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In839008742} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:56:52,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In437520305 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In437520305 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out437520305| ~y$w_buff1~0_In437520305)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out437520305| ~y~0_In437520305)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In437520305, ~y$w_buff1~0=~y$w_buff1~0_In437520305, ~y~0=~y~0_In437520305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In437520305} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In437520305, ~y$w_buff1~0=~y$w_buff1~0_In437520305, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out437520305|, ~y~0=~y~0_In437520305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In437520305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:56:52,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 22:56:52,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In890526651 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In890526651 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out890526651|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In890526651 |P1Thread1of1ForFork1_#t~ite11_Out890526651|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In890526651, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In890526651} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In890526651, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In890526651, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out890526651|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:56:52,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In592063264 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In592063264 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In592063264 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In592063264 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In592063264 |P0Thread1of1ForFork0_#t~ite6_Out592063264|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out592063264|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In592063264, ~y$w_buff0_used~0=~y$w_buff0_used~0_In592063264, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In592063264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In592063264} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out592063264|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In592063264, ~y$w_buff0_used~0=~y$w_buff0_used~0_In592063264, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In592063264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In592063264} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:56:52,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In374645343 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In374645343 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out374645343 ~y$r_buff0_thd1~0_In374645343) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd1~0_Out374645343) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In374645343, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In374645343} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In374645343, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out374645343|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out374645343} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:56:52,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2080582026 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2080582026 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In2080582026 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2080582026 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out2080582026| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite12_Out2080582026| ~y$w_buff1_used~0_In2080582026)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2080582026, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2080582026, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2080582026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2080582026} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2080582026, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2080582026, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2080582026, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2080582026|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2080582026} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:56:52,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-485223309 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-485223309 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-485223309| ~y$r_buff0_thd2~0_In-485223309) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-485223309| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-485223309, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-485223309} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-485223309, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-485223309, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-485223309|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:56:52,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1893701926 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1893701926 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1893701926 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1893701926 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1893701926|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1893701926| ~y$r_buff1_thd2~0_In1893701926) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1893701926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1893701926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1893701926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1893701926} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1893701926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1893701926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1893701926, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1893701926|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1893701926} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:56:52,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:56:52,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In436245673 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In436245673 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In436245673 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In436245673 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out436245673| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out436245673| ~y$r_buff1_thd1~0_In436245673)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In436245673, ~y$w_buff0_used~0=~y$w_buff0_used~0_In436245673, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In436245673, ~y$w_buff1_used~0=~y$w_buff1_used~0_In436245673} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In436245673, ~y$w_buff0_used~0=~y$w_buff0_used~0_In436245673, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out436245673|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In436245673, ~y$w_buff1_used~0=~y$w_buff1_used~0_In436245673} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:56:52,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L738-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:56:52,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= (mod v_~y$w_buff0_used~0_75 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:56:52,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1805831278 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1805831278 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-1805831278| ~y$w_buff1~0_In-1805831278)) (and (= |ULTIMATE.start_main_#t~ite17_Out-1805831278| ~y~0_In-1805831278) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1805831278, ~y~0=~y~0_In-1805831278, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1805831278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1805831278} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1805831278|, ~y$w_buff1~0=~y$w_buff1~0_In-1805831278, ~y~0=~y~0_In-1805831278, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1805831278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1805831278} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 22:56:52,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 22:56:52,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In803458555 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In803458555 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In803458555 |ULTIMATE.start_main_#t~ite19_Out803458555|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out803458555|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In803458555, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In803458555} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In803458555, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out803458555|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In803458555} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 22:56:52,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-619834098 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-619834098 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-619834098 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-619834098 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-619834098| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-619834098| ~y$w_buff1_used~0_In-619834098) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-619834098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-619834098, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-619834098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-619834098} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-619834098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-619834098, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-619834098|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-619834098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-619834098} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 22:56:52,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1162361204 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1162361204 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1162361204| ~y$r_buff0_thd0~0_In1162361204)) (and (= |ULTIMATE.start_main_#t~ite21_Out1162361204| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1162361204, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1162361204} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1162361204, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1162361204, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1162361204|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 22:56:52,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1269963547 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1269963547 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1269963547 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1269963547 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1269963547|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-1269963547 |ULTIMATE.start_main_#t~ite22_Out-1269963547|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1269963547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1269963547, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1269963547, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1269963547} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1269963547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1269963547, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1269963547, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1269963547|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1269963547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 22:56:52,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L799-->L799-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In538659940 256)))) (or (and (= ~y$w_buff0_used~0_In538659940 |ULTIMATE.start_main_#t~ite34_Out538659940|) (= |ULTIMATE.start_main_#t~ite35_Out538659940| |ULTIMATE.start_main_#t~ite34_Out538659940|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In538659940 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In538659940 256)) (and (= 0 (mod ~y$w_buff1_used~0_In538659940 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In538659940 256)))))) (and (not .cse0) (= ~y$w_buff0_used~0_In538659940 |ULTIMATE.start_main_#t~ite35_Out538659940|) (= |ULTIMATE.start_main_#t~ite34_In538659940| |ULTIMATE.start_main_#t~ite34_Out538659940|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In538659940, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In538659940, ~weak$$choice2~0=~weak$$choice2~0_In538659940, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In538659940, ~y$w_buff1_used~0=~y$w_buff1_used~0_In538659940, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In538659940|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In538659940, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In538659940, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out538659940|, ~weak$$choice2~0=~weak$$choice2~0_In538659940, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In538659940, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out538659940|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In538659940} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 22:56:52,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 22:56:52,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_24 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_24, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:56:52,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:56:53,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:56:53 BasicIcfg [2019-12-27 22:56:53,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:56:53,043 INFO L168 Benchmark]: Toolchain (without parser) took 26687.87 ms. Allocated memory was 146.8 MB in the beginning and 956.3 MB in the end (delta: 809.5 MB). Free memory was 101.6 MB in the beginning and 546.2 MB in the end (delta: -444.5 MB). Peak memory consumption was 365.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:53,044 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 22:56:53,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.59 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 101.2 MB in the beginning and 157.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:53,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.81 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:53,047 INFO L168 Benchmark]: Boogie Preprocessor took 35.35 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:53,048 INFO L168 Benchmark]: RCFGBuilder took 779.02 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 108.6 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:53,048 INFO L168 Benchmark]: TraceAbstraction took 25090.70 ms. Allocated memory was 202.9 MB in the beginning and 956.3 MB in the end (delta: 753.4 MB). Free memory was 107.9 MB in the beginning and 546.2 MB in the end (delta: -438.3 MB). Peak memory consumption was 315.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:53,054 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 708.59 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 101.2 MB in the beginning and 157.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.81 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.35 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 779.02 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 108.6 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25090.70 ms. Allocated memory was 202.9 MB in the beginning and 956.3 MB in the end (delta: 753.4 MB). Free memory was 107.9 MB in the beginning and 546.2 MB in the end (delta: -438.3 MB). Peak memory consumption was 315.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 145 ProgramPointsBefore, 80 ProgramPointsAfterwards, 179 TransitionsBefore, 93 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 24 ChoiceCompositions, 3351 VarBasedMoverChecksPositive, 154 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48987 CheckedPairsTotal, 94 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2727 SDtfs, 3558 SDslu, 7613 SDs, 0 SdLazy, 6425 SolverSat, 282 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 55 SyntacticMatches, 23 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16589occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 16491 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 733 NumberOfCodeBlocks, 733 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 108679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...