/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-507b705 [2020-09-12 00:20:03,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-12 00:20:03,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-12 00:20:03,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-12 00:20:03,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-12 00:20:03,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-12 00:20:03,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-12 00:20:03,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-12 00:20:03,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-12 00:20:03,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-12 00:20:03,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-12 00:20:03,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-12 00:20:03,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-12 00:20:03,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-12 00:20:03,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-12 00:20:03,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-12 00:20:03,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-12 00:20:03,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-12 00:20:03,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-12 00:20:03,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-12 00:20:03,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-12 00:20:03,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-12 00:20:03,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-12 00:20:03,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-12 00:20:03,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-12 00:20:03,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-12 00:20:03,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-12 00:20:03,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-12 00:20:03,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-12 00:20:03,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-12 00:20:03,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-12 00:20:03,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-12 00:20:03,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-12 00:20:03,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-12 00:20:03,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-12 00:20:03,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-12 00:20:03,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-12 00:20:03,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-12 00:20:03,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-12 00:20:03,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-12 00:20:03,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-12 00:20:03,167 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-09-12 00:20:03,194 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-12 00:20:03,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-12 00:20:03,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-12 00:20:03,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-12 00:20:03,196 INFO L138 SettingsManager]: * Use SBE=true [2020-09-12 00:20:03,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-12 00:20:03,196 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-12 00:20:03,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-12 00:20:03,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-12 00:20:03,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-12 00:20:03,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-12 00:20:03,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-12 00:20:03,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-12 00:20:03,198 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-12 00:20:03,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-12 00:20:03,198 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-12 00:20:03,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-12 00:20:03,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-12 00:20:03,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-12 00:20:03,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-12 00:20:03,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-12 00:20:03,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-12 00:20:03,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-12 00:20:03,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-09-12 00:20:03,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-12 00:20:03,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-12 00:20:03,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-12 00:20:03,201 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-09-12 00:20:03,201 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-09-12 00:20:03,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-12 00:20:03,201 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-09-12 00:20:03,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-12 00:20:03,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-12 00:20:03,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-12 00:20:03,696 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-12 00:20:03,696 INFO L275 PluginConnector]: CDTParser initialized [2020-09-12 00:20:03,699 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-09-12 00:20:03,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5e57b70bb/68fba85c801a47239ac8c86ead3cb8d9/FLAG41451dddd [2020-09-12 00:20:04,553 INFO L306 CDTParser]: Found 1 translation units. [2020-09-12 00:20:04,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-09-12 00:20:04,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5e57b70bb/68fba85c801a47239ac8c86ead3cb8d9/FLAG41451dddd [2020-09-12 00:20:04,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5e57b70bb/68fba85c801a47239ac8c86ead3cb8d9 [2020-09-12 00:20:04,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-12 00:20:04,656 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-12 00:20:04,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-12 00:20:04,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-12 00:20:04,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-12 00:20:04,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 12:20:04" (1/1) ... [2020-09-12 00:20:04,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14262c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:04, skipping insertion in model container [2020-09-12 00:20:04,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 12:20:04" (1/1) ... [2020-09-12 00:20:04,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-12 00:20:04,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-12 00:20:05,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-12 00:20:05,630 INFO L203 MainTranslator]: Completed pre-run [2020-09-12 00:20:05,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-12 00:20:06,197 INFO L208 MainTranslator]: Completed translation [2020-09-12 00:20:06,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06 WrapperNode [2020-09-12 00:20:06,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-12 00:20:06,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-12 00:20:06,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-12 00:20:06,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-12 00:20:06,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (1/1) ... [2020-09-12 00:20:06,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (1/1) ... [2020-09-12 00:20:06,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-12 00:20:06,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-12 00:20:06,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-12 00:20:06,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-12 00:20:06,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (1/1) ... [2020-09-12 00:20:06,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (1/1) ... [2020-09-12 00:20:06,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (1/1) ... [2020-09-12 00:20:06,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (1/1) ... [2020-09-12 00:20:06,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (1/1) ... [2020-09-12 00:20:06,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (1/1) ... [2020-09-12 00:20:06,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (1/1) ... [2020-09-12 00:20:06,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-12 00:20:06,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-12 00:20:06,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-12 00:20:06,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-12 00:20:06,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-12 00:20:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-12 00:20:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-12 00:20:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-12 00:20:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-12 00:20:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-12 00:20:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-09-12 00:20:06,520 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-09-12 00:20:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-12 00:20:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-12 00:20:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-12 00:20:06,523 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-12 00:20:07,245 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-12 00:20:07,245 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-12 00:20:07,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 12:20:07 BoogieIcfgContainer [2020-09-12 00:20:07,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-12 00:20:07,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-12 00:20:07,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-12 00:20:07,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-12 00:20:07,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 12:20:04" (1/3) ... [2020-09-12 00:20:07,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2497da74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 12:20:07, skipping insertion in model container [2020-09-12 00:20:07,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 12:20:06" (2/3) ... [2020-09-12 00:20:07,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2497da74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 12:20:07, skipping insertion in model container [2020-09-12 00:20:07,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 12:20:07" (3/3) ... [2020-09-12 00:20:07,269 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-09-12 00:20:07,281 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-12 00:20:07,282 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-12 00:20:07,296 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-09-12 00:20:07,298 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-12 00:20:07,332 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,332 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,333 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,333 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,333 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,334 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,334 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,334 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,334 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,335 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,335 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,335 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,335 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,335 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,336 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,336 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,336 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,337 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,337 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,337 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,337 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,338 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,338 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,338 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,338 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,339 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,339 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,339 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,339 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,340 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,340 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,340 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,340 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,341 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,341 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,341 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,341 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,342 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,342 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,342 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,343 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,343 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,343 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,343 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,344 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,344 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,348 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,349 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,349 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,349 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,350 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,350 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,350 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,351 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,351 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,360 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,360 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,361 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,361 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,361 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,361 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,362 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,362 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,362 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-12 00:20:07,398 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-09-12 00:20:07,429 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-12 00:20:07,429 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-12 00:20:07,430 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-12 00:20:07,430 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-09-12 00:20:07,430 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-12 00:20:07,430 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-12 00:20:07,430 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-12 00:20:07,431 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-12 00:20:07,453 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions, 318 flow [2020-09-12 00:20:07,455 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-09-12 00:20:07,538 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-09-12 00:20:07,539 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-12 00:20:07,546 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-09-12 00:20:07,551 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-09-12 00:20:07,596 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-09-12 00:20:07,597 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-12 00:20:07,598 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-09-12 00:20:07,601 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1980 [2020-09-12 00:20:07,603 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-12 00:20:08,527 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:08,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:08,553 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:08,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:08,569 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:08,569 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-09-12 00:20:10,069 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:10,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:10,106 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:10,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:10,122 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:10,123 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-09-12 00:20:10,722 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-09-12 00:20:11,149 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:11,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:11,182 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:11,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:11,204 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:11,205 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-09-12 00:20:12,027 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-09-12 00:20:12,432 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-09-12 00:20:12,998 WARN L193 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-09-12 00:20:13,239 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-09-12 00:20:13,907 WARN L193 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-09-12 00:20:14,165 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-12 00:20:15,386 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-09-12 00:20:15,431 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:15,956 WARN L193 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-09-12 00:20:15,957 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:15,968 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-12 00:20:16,432 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-12 00:20:16,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:16,434 INFO L545 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-09-12 00:20:16,435 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-09-12 00:20:16,912 WARN L193 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-12 00:20:16,923 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2994 [2020-09-12 00:20:16,923 INFO L214 etLargeBlockEncoding]: Total number of compositions: 159 [2020-09-12 00:20:16,928 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-09-12 00:20:16,950 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-09-12 00:20:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-09-12 00:20:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-09-12 00:20:16,961 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:16,962 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-09-12 00:20:16,962 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-09-12 00:20:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:16,970 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-09-12 00:20:16,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:16,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339737608] [2020-09-12 00:20:16,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:17,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339737608] [2020-09-12 00:20:17,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:17,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-09-12 00:20:17,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [447462356] [2020-09-12 00:20:17,337 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:17,340 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:17,352 INFO L274 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-09-12 00:20:17,352 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:17,354 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:17,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-12 00:20:17,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-12 00:20:17,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-12 00:20:17,378 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-09-12 00:20:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:17,417 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-09-12 00:20:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-12 00:20:17,420 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-09-12 00:20:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:17,434 INFO L225 Difference]: With dead ends: 190 [2020-09-12 00:20:17,434 INFO L226 Difference]: Without dead ends: 172 [2020-09-12 00:20:17,436 INFO L675 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-09-12 00:20:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-09-12 00:20:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-09-12 00:20:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-09-12 00:20:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-09-12 00:20:17,500 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-09-12 00:20:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:17,501 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-09-12 00:20:17,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-12 00:20:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-09-12 00:20:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-09-12 00:20:17,502 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:17,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-09-12 00:20:17,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-12 00:20:17,503 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-09-12 00:20:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:17,503 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2020-09-12 00:20:17,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:17,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656800344] [2020-09-12 00:20:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:17,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656800344] [2020-09-12 00:20:17,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:17,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-12 00:20:17,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1116034616] [2020-09-12 00:20:17,782 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:17,783 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:17,784 INFO L274 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-09-12 00:20:17,784 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:17,785 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:17,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-12 00:20:17,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:17,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-12 00:20:17,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:17,788 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2020-09-12 00:20:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:17,915 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2020-09-12 00:20:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-12 00:20:17,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-09-12 00:20:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:17,922 INFO L225 Difference]: With dead ends: 230 [2020-09-12 00:20:17,922 INFO L226 Difference]: Without dead ends: 230 [2020-09-12 00:20:17,923 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-09-12 00:20:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-09-12 00:20:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-09-12 00:20:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-09-12 00:20:17,946 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-09-12 00:20:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:17,946 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-09-12 00:20:17,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-12 00:20:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-09-12 00:20:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-09-12 00:20:17,947 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:17,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-09-12 00:20:17,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-12 00:20:17,947 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-09-12 00:20:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 1 times [2020-09-12 00:20:17,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:17,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938746792] [2020-09-12 00:20:17,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:18,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938746792] [2020-09-12 00:20:18,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:18,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-12 00:20:18,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1308549737] [2020-09-12 00:20:18,077 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:18,078 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:18,079 INFO L274 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-09-12 00:20:18,079 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:18,080 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:18,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-12 00:20:18,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:18,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-12 00:20:18,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:18,081 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-09-12 00:20:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:18,160 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-09-12 00:20:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-12 00:20:18,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-09-12 00:20:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:18,163 INFO L225 Difference]: With dead ends: 243 [2020-09-12 00:20:18,163 INFO L226 Difference]: Without dead ends: 236 [2020-09-12 00:20:18,163 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-09-12 00:20:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-09-12 00:20:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-09-12 00:20:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-09-12 00:20:18,182 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-09-12 00:20:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:18,182 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-09-12 00:20:18,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-12 00:20:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-09-12 00:20:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-12 00:20:18,184 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:18,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:18,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-12 00:20:18,184 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-09-12 00:20:18,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:18,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1038453307, now seen corresponding path program 1 times [2020-09-12 00:20:18,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:18,185 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286285023] [2020-09-12 00:20:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:18,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286285023] [2020-09-12 00:20:18,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:18,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-12 00:20:18,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [3703235] [2020-09-12 00:20:18,303 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:18,304 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:18,307 INFO L274 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-09-12 00:20:18,307 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:18,308 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:18,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-12 00:20:18,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:18,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-12 00:20:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-12 00:20:18,309 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-09-12 00:20:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:18,330 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-09-12 00:20:18,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-12 00:20:18,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-09-12 00:20:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:18,333 INFO L225 Difference]: With dead ends: 86 [2020-09-12 00:20:18,333 INFO L226 Difference]: Without dead ends: 86 [2020-09-12 00:20:18,333 INFO L675 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-09-12 00:20:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-12 00:20:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-09-12 00:20:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-09-12 00:20:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-09-12 00:20:18,349 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-09-12 00:20:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:18,349 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-09-12 00:20:18,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-12 00:20:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-09-12 00:20:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-12 00:20:18,352 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:18,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:18,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-12 00:20:18,352 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-09-12 00:20:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 1 times [2020-09-12 00:20:18,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:18,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711854397] [2020-09-12 00:20:18,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:18,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711854397] [2020-09-12 00:20:18,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:18,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-12 00:20:18,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1248859792] [2020-09-12 00:20:18,908 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:18,916 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:18,932 INFO L274 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-09-12 00:20:18,932 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:18,969 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,975 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:18,982 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:19,029 INFO L625 ElimStorePlain]: treesize reduction 91, result has 20.2 percent of original size [2020-09-12 00:20:19,029 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_86| vanished before elimination [2020-09-12 00:20:19,030 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:19,030 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:19,030 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:19,031 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:174, output treesize:23 [2020-09-12 00:20:19,037 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:19,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-12 00:20:19,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:19,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-12 00:20:19,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-12 00:20:19,039 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2020-09-12 00:20:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:19,425 INFO L93 Difference]: Finished difference Result 145 states and 268 transitions. [2020-09-12 00:20:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-12 00:20:19,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-09-12 00:20:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:19,427 INFO L225 Difference]: With dead ends: 145 [2020-09-12 00:20:19,427 INFO L226 Difference]: Without dead ends: 145 [2020-09-12 00:20:19,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-12 00:20:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-09-12 00:20:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2020-09-12 00:20:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-12 00:20:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 191 transitions. [2020-09-12 00:20:19,446 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 191 transitions. Word has length 18 [2020-09-12 00:20:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:19,446 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 191 transitions. [2020-09-12 00:20:19,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-12 00:20:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 191 transitions. [2020-09-12 00:20:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-12 00:20:19,448 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:19,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:19,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-12 00:20:19,448 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-09-12 00:20:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 1 times [2020-09-12 00:20:19,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:19,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938412237] [2020-09-12 00:20:19,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:20,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938412237] [2020-09-12 00:20:20,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:20,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:20:20,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [717661355] [2020-09-12 00:20:20,433 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:20,442 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:20,451 INFO L274 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-09-12 00:20:20,452 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:20,474 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:20,477 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:20,481 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:20,483 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:20,517 INFO L625 ElimStorePlain]: treesize reduction 133, result has 13.1 percent of original size [2020-09-12 00:20:20,518 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_87| vanished before elimination [2020-09-12 00:20:20,518 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:20,518 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:20,518 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:20:20,518 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:233, output treesize:20 [2020-09-12 00:20:20,524 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:20,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-12 00:20:20,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:20,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-12 00:20:20,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-12 00:20:20,525 INFO L87 Difference]: Start difference. First operand 103 states and 191 transitions. Second operand 12 states. [2020-09-12 00:20:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:21,483 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2020-09-12 00:20:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-12 00:20:21,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-09-12 00:20:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:21,485 INFO L225 Difference]: With dead ends: 157 [2020-09-12 00:20:21,485 INFO L226 Difference]: Without dead ends: 136 [2020-09-12 00:20:21,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-09-12 00:20:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-09-12 00:20:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2020-09-12 00:20:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-12 00:20:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 190 transitions. [2020-09-12 00:20:21,490 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 190 transitions. Word has length 18 [2020-09-12 00:20:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:21,490 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 190 transitions. [2020-09-12 00:20:21,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-12 00:20:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 190 transitions. [2020-09-12 00:20:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-12 00:20:21,496 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:21,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:21,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-12 00:20:21,497 INFO L427 AbstractCegarLoop]: === Iteration 7 === [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-09-12 00:20:21,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555757, now seen corresponding path program 2 times [2020-09-12 00:20:21,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:21,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833762398] [2020-09-12 00:20:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:22,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833762398] [2020-09-12 00:20:22,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:22,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-12 00:20:22,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2133128747] [2020-09-12 00:20:22,277 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:22,282 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:22,290 INFO L274 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-09-12 00:20:22,290 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:22,307 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:22,308 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:22,311 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:22,345 INFO L625 ElimStorePlain]: treesize reduction 92, result has 22.7 percent of original size [2020-09-12 00:20:22,345 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_88| vanished before elimination [2020-09-12 00:20:22,345 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:22,346 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:22,346 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-12 00:20:22,346 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:179, output treesize:27 [2020-09-12 00:20:22,348 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:22,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-12 00:20:22,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:22,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-12 00:20:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-09-12 00:20:22,350 INFO L87 Difference]: Start difference. First operand 103 states and 190 transitions. Second operand 10 states. [2020-09-12 00:20:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:23,055 INFO L93 Difference]: Finished difference Result 176 states and 300 transitions. [2020-09-12 00:20:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-12 00:20:23,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-09-12 00:20:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:23,058 INFO L225 Difference]: With dead ends: 176 [2020-09-12 00:20:23,058 INFO L226 Difference]: Without dead ends: 176 [2020-09-12 00:20:23,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2020-09-12 00:20:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-09-12 00:20:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 123. [2020-09-12 00:20:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-12 00:20:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 227 transitions. [2020-09-12 00:20:23,067 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 227 transitions. Word has length 18 [2020-09-12 00:20:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:23,068 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 227 transitions. [2020-09-12 00:20:23,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-12 00:20:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 227 transitions. [2020-09-12 00:20:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-12 00:20:23,070 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:23,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:23,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-12 00:20:23,071 INFO L427 AbstractCegarLoop]: === Iteration 8 === [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-09-12 00:20:23,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555779, now seen corresponding path program 2 times [2020-09-12 00:20:23,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:23,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738340457] [2020-09-12 00:20:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:23,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738340457] [2020-09-12 00:20:23,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:23,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:20:23,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [329364153] [2020-09-12 00:20:23,934 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:23,940 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:23,949 INFO L274 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-09-12 00:20:23,949 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:23,971 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,972 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,973 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:23,976 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:24,015 INFO L625 ElimStorePlain]: treesize reduction 134, result has 13.5 percent of original size [2020-09-12 00:20:24,016 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-12 00:20:24,016 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:24,016 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_89| vanished before elimination [2020-09-12 00:20:24,016 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:20:24,017 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:235, output treesize:21 [2020-09-12 00:20:24,021 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:24,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-12 00:20:24,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:24,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-12 00:20:24,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-09-12 00:20:24,022 INFO L87 Difference]: Start difference. First operand 123 states and 227 transitions. Second operand 12 states. [2020-09-12 00:20:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:24,768 INFO L93 Difference]: Finished difference Result 174 states and 298 transitions. [2020-09-12 00:20:24,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-12 00:20:24,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-09-12 00:20:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:24,771 INFO L225 Difference]: With dead ends: 174 [2020-09-12 00:20:24,771 INFO L226 Difference]: Without dead ends: 163 [2020-09-12 00:20:24,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-09-12 00:20:24,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-09-12 00:20:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 127. [2020-09-12 00:20:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-09-12 00:20:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 233 transitions. [2020-09-12 00:20:24,777 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 233 transitions. Word has length 18 [2020-09-12 00:20:24,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:24,777 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 233 transitions. [2020-09-12 00:20:24,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-12 00:20:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 233 transitions. [2020-09-12 00:20:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-12 00:20:24,778 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:24,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:24,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-12 00:20:24,779 INFO L427 AbstractCegarLoop]: === Iteration 9 === [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-09-12 00:20:24,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:24,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1342972915, now seen corresponding path program 3 times [2020-09-12 00:20:24,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:24,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688992457] [2020-09-12 00:20:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:25,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688992457] [2020-09-12 00:20:25,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:25,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-12 00:20:25,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [818491179] [2020-09-12 00:20:25,562 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:25,566 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:25,573 INFO L274 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-09-12 00:20:25,573 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:25,618 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-12 00:20:25,619 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:25,628 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-12 00:20:25,628 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:25,636 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-12 00:20:25,636 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:25,643 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-12 00:20:25,644 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:25,675 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:25,676 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_90| vanished before elimination [2020-09-12 00:20:25,682 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-12 00:20:25,682 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:25,688 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-12 00:20:25,688 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:25,694 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-12 00:20:25,695 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:25,699 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-12 00:20:25,699 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:25,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:25,714 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_90| vanished before elimination [2020-09-12 00:20:25,714 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-09-12 00:20:25,714 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:214, output treesize:50 [2020-09-12 00:20:25,869 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [4304#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.offset |ULTIMATE.start_main_~#data~1.offset|) (<= 1 (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28))) (<= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| my_callbackThread1of1ForFork1_~data~0.base))), 4302#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (<= 2 (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28))) (<= (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)) 2)), 4303#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (<= 2 (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28))) (<= (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)) 2))] [2020-09-12 00:20:25,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-12 00:20:25,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:25,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-12 00:20:25,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-09-12 00:20:25,870 INFO L87 Difference]: Start difference. First operand 127 states and 233 transitions. Second operand 15 states. [2020-09-12 00:20:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:27,014 INFO L93 Difference]: Finished difference Result 180 states and 308 transitions. [2020-09-12 00:20:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-12 00:20:27,015 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-09-12 00:20:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:27,017 INFO L225 Difference]: With dead ends: 180 [2020-09-12 00:20:27,017 INFO L226 Difference]: Without dead ends: 155 [2020-09-12 00:20:27,018 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2020-09-12 00:20:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-09-12 00:20:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 119. [2020-09-12 00:20:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-09-12 00:20:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 218 transitions. [2020-09-12 00:20:27,023 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 218 transitions. Word has length 18 [2020-09-12 00:20:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:27,024 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 218 transitions. [2020-09-12 00:20:27,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-12 00:20:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 218 transitions. [2020-09-12 00:20:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-12 00:20:27,025 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:27,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:27,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-12 00:20:27,025 INFO L427 AbstractCegarLoop]: === Iteration 10 === [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-09-12 00:20:27,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:27,026 INFO L82 PathProgramCache]: Analyzing trace with hash -285831053, now seen corresponding path program 4 times [2020-09-12 00:20:27,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:27,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125297616] [2020-09-12 00:20:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-12 00:20:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-12 00:20:27,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125297616] [2020-09-12 00:20:27,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-12 00:20:27,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-12 00:20:27,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379165012] [2020-09-12 00:20:27,691 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-12 00:20:27,694 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-12 00:20:27,699 INFO L274 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-09-12 00:20:27,700 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-12 00:20:27,719 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:27,720 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:27,724 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:27,724 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:27,726 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:27,726 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:27,730 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-12 00:20:27,731 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-12 00:20:27,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-12 00:20:27,742 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_91| vanished before elimination [2020-09-12 00:20:27,742 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-12 00:20:27,743 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_91| vanished before elimination [2020-09-12 00:20:27,743 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-12 00:20:27,743 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:233, output treesize:20 [2020-09-12 00:20:27,747 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-12 00:20:27,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-12 00:20:27,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-12 00:20:27,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-12 00:20:27,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-09-12 00:20:27,748 INFO L87 Difference]: Start difference. First operand 119 states and 218 transitions. Second operand 11 states. [2020-09-12 00:20:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-12 00:20:28,411 INFO L93 Difference]: Finished difference Result 173 states and 306 transitions. [2020-09-12 00:20:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-12 00:20:28,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-09-12 00:20:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-12 00:20:28,413 INFO L225 Difference]: With dead ends: 173 [2020-09-12 00:20:28,414 INFO L226 Difference]: Without dead ends: 152 [2020-09-12 00:20:28,414 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-09-12 00:20:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-09-12 00:20:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2020-09-12 00:20:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-12 00:20:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 224 transitions. [2020-09-12 00:20:28,419 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 224 transitions. Word has length 18 [2020-09-12 00:20:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-12 00:20:28,419 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 224 transitions. [2020-09-12 00:20:28,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-12 00:20:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 224 transitions. [2020-09-12 00:20:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-12 00:20:28,420 INFO L414 BasicCegarLoop]: Found error trace [2020-09-12 00:20:28,420 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-12 00:20:28,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-12 00:20:28,420 INFO L427 AbstractCegarLoop]: === Iteration 11 === [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-09-12 00:20:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-12 00:20:28,421 INFO L82 PathProgramCache]: Analyzing trace with hash 311067339, now seen corresponding path program 5 times [2020-09-12 00:20:28,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-12 00:20:28,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325918717] [2020-09-12 00:20:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-12 00:20:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-12 00:20:28,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-12 00:20:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-12 00:20:28,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-12 00:20:28,592 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-12 00:20:28,593 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-12 00:20:28,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-12 00:20:28,593 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-12 00:20:28,594 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-12 00:20:28,594 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-12 00:20:28,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1706-->L1708-2: Formula: (let ((.cse0 (select |#memory_int_In-214105127| ULTIMATE.start_my_drv_probe_~data.base_In-214105127))) (and (= ULTIMATE.start_ldv_assert_~expression_Out-214105127 1) (= (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-214105127 28)) |ULTIMATE.start_my_drv_probe_#t~mem32_Out-214105127|) (let ((.cse1 (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out-214105127| 0))) (or (and .cse1 (= |ULTIMATE.start_ldv_assert_#in~expression_Out-214105127| 1)) (and (not .cse1) (= |ULTIMATE.start_ldv_assert_#in~expression_Out-214105127| 0)))) (= (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-214105127 24)) 0))) InVars {ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-214105127, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-214105127, #memory_int=|#memory_int_In-214105127|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out-214105127|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-214105127|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-214105127, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-214105127, #memory_int=|#memory_int_In-214105127|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-214105127|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-214105127} 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-09-12 00:20:28,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L1708-2-->L1709-1: Formula: (and (not (= ULTIMATE.start_ldv_assert_~expression_Out660538815 0)) (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In660538815| 2147483647) (= ULTIMATE.start_ldv_assert_~expression_Out660538815 |ULTIMATE.start_ldv_assert_#in~expression_In660538815|) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In660538815| 2147483648))) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In660538815|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In660538815|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out660538815|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In660538815|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In660538815|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out660538815} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-09-12 00:20:28,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] L1721-3-->L1741-2: Formula: (let ((.cse0 (select |#memory_int_In1748671917| |ULTIMATE.start_main_~#data~1.base_In1748671917|))) (and (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In1748671917| 28)) |ULTIMATE.start_main_#t~mem43_Out1748671917|) (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In1748671917| 24)) 1) (= ULTIMATE.start_ldv_assert_~expression_Out1748671917 1) (let ((.cse1 (= 2 |ULTIMATE.start_main_#t~mem43_Out1748671917|))) (or (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out1748671917| 0) (not .cse1)) (and .cse1 (= |ULTIMATE.start_ldv_assert_#in~expression_Out1748671917| 1)))))) InVars {#memory_int=|#memory_int_In1748671917|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1748671917|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1748671917|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out1748671917|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out1748671917|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out1748671917|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out1748671917|, #memory_int=|#memory_int_In1748671917|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1748671917|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out1748671917|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1748671917|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out1748671917} 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-09-12 00:20:28,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 12:20:28 BasicIcfg [2020-09-12 00:20:28,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-12 00:20:28,656 INFO L168 Benchmark]: Toolchain (without parser) took 24005.11 ms. Allocated memory was 139.5 MB in the beginning and 438.8 MB in the end (delta: 299.4 MB). Free memory was 99.3 MB in the beginning and 380.5 MB in the end (delta: -281.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. [2020-09-12 00:20:28,657 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-12 00:20:28,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1542.21 ms. Allocated memory was 139.5 MB in the beginning and 238.0 MB in the end (delta: 98.6 MB). Free memory was 98.7 MB in the beginning and 174.4 MB in the end (delta: -75.7 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. [2020-09-12 00:20:28,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.26 ms. Allocated memory is still 238.0 MB. Free memory was 174.4 MB in the beginning and 171.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-09-12 00:20:28,658 INFO L168 Benchmark]: Boogie Preprocessor took 115.96 ms. Allocated memory is still 238.0 MB. Free memory was 171.4 MB in the beginning and 168.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-09-12 00:20:28,659 INFO L168 Benchmark]: RCFGBuilder took 848.61 ms. Allocated memory is still 238.0 MB. Free memory was 168.4 MB in the beginning and 120.8 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2020-09-12 00:20:28,660 INFO L168 Benchmark]: TraceAbstraction took 21395.62 ms. Allocated memory was 238.0 MB in the beginning and 438.8 MB in the end (delta: 200.8 MB). Free memory was 120.8 MB in the beginning and 380.5 MB in the end (delta: -259.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-12 00:20:28,663 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.26 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1542.21 ms. Allocated memory was 139.5 MB in the beginning and 238.0 MB in the end (delta: 98.6 MB). Free memory was 98.7 MB in the beginning and 174.4 MB in the end (delta: -75.7 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 91.26 ms. Allocated memory is still 238.0 MB. Free memory was 174.4 MB in the beginning and 171.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.96 ms. Allocated memory is still 238.0 MB. Free memory was 171.4 MB in the beginning and 168.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.61 ms. Allocated memory is still 238.0 MB. Free memory was 168.4 MB in the beginning and 120.8 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21395.62 ms. Allocated memory was 238.0 MB in the beginning and 438.8 MB in the end (delta: 200.8 MB). Free memory was 120.8 MB in the beginning and 380.5 MB in the end (delta: -259.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.4s, 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={5:24}, t1={6:0}, t2={3: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={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1700] 1 data->shared.b VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={3: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={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={3: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={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={3: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={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 245 SDtfs, 267 SDslu, 761 SDs, 0 SdLazy, 1881 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 4.0s 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, 10 MinimizatonAttempts, 274 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 45920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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...