/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-McrStrategy.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 15:51:08,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 15:51:08,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 15:51:08,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 15:51:08,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 15:51:08,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 15:51:08,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 15:51:08,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 15:51:08,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 15:51:08,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 15:51:08,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 15:51:08,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 15:51:08,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 15:51:08,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 15:51:08,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 15:51:08,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 15:51:08,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 15:51:08,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 15:51:08,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 15:51:08,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 15:51:08,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 15:51:08,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 15:51:08,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 15:51:08,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 15:51:08,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 15:51:08,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 15:51:08,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 15:51:08,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 15:51:08,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 15:51:08,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 15:51:08,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 15:51:08,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 15:51:08,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 15:51:08,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 15:51:08,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 15:51:08,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 15:51:08,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 15:51:08,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 15:51:08,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 15:51:08,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 15:51:08,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 15:51:08,172 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-McrStrategy.epf [2020-04-18 15:51:08,207 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 15:51:08,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 15:51:08,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 15:51:08,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 15:51:08,210 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 15:51:08,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 15:51:08,214 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 15:51:08,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 15:51:08,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 15:51:08,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 15:51:08,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 15:51:08,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 15:51:08,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 15:51:08,216 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 15:51:08,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 15:51:08,216 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 15:51:08,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 15:51:08,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 15:51:08,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 15:51:08,219 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 15:51:08,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 15:51:08,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 15:51:08,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 15:51:08,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 15:51:08,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 15:51:08,220 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 15:51:08,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 15:51:08,220 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-04-18 15:51:08,220 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 15:51:08,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 15:51:08,221 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 15:51:08,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 15:51:08,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 15:51:08,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 15:51:08,552 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 15:51:08,552 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 15:51:08,553 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-04-18 15:51:08,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34ad719d/4646ea7d0250450cbeb995119f4e86e1/FLAG63b10b608 [2020-04-18 15:51:09,230 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 15:51:09,230 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-04-18 15:51:09,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34ad719d/4646ea7d0250450cbeb995119f4e86e1/FLAG63b10b608 [2020-04-18 15:51:09,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34ad719d/4646ea7d0250450cbeb995119f4e86e1 [2020-04-18 15:51:09,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 15:51:09,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 15:51:09,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 15:51:09,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 15:51:09,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 15:51:09,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:51:09" (1/1) ... [2020-04-18 15:51:09,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8c7931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:09, skipping insertion in model container [2020-04-18 15:51:09,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:51:09" (1/1) ... [2020-04-18 15:51:09,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 15:51:09,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 15:51:10,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 15:51:10,396 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 15:51:10,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 15:51:10,897 INFO L208 MainTranslator]: Completed translation [2020-04-18 15:51:10,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10 WrapperNode [2020-04-18 15:51:10,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 15:51:10,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 15:51:10,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 15:51:10,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 15:51:10,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (1/1) ... [2020-04-18 15:51:10,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (1/1) ... [2020-04-18 15:51:10,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 15:51:10,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 15:51:10,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 15:51:10,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 15:51:10,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (1/1) ... [2020-04-18 15:51:10,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (1/1) ... [2020-04-18 15:51:11,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (1/1) ... [2020-04-18 15:51:11,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (1/1) ... [2020-04-18 15:51:11,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (1/1) ... [2020-04-18 15:51:11,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (1/1) ... [2020-04-18 15:51:11,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (1/1) ... [2020-04-18 15:51:11,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 15:51:11,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 15:51:11,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 15:51:11,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 15:51:11,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (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 [2020-04-18 15:51:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 15:51:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-18 15:51:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-04-18 15:51:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 15:51:11,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 15:51:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-04-18 15:51:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-04-18 15:51:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 15:51:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 15:51:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-18 15:51:11,110 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 15:51:11,832 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 15:51:11,832 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-04-18 15:51:11,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:51:11 BoogieIcfgContainer [2020-04-18 15:51:11,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 15:51:11,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 15:51:11,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 15:51:11,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 15:51:11,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 03:51:09" (1/3) ... [2020-04-18 15:51:11,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c71749c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:51:11, skipping insertion in model container [2020-04-18 15:51:11,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:51:10" (2/3) ... [2020-04-18 15:51:11,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c71749c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:51:11, skipping insertion in model container [2020-04-18 15:51:11,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:51:11" (3/3) ... [2020-04-18 15:51:11,849 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-04-18 15:51:11,859 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 15:51:11,860 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 15:51:11,868 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-04-18 15:51:11,869 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 15:51:11,904 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,905 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,905 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,905 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,906 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,906 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,906 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,906 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,906 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,907 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,907 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,907 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,907 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,908 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,908 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,908 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,908 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,909 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,909 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,909 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,909 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,910 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,910 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,910 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,910 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,910 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,911 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,911 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,911 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,911 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,912 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,912 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,912 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,912 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,912 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,913 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,913 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,913 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,913 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,914 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,914 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,914 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,914 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,915 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,915 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,915 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,919 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,919 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,920 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,920 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,920 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,920 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,921 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,921 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,921 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,937 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,938 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,938 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,938 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,938 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,938 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,939 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,939 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,939 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:51:11,961 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-04-18 15:51:11,978 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:51:11,978 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:51:11,978 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:51:11,978 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:51:11,978 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:51:11,979 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:51:11,979 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:51:11,979 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:51:11,998 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions, 318 flow [2020-04-18 15:51:12,000 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-04-18 15:51:12,071 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-04-18 15:51:12,071 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-18 15:51:12,076 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-04-18 15:51:12,081 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-04-18 15:51:12,121 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-04-18 15:51:12,121 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-18 15:51:12,122 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-04-18 15:51:12,125 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1980 [2020-04-18 15:51:12,126 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:51:13,417 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:13,442 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:13,447 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:13,473 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:13,474 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:13,475 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-04-18 15:51:15,684 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:15,707 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:15,711 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:15,729 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:15,731 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:15,731 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-04-18 15:51:16,501 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-04-18 15:51:16,763 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2020-04-18 15:51:17,083 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:17,113 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:17,118 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:17,150 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:17,151 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:17,152 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-04-18 15:51:18,104 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-04-18 15:51:18,218 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-04-18 15:51:18,582 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-04-18 15:51:19,149 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-04-18 15:51:19,355 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-04-18 15:51:20,025 WARN L192 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-04-18 15:51:20,277 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-04-18 15:51:21,402 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-04-18 15:51:21,424 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:21,826 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-04-18 15:51:21,828 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:21,838 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:22,234 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-04-18 15:51:22,235 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:22,236 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:22,236 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-04-18 15:51:22,625 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-04-18 15:51:22,636 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2994 [2020-04-18 15:51:22,636 INFO L214 etLargeBlockEncoding]: Total number of compositions: 159 [2020-04-18 15:51:22,640 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-04-18 15:51:22,659 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-04-18 15:51:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-04-18 15:51:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 15:51:22,667 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:22,668 INFO L425 BasicCegarLoop]: trace histogram [1] [2020-04-18 15:51:22,668 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:51:22,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:22,674 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-04-18 15:51:22,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:22,681 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [930168892] [2020-04-18 15:51:22,696 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:22,704 INFO L259 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-04-18 15:51:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2 states. [2020-04-18 15:51:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 15:51:22,705 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 2 times [2020-04-18 15:51:22,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:22,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232219682] [2020-04-18 15:51:22,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:22,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232219682] [2020-04-18 15:51:22,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:22,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-04-18 15:51:22,974 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:22,974 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:22,975 INFO L259 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-04-18 15:51:22,975 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:22,977 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:51:22,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 15:51:22,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 15:51:22,981 INFO L87 Difference]: Start difference. First operand 2 states. Second operand 2 states. [2020-04-18 15:51:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:22,986 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2020-04-18 15:51:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2 states and 1 transitions. [2020-04-18 15:51:22,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:51:22,987 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [930168892] [2020-04-18 15:51:22,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:51:22,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [0] total 0 [2020-04-18 15:51:22,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [930168892] [2020-04-18 15:51:22,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-18 15:51:22,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:51:22,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 15:51:22,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 15:51:22,994 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-04-18 15:51:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:23,008 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-04-18 15:51:23,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-18 15:51:23,009 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-04-18 15:51:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:51:23,021 INFO L225 Difference]: With dead ends: 190 [2020-04-18 15:51:23,021 INFO L226 Difference]: Without dead ends: 172 [2020-04-18 15:51:23,022 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 15:51:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-04-18 15:51:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-04-18 15:51:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-04-18 15:51:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-04-18 15:51:23,079 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-04-18 15:51:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:51:23,079 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-04-18 15:51:23,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-18 15:51:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-04-18 15:51:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-04-18 15:51:23,080 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:23,080 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-04-18 15:51:23,080 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:51:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:23,081 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2020-04-18 15:51:23,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:23,101 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1088151126] [2020-04-18 15:51:23,101 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:23,102 INFO L259 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-04-18 15:51:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-04-18 15:51:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-04-18 15:51:23,102 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:23,103 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 2 times [2020-04-18 15:51:23,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:23,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166303407] [2020-04-18 15:51:23,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:23,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166303407] [2020-04-18 15:51:23,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:23,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:51:23,321 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:23,322 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:23,323 INFO L259 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-04-18 15:51:23,324 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:23,331 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:51:23,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:51:23,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:23,332 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2020-04-18 15:51:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:23,341 INFO L93 Difference]: Finished difference Result 5 states and 4 transitions. [2020-04-18 15:51:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 4 transitions. [2020-04-18 15:51:23,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:51:23,341 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1088151126] [2020-04-18 15:51:23,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:51:23,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 15:51:23,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1088151126] [2020-04-18 15:51:23,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:51:23,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:51:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:51:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:23,344 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2020-04-18 15:51:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:23,467 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2020-04-18 15:51:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:51:23,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-04-18 15:51:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:51:23,471 INFO L225 Difference]: With dead ends: 230 [2020-04-18 15:51:23,472 INFO L226 Difference]: Without dead ends: 230 [2020-04-18 15:51:23,473 INFO L678 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 [2020-04-18 15:51:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-04-18 15:51:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-04-18 15:51:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-04-18 15:51:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-04-18 15:51:23,516 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-04-18 15:51:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:51:23,516 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-04-18 15:51:23,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:51:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-04-18 15:51:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 15:51:23,517 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:23,517 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 15:51:23,517 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:51:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 1 times [2020-04-18 15:51:23,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:23,520 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [290159734] [2020-04-18 15:51:23,520 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:23,520 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 15:51:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 15:51:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 15:51:23,521 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:23,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:23,521 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 2 times [2020-04-18 15:51:23,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:23,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143399546] [2020-04-18 15:51:23,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:23,642 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143399546] [2020-04-18 15:51:23,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:23,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:51:23,643 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:23,644 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:23,644 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 15:51:23,645 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:23,654 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:51:23,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:51:23,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:23,655 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 15:51:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:23,665 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 15:51:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 15:51:23,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:51:23,666 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [290159734] [2020-04-18 15:51:23,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:51:23,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 15:51:23,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [290159734] [2020-04-18 15:51:23,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:51:23,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:51:23,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:51:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:23,668 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-04-18 15:51:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:23,783 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-04-18 15:51:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:51:23,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 15:51:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:51:23,786 INFO L225 Difference]: With dead ends: 243 [2020-04-18 15:51:23,787 INFO L226 Difference]: Without dead ends: 236 [2020-04-18 15:51:23,787 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-04-18 15:51:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-04-18 15:51:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-04-18 15:51:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-04-18 15:51:23,819 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-04-18 15:51:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:51:23,819 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-04-18 15:51:23,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:51:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-04-18 15:51:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 15:51:23,821 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:23,821 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:51:23,822 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:51:23,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:23,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1038453307, now seen corresponding path program 1 times [2020-04-18 15:51:23,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:23,823 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [913219238] [2020-04-18 15:51:23,823 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:23,823 INFO L259 McrAutomatonBuilder]: Finished intersection with 16 states and 21 transitions. [2020-04-18 15:51:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-04-18 15:51:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 15:51:23,824 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:23,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1918524495, now seen corresponding path program 2 times [2020-04-18 15:51:23,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:23,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179844456] [2020-04-18 15:51:23,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:23,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179844456] [2020-04-18 15:51:23,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:23,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:51:23,902 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:23,903 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:23,905 INFO L259 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-04-18 15:51:23,905 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:23,912 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:51:23,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:51:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:23,913 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2020-04-18 15:51:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:23,923 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-04-18 15:51:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-04-18 15:51:23,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:51:23,924 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [913219238] [2020-04-18 15:51:23,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:51:23,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:51:23,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [913219238] [2020-04-18 15:51:23,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:51:23,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:51:23,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:51:23,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:23,926 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-04-18 15:51:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:23,945 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-04-18 15:51:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:51:23,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-04-18 15:51:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:51:23,947 INFO L225 Difference]: With dead ends: 86 [2020-04-18 15:51:23,947 INFO L226 Difference]: Without dead ends: 86 [2020-04-18 15:51:23,947 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-04-18 15:51:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-04-18 15:51:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-04-18 15:51:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-04-18 15:51:23,952 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-04-18 15:51:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:51:23,952 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-04-18 15:51:23,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:51:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-04-18 15:51:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:23,953 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:23,954 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:51:23,954 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:51:23,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:23,954 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 1 times [2020-04-18 15:51:23,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:23,955 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1484010966] [2020-04-18 15:51:23,955 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:23,957 INFO L259 McrAutomatonBuilder]: Finished intersection with 73 states and 144 transitions. [2020-04-18 15:51:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-04-18 15:51:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:23,960 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 2 times [2020-04-18 15:51:23,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:23,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003158018] [2020-04-18 15:51:23,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:24,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003158018] [2020-04-18 15:51:24,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:24,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 15:51:24,407 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:24,412 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:24,421 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 15:51:24,422 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:24,636 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 15:51:24,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 15:51:24,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-04-18 15:51:24,637 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 9 states. [2020-04-18 15:51:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:25,369 INFO L93 Difference]: Finished difference Result 115 states and 211 transitions. [2020-04-18 15:51:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 211 transitions. [2020-04-18 15:51:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:25,370 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:51:25,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555757, now seen corresponding path program 3 times [2020-04-18 15:51:25,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:25,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272237992] [2020-04-18 15:51:25,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:25,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272237992] [2020-04-18 15:51:25,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:25,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 15:51:25,763 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:25,766 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:25,771 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 15:51:25,771 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:25,880 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 15:51:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 15:51:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-04-18 15:51:25,881 INFO L87 Difference]: Start difference. First operand 115 states and 211 transitions. Second operand 7 states. [2020-04-18 15:51:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:26,268 INFO L93 Difference]: Finished difference Result 139 states and 242 transitions. [2020-04-18 15:51:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 242 transitions. [2020-04-18 15:51:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:26,270 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:51:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:26,270 INFO L82 PathProgramCache]: Analyzing trace with hash 311067317, now seen corresponding path program 4 times [2020-04-18 15:51:26,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:26,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464684134] [2020-04-18 15:51:26,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:26,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464684134] [2020-04-18 15:51:26,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:26,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 15:51:26,885 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:26,889 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:26,894 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:51:26,895 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:27,109 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:51:27,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 15:51:27,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2020-04-18 15:51:27,110 INFO L87 Difference]: Start difference. First operand 139 states and 242 transitions. Second operand 9 states. [2020-04-18 15:51:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:27,967 INFO L93 Difference]: Finished difference Result 209 states and 332 transitions. [2020-04-18 15:51:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 332 transitions. [2020-04-18 15:51:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:27,968 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:51:27,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash -11903171, now seen corresponding path program 5 times [2020-04-18 15:51:27,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:27,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746134102] [2020-04-18 15:51:27,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:28,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746134102] [2020-04-18 15:51:28,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:28,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 15:51:28,489 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:28,493 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:28,499 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 26 transitions. [2020-04-18 15:51:28,499 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:28,612 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:51:28,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 15:51:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2020-04-18 15:51:28,613 INFO L87 Difference]: Start difference. First operand 209 states and 332 transitions. Second operand 9 states. [2020-04-18 15:51:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:29,328 INFO L93 Difference]: Finished difference Result 260 states and 424 transitions. [2020-04-18 15:51:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 424 transitions. [2020-04-18 15:51:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:29,329 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 15:51:29,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:29,330 INFO L82 PathProgramCache]: Analyzing trace with hash 182574325, now seen corresponding path program 6 times [2020-04-18 15:51:29,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:29,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884687518] [2020-04-18 15:51:29,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:29,883 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884687518] [2020-04-18 15:51:29,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:29,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 15:51:29,883 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:29,885 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:29,889 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:51:29,890 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:29,890 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:51:29,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 15:51:29,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2020-04-18 15:51:29,891 INFO L87 Difference]: Start difference. First operand 260 states and 424 transitions. Second operand 9 states. [2020-04-18 15:51:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:30,563 INFO L93 Difference]: Finished difference Result 293 states and 468 transitions. [2020-04-18 15:51:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 468 transitions. [2020-04-18 15:51:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:30,564 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 15:51:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:30,565 INFO L82 PathProgramCache]: Analyzing trace with hash -109048313, now seen corresponding path program 7 times [2020-04-18 15:51:30,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:30,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319845460] [2020-04-18 15:51:30,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:31,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319845460] [2020-04-18 15:51:31,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:31,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 15:51:31,095 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:31,098 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:31,102 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:51:31,103 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:31,281 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:51:31,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 15:51:31,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2020-04-18 15:51:31,283 INFO L87 Difference]: Start difference. First operand 293 states and 468 transitions. Second operand 9 states. [2020-04-18 15:51:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:32,315 INFO L93 Difference]: Finished difference Result 299 states and 474 transitions. [2020-04-18 15:51:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 474 transitions. [2020-04-18 15:51:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:32,316 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 15:51:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:32,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1649493417, now seen corresponding path program 8 times [2020-04-18 15:51:32,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:32,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308584817] [2020-04-18 15:51:32,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:32,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308584817] [2020-04-18 15:51:32,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:32,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 15:51:32,818 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:32,821 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:32,827 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 30 transitions. [2020-04-18 15:51:32,827 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:33,022 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 15:51:33,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 15:51:33,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2020-04-18 15:51:33,024 INFO L87 Difference]: Start difference. First operand 299 states and 474 transitions. Second operand 9 states. [2020-04-18 15:51:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:33,737 INFO L93 Difference]: Finished difference Result 300 states and 474 transitions. [2020-04-18 15:51:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 474 transitions. [2020-04-18 15:51:33,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:51:33,738 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1484010966] [2020-04-18 15:51:33,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:51:33,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 15:51:33,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1484010966] [2020-04-18 15:51:33,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-04-18 15:51:33,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:51:33,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-04-18 15:51:33,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2020-04-18 15:51:33,741 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 23 states. [2020-04-18 15:51:34,588 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-04-18 15:51:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:34,809 INFO L93 Difference]: Finished difference Result 85 states and 166 transitions. [2020-04-18 15:51:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-04-18 15:51:34,809 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 18 [2020-04-18 15:51:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:51:34,810 INFO L225 Difference]: With dead ends: 85 [2020-04-18 15:51:34,810 INFO L226 Difference]: Without dead ends: 85 [2020-04-18 15:51:34,811 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 123 SyntacticMatches, 13 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=372, Invalid=1350, Unknown=0, NotChecked=0, Total=1722 [2020-04-18 15:51:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-04-18 15:51:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-04-18 15:51:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-04-18 15:51:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 166 transitions. [2020-04-18 15:51:34,815 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 166 transitions. Word has length 18 [2020-04-18 15:51:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:51:34,815 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 166 transitions. [2020-04-18 15:51:34,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-04-18 15:51:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 166 transitions. [2020-04-18 15:51:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:34,816 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:34,816 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:51:34,816 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:51:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:34,816 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 1 times [2020-04-18 15:51:34,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:34,817 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1619953651] [2020-04-18 15:51:34,817 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:34,818 INFO L259 McrAutomatonBuilder]: Finished intersection with 73 states and 144 transitions. [2020-04-18 15:51:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-04-18 15:51:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:34,820 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 2 times [2020-04-18 15:51:34,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:34,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478304069] [2020-04-18 15:51:34,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:35,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478304069] [2020-04-18 15:51:35,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:35,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 15:51:35,716 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:35,718 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:35,723 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 15:51:35,723 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:36,182 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:51:36,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 15:51:36,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-18 15:51:36,183 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 15 states. [2020-04-18 15:51:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:38,050 INFO L93 Difference]: Finished difference Result 114 states and 200 transitions. [2020-04-18 15:51:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 200 transitions. [2020-04-18 15:51:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:38,051 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:51:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555779, now seen corresponding path program 3 times [2020-04-18 15:51:38,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:38,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042965759] [2020-04-18 15:51:38,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:38,398 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2020-04-18 15:51:38,524 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2020-04-18 15:51:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:39,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042965759] [2020-04-18 15:51:39,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:39,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 15:51:39,011 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:39,013 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:39,018 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 15:51:39,018 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:39,168 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:51:39,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 15:51:39,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2020-04-18 15:51:39,169 INFO L87 Difference]: Start difference. First operand 114 states and 200 transitions. Second operand 12 states. [2020-04-18 15:51:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:40,534 INFO L93 Difference]: Finished difference Result 149 states and 249 transitions. [2020-04-18 15:51:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 249 transitions. [2020-04-18 15:51:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:40,535 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:51:40,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1342972915, now seen corresponding path program 4 times [2020-04-18 15:51:40,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:40,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118460090] [2020-04-18 15:51:40,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:41,396 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118460090] [2020-04-18 15:51:41,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:41,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 15:51:41,397 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:41,399 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:41,403 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 15:51:41,403 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:41,423 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:51:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 15:51:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2020-04-18 15:51:41,424 INFO L87 Difference]: Start difference. First operand 149 states and 249 transitions. Second operand 13 states. [2020-04-18 15:51:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:42,818 INFO L93 Difference]: Finished difference Result 163 states and 264 transitions. [2020-04-18 15:51:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 264 transitions. [2020-04-18 15:51:42,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:42,820 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:51:42,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:42,820 INFO L82 PathProgramCache]: Analyzing trace with hash -285831053, now seen corresponding path program 5 times [2020-04-18 15:51:42,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:42,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345762944] [2020-04-18 15:51:42,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:43,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345762944] [2020-04-18 15:51:43,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:43,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 15:51:43,621 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:43,624 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:43,658 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 15:51:43,659 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:43,947 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:51:43,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 15:51:43,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2020-04-18 15:51:43,948 INFO L87 Difference]: Start difference. First operand 163 states and 264 transitions. Second operand 14 states. [2020-04-18 15:51:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:45,333 INFO L93 Difference]: Finished difference Result 214 states and 348 transitions. [2020-04-18 15:51:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 348 transitions. [2020-04-18 15:51:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:51:45,335 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 15:51:45,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:45,335 INFO L82 PathProgramCache]: Analyzing trace with hash 311067339, now seen corresponding path program 6 times [2020-04-18 15:51:45,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:45,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136555167] [2020-04-18 15:51:45,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:51:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:51:45,417 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 15:51:45,417 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 15:51:45,417 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 15:51:45,418 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:51:45,418 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:51:45,419 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:51:45,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1706-->L1708-2: Formula: (let ((.cse1 (select |#memory_int_In157904177| ULTIMATE.start_my_drv_probe_~data.base_In157904177))) (and (let ((.cse0 (= 0 |ULTIMATE.start_my_drv_probe_#t~mem32_Out157904177|))) (or (and (= 1 |ULTIMATE.start_ldv_assert_#in~expression_Out157904177|) .cse0) (and (not .cse0) (= 0 |ULTIMATE.start_ldv_assert_#in~expression_Out157904177|)))) (= (select .cse1 (+ ULTIMATE.start_my_drv_probe_~data.offset_In157904177 28)) |ULTIMATE.start_my_drv_probe_#t~mem32_Out157904177|) (= (select .cse1 (+ ULTIMATE.start_my_drv_probe_~data.offset_In157904177 24)) 0) (= 1 ULTIMATE.start_ldv_assert_~expression_Out157904177))) InVars {ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In157904177, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In157904177, #memory_int=|#memory_int_In157904177|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out157904177|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out157904177|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In157904177, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In157904177, #memory_int=|#memory_int_In157904177|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out157904177|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out157904177} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem31, ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-04-18 15:51:45,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L1708-2-->L1709-1: Formula: (and (= ULTIMATE.start_ldv_assert_~expression_Out-49304953 |ULTIMATE.start_ldv_assert_#in~expression_In-49304953|) (not (= 0 ULTIMATE.start_ldv_assert_~expression_Out-49304953)) (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In-49304953| 2147483647) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In-49304953| 2147483648))) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In-49304953|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-49304953|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-49304953|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In-49304953|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-49304953|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-49304953} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-04-18 15:51:45,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] L1721-3-->L1741-2: Formula: (let ((.cse1 (select |#memory_int_In1542691335| |ULTIMATE.start_main_~#data~1.base_In1542691335|))) (and (let ((.cse0 (= |ULTIMATE.start_main_#t~mem43_Out1542691335| 2))) (or (and (= 1 |ULTIMATE.start_ldv_assert_#in~expression_Out1542691335|) .cse0) (and (= 0 |ULTIMATE.start_ldv_assert_#in~expression_Out1542691335|) (not .cse0)))) (= 1 (select .cse1 (+ |ULTIMATE.start_main_~#data~1.offset_In1542691335| 24))) (= ULTIMATE.start_ldv_assert_~expression_Out1542691335 1) (= |ULTIMATE.start_main_#t~mem43_Out1542691335| (select .cse1 (+ |ULTIMATE.start_main_~#data~1.offset_In1542691335| 28))))) InVars {#memory_int=|#memory_int_In1542691335|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1542691335|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1542691335|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out1542691335|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out1542691335|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out1542691335|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out1542691335|, #memory_int=|#memory_int_In1542691335|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1542691335|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out1542691335|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1542691335|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out1542691335} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem43, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.base, ULTIMATE.start_main_#t~mem42, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-04-18 15:51:45,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 03:51:45 BasicIcfg [2020-04-18 15:51:45,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 15:51:45,475 INFO L168 Benchmark]: Toolchain (without parser) took 36024.12 ms. Allocated memory was 144.7 MB in the beginning and 415.2 MB in the end (delta: 270.5 MB). Free memory was 98.9 MB in the beginning and 213.7 MB in the end (delta: -114.8 MB). Peak memory consumption was 155.8 MB. Max. memory is 7.1 GB. [2020-04-18 15:51:45,475 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-04-18 15:51:45,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1427.04 ms. Allocated memory was 144.7 MB in the beginning and 234.4 MB in the end (delta: 89.7 MB). Free memory was 97.2 MB in the beginning and 169.1 MB in the end (delta: -71.9 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. [2020-04-18 15:51:45,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.53 ms. Allocated memory is still 234.4 MB. Free memory was 169.1 MB in the beginning and 165.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-04-18 15:51:45,477 INFO L168 Benchmark]: Boogie Preprocessor took 55.16 ms. Allocated memory is still 234.4 MB. Free memory was 165.6 MB in the beginning and 163.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-04-18 15:51:45,478 INFO L168 Benchmark]: RCFGBuilder took 799.50 ms. Allocated memory is still 234.4 MB. Free memory was 163.8 MB in the beginning and 116.8 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2020-04-18 15:51:45,479 INFO L168 Benchmark]: TraceAbstraction took 33634.98 ms. Allocated memory was 234.4 MB in the beginning and 415.2 MB in the end (delta: 180.9 MB). Free memory was 115.0 MB in the beginning and 213.7 MB in the end (delta: -98.7 MB). Peak memory consumption was 82.2 MB. Max. memory is 7.1 GB. [2020-04-18 15:51:45,482 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1427.04 ms. Allocated memory was 144.7 MB in the beginning and 234.4 MB in the end (delta: 89.7 MB). Free memory was 97.2 MB in the beginning and 169.1 MB in the end (delta: -71.9 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.53 ms. Allocated memory is still 234.4 MB. Free memory was 169.1 MB in the beginning and 165.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.16 ms. Allocated memory is still 234.4 MB. Free memory was 165.6 MB in the beginning and 163.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 799.50 ms. Allocated memory is still 234.4 MB. Free memory was 163.8 MB in the beginning and 116.8 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33634.98 ms. Allocated memory was 234.4 MB in the beginning and 415.2 MB in the end (delta: 180.9 MB). Free memory was 115.0 MB in the beginning and 213.7 MB in the end (delta: -98.7 MB). Peak memory consumption was 82.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 10.6s, 144 ProgramPointsBefore, 36 ProgramPointsAfterwards, 148 TransitionsBefore, 34 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 996 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2994 CheckedPairsTotal, 159 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; [L1695] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] 1 data->shared.b VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.4s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 121 SDtfs, 96 SDslu, 125 SDs, 0 SdLazy, 424 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 135 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 45 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...