/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 19:19:05,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 19:19:05,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 19:19:05,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 19:19:05,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 19:19:05,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 19:19:05,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 19:19:05,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 19:19:05,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 19:19:05,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 19:19:05,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 19:19:05,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 19:19:05,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 19:19:05,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 19:19:05,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 19:19:05,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 19:19:05,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 19:19:05,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 19:19:05,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 19:19:05,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 19:19:05,655 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 19:19:05,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 19:19:05,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 19:19:05,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 19:19:05,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 19:19:05,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 19:19:05,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 19:19:05,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 19:19:05,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 19:19:05,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 19:19:05,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 19:19:05,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 19:19:05,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 19:19:05,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 19:19:05,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 19:19:05,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 19:19:05,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 19:19:05,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 19:19:05,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 19:19:05,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 19:19:05,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 19:19:05,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 19:19:05,676 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 19:19:05,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 19:19:05,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 19:19:05,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 19:19:05,686 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 19:19:05,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 19:19:05,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 19:19:05,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 19:19:05,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 19:19:05,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 19:19:05,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 19:19:05,687 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 19:19:05,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 19:19:05,687 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 19:19:05,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 19:19:05,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 19:19:05,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 19:19:05,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 19:19:05,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 19:19:05,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:19:05,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 19:19:05,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 19:19:05,688 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 19:19:05,689 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 19:19:05,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 19:19:05,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 19:19:05,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 19:19:05,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 19:19:05,887 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 19:19:05,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-14 19:19:05,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038ac2a7b/48320b9ec32540b890c9ec064b125fd8/FLAGfefe92ccf [2022-04-14 19:19:06,331 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 19:19:06,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-14 19:19:06,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038ac2a7b/48320b9ec32540b890c9ec064b125fd8/FLAGfefe92ccf [2022-04-14 19:19:06,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038ac2a7b/48320b9ec32540b890c9ec064b125fd8 [2022-04-14 19:19:06,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 19:19:06,721 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 19:19:06,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 19:19:06,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 19:19:06,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 19:19:06,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:19:06" (1/1) ... [2022-04-14 19:19:06,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d20186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:06, skipping insertion in model container [2022-04-14 19:19:06,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:19:06" (1/1) ... [2022-04-14 19:19:06,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 19:19:06,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 19:19:07,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i[895,908] [2022-04-14 19:19:07,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:19:07,093 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 19:19:07,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i[895,908] [2022-04-14 19:19:07,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:19:07,133 INFO L208 MainTranslator]: Completed translation [2022-04-14 19:19:07,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:07 WrapperNode [2022-04-14 19:19:07,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 19:19:07,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 19:19:07,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 19:19:07,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 19:19:07,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:07" (1/1) ... [2022-04-14 19:19:07,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:07" (1/1) ... [2022-04-14 19:19:07,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:07" (1/1) ... [2022-04-14 19:19:07,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:07" (1/1) ... [2022-04-14 19:19:07,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:07" (1/1) ... [2022-04-14 19:19:07,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:07" (1/1) ... [2022-04-14 19:19:07,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:07" (1/1) ... [2022-04-14 19:19:07,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 19:19:07,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 19:19:07,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 19:19:07,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 19:19:07,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:07" (1/1) ... [2022-04-14 19:19:07,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:19:07,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:19:07,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 19:19:07,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 19:19:07,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 19:19:07,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 19:19:07,242 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 19:19:07,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 19:19:07,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 19:19:07,243 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 19:19:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 19:19:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 19:19:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 19:19:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 19:19:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 19:19:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 19:19:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 19:19:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 19:19:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 19:19:07,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 19:19:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 19:19:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 19:19:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 19:19:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 19:19:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 19:19:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 19:19:07,298 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 19:19:07,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 19:19:07,394 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 19:19:07,399 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 19:19:07,399 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 19:19:07,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:19:07 BoogieIcfgContainer [2022-04-14 19:19:07,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 19:19:07,401 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 19:19:07,401 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 19:19:07,416 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 19:19:07,418 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:19:07" (1/1) ... [2022-04-14 19:19:07,419 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 19:19:07,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:19:07 BasicIcfg [2022-04-14 19:19:07,446 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 19:19:07,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 19:19:07,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 19:19:07,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 19:19:07,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 07:19:06" (1/4) ... [2022-04-14 19:19:07,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72863dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:19:07, skipping insertion in model container [2022-04-14 19:19:07,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:19:07" (2/4) ... [2022-04-14 19:19:07,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72863dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:19:07, skipping insertion in model container [2022-04-14 19:19:07,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:19:07" (3/4) ... [2022-04-14 19:19:07,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72863dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:19:07, skipping insertion in model container [2022-04-14 19:19:07,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:19:07" (4/4) ... [2022-04-14 19:19:07,464 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007b.iJordan [2022-04-14 19:19:07,467 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 19:19:07,468 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 19:19:07,498 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 19:19:07,502 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 19:19:07,502 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 19:19:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 19:19:07,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 19:19:07,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:19:07,517 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:19:07,518 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:19:07,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:19:07,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1113749397, now seen corresponding path program 1 times [2022-04-14 19:19:07,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:19:07,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477932109] [2022-04-14 19:19:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:19:07,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:19:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:07,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:19:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:07,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-14 19:19:07,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 19:19:07,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 19:19:07,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:19:07,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-14 19:19:07,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 19:19:07,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 19:19:07,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 19:19:07,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {25#true} is VALID [2022-04-14 19:19:07,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [69] L28-2-->L28-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-14 19:19:07,642 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {26#false} is VALID [2022-04-14 19:19:07,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-14 19:19:07,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-14 19:19:07,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-14 19:19:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:19:07,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:19:07,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477932109] [2022-04-14 19:19:07,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477932109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:19:07,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:19:07,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 19:19:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194796730] [2022-04-14 19:19:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:19:07,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 19:19:07,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:19:07,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:07,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:07,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 19:19:07,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:19:07,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 19:19:07,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 19:19:07,678 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:07,725 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-14 19:19:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 19:19:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 19:19:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:19:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-14 19:19:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-14 19:19:07,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-04-14 19:19:07,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:07,763 INFO L225 Difference]: With dead ends: 22 [2022-04-14 19:19:07,763 INFO L226 Difference]: Without dead ends: 17 [2022-04-14 19:19:07,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 19:19:07,769 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:19:07,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:19:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-14 19:19:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-14 19:19:07,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:19:07,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:07,789 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:07,789 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:07,792 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-14 19:19:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-14 19:19:07,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:07,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:07,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-14 19:19:07,793 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-14 19:19:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:07,794 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-14 19:19:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-14 19:19:07,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:07,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:07,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:19:07,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:19:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-14 19:19:07,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-14 19:19:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:19:07,797 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-14 19:19:07,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-14 19:19:07,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 19:19:07,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:19:07,798 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:19:07,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 19:19:07,799 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:19:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:19:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1114672918, now seen corresponding path program 1 times [2022-04-14 19:19:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:19:07,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137779217] [2022-04-14 19:19:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:19:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:19:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:07,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:19:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:07,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {106#true} is VALID [2022-04-14 19:19:07,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-14 19:19:07,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-14 19:19:07,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {106#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:19:07,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {106#true} is VALID [2022-04-14 19:19:07,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-14 19:19:07,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#true} {106#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-14 19:19:07,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {106#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-14 19:19:07,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {106#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {111#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-14 19:19:07,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#(or (<= 0 main_~m~0) (<= main_~n~0 0))} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {111#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-14 19:19:07,877 INFO L272 TraceCheckUtils]: 7: Hoare triple {111#(or (<= 0 main_~m~0) (<= main_~n~0 0))} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 19:19:07,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {112#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {113#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 19:19:07,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {113#(not (= __VERIFIER_assert_~cond 0))} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {107#false} is VALID [2022-04-14 19:19:07,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {107#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#false} is VALID [2022-04-14 19:19:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:19:07,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:19:07,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137779217] [2022-04-14 19:19:07,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137779217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:19:07,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:19:07,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:19:07,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210995984] [2022-04-14 19:19:07,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:19:07,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 19:19:07,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:19:07,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:07,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:07,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:19:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:19:07,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:19:07,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:19:07,898 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:08,037 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-14 19:19:08,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 19:19:08,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 19:19:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:19:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-14 19:19:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-14 19:19:08,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-14 19:19:08,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:08,083 INFO L225 Difference]: With dead ends: 26 [2022-04-14 19:19:08,083 INFO L226 Difference]: Without dead ends: 26 [2022-04-14 19:19:08,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 19:19:08,084 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:19:08,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:19:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-14 19:19:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-14 19:19:08,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:19:08,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 19:19:08,092 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 19:19:08,092 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 19:19:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:08,094 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-14 19:19:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-14 19:19:08,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:08,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:08,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-14 19:19:08,095 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-14 19:19:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:08,096 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-14 19:19:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-14 19:19:08,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:08,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:08,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:19:08,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:19:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 19:19:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-14 19:19:08,098 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2022-04-14 19:19:08,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:19:08,099 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-14 19:19:08,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-14 19:19:08,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 19:19:08,099 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:19:08,099 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:19:08,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 19:19:08,100 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:19:08,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:19:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1184176601, now seen corresponding path program 1 times [2022-04-14 19:19:08,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:19:08,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99527827] [2022-04-14 19:19:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:19:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:19:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:08,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:19:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:08,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {228#true} is VALID [2022-04-14 19:19:08,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:19:08,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {228#true} is VALID [2022-04-14 19:19:08,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {233#(= main_~x~0 0)} is VALID [2022-04-14 19:19:08,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(= main_~x~0 0)} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {233#(= main_~x~0 0)} is VALID [2022-04-14 19:19:08,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= main_~x~0 0)} [73] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_3| 0)) (= v_main_~m~0_3 v_main_~x~0_3)) InVars {main_~x~0=v_main_~x~0_3, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~m~0=v_main_~m~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~m~0, main_#t~nondet2] {234#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-14 19:19:08,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(or (<= 0 main_~m~0) (<= main_~n~0 0))} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {234#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-14 19:19:08,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(or (<= 0 main_~m~0) (<= main_~n~0 0))} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {234#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-14 19:19:08,178 INFO L272 TraceCheckUtils]: 10: Hoare triple {234#(or (<= 0 main_~m~0) (<= main_~n~0 0))} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 19:19:08,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {236#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 19:19:08,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {236#(not (= __VERIFIER_assert_~cond 0))} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-14 19:19:08,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-14 19:19:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:19:08,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:19:08,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99527827] [2022-04-14 19:19:08,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99527827] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:19:08,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490447347] [2022-04-14 19:19:08,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:19:08,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:19:08,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:19:08,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 19:19:08,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 19:19:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:08,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 19:19:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:08,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:19:08,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {228#true} is VALID [2022-04-14 19:19:08,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {256#(<= 0 main_~x~0)} is VALID [2022-04-14 19:19:08,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(<= 0 main_~x~0)} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {256#(<= 0 main_~x~0)} is VALID [2022-04-14 19:19:08,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(<= 0 main_~x~0)} [73] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_3| 0)) (= v_main_~m~0_3 v_main_~x~0_3)) InVars {main_~x~0=v_main_~x~0_3, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~m~0=v_main_~m~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~m~0, main_#t~nondet2] {263#(<= 0 main_~m~0)} is VALID [2022-04-14 19:19:08,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(<= 0 main_~m~0)} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {263#(<= 0 main_~m~0)} is VALID [2022-04-14 19:19:08,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#(<= 0 main_~m~0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {263#(<= 0 main_~m~0)} is VALID [2022-04-14 19:19:08,414 INFO L272 TraceCheckUtils]: 10: Hoare triple {263#(<= 0 main_~m~0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {273#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:19:08,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(<= 1 |__VERIFIER_assert_#in~cond|)} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {277#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:19:08,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= 1 __VERIFIER_assert_~cond)} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-14 19:19:08,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-14 19:19:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:19:08,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:19:08,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-14 19:19:08,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= 1 __VERIFIER_assert_~cond)} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-14 19:19:08,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(<= 1 |__VERIFIER_assert_#in~cond|)} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {277#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:19:08,527 INFO L272 TraceCheckUtils]: 10: Hoare triple {263#(<= 0 main_~m~0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {273#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:19:08,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#(<= 0 main_~m~0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {263#(<= 0 main_~m~0)} is VALID [2022-04-14 19:19:08,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(<= 0 main_~m~0)} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {263#(<= 0 main_~m~0)} is VALID [2022-04-14 19:19:08,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(<= 0 main_~x~0)} [73] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_3| 0)) (= v_main_~m~0_3 v_main_~x~0_3)) InVars {main_~x~0=v_main_~x~0_3, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~m~0=v_main_~m~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~m~0, main_#t~nondet2] {263#(<= 0 main_~m~0)} is VALID [2022-04-14 19:19:08,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(<= 0 main_~x~0)} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {256#(<= 0 main_~x~0)} is VALID [2022-04-14 19:19:08,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {256#(<= 0 main_~x~0)} is VALID [2022-04-14 19:19:08,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {228#true} is VALID [2022-04-14 19:19:08,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-14 19:19:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:19:08,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490447347] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 19:19:08,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 19:19:08,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-14 19:19:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529476750] [2022-04-14 19:19:08,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 19:19:08,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 19:19:08,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:19:08,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:08,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:08,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 19:19:08,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:19:08,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 19:19:08,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-14 19:19:08,549 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:08,791 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-14 19:19:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 19:19:08,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 19:19:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:19:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-14 19:19:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-14 19:19:08,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-14 19:19:08,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:08,820 INFO L225 Difference]: With dead ends: 35 [2022-04-14 19:19:08,820 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 19:19:08,820 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-14 19:19:08,821 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:19:08,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 19:19:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 19:19:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2022-04-14 19:19:08,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:19:08,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:08,824 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:08,824 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:08,826 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-14 19:19:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-14 19:19:08,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:08,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:08,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-14 19:19:08,827 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-14 19:19:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:08,828 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-14 19:19:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-14 19:19:08,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:08,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:08,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:19:08,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:19:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-14 19:19:08,830 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-14 19:19:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:19:08,830 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-14 19:19:08,831 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:19:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-14 19:19:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-14 19:19:08,831 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:19:08,831 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:19:08,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 19:19:09,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:19:09,037 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:19:09,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:19:09,038 INFO L85 PathProgramCache]: Analyzing trace with hash 727226116, now seen corresponding path program 1 times [2022-04-14 19:19:09,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:19:09,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681225509] [2022-04-14 19:19:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:19:09,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:19:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:19:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:09,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {455#true} is VALID [2022-04-14 19:19:09,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {455#true} is VALID [2022-04-14 19:19:09,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {455#true} {455#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {455#true} is VALID [2022-04-14 19:19:09,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-14 19:19:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:09,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {455#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {455#true} is VALID [2022-04-14 19:19:09,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {455#true} is VALID [2022-04-14 19:19:09,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {455#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {455#true} is VALID [2022-04-14 19:19:09,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {455#true} {461#(<= main_~n~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {461#(<= main_~n~0 0)} is VALID [2022-04-14 19:19:09,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {455#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:19:09,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {455#true} is VALID [2022-04-14 19:19:09,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {455#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {455#true} is VALID [2022-04-14 19:19:09,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {455#true} {455#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {455#true} is VALID [2022-04-14 19:19:09,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {455#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {455#true} is VALID [2022-04-14 19:19:09,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {460#(= main_~x~0 0)} is VALID [2022-04-14 19:19:09,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#(= main_~x~0 0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {461#(<= main_~n~0 0)} is VALID [2022-04-14 19:19:09,146 INFO L272 TraceCheckUtils]: 7: Hoare triple {461#(<= main_~n~0 0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {455#true} is VALID [2022-04-14 19:19:09,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {455#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {455#true} is VALID [2022-04-14 19:19:09,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {455#true} is VALID [2022-04-14 19:19:09,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {455#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {455#true} is VALID [2022-04-14 19:19:09,147 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {455#true} {461#(<= main_~n~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {461#(<= main_~n~0 0)} is VALID [2022-04-14 19:19:09,159 INFO L272 TraceCheckUtils]: 12: Hoare triple {461#(<= main_~n~0 0)} [75] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (or (<= v_main_~n~0_7 0) (< v_main_~m~0_6 v_main_~n~0_7)) 1 0)) InVars {main_~m~0=v_main_~m~0_6, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {466#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 19:19:09,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {467#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 19:19:09,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {467#(not (= __VERIFIER_assert_~cond 0))} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {456#false} is VALID [2022-04-14 19:19:09,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {456#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#false} is VALID [2022-04-14 19:19:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:19:09,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:19:09,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681225509] [2022-04-14 19:19:09,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681225509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:19:09,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:19:09,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 19:19:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924524951] [2022-04-14 19:19:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:19:09,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-14 19:19:09,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:19:09,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:09,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 19:19:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:19:09,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 19:19:09,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-14 19:19:09,172 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:09,315 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-14 19:19:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 19:19:09,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-14 19:19:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:19:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-14 19:19:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-14 19:19:09,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-14 19:19:09,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:09,343 INFO L225 Difference]: With dead ends: 30 [2022-04-14 19:19:09,343 INFO L226 Difference]: Without dead ends: 22 [2022-04-14 19:19:09,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-14 19:19:09,351 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:19:09,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 19:19:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-14 19:19:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-14 19:19:09,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:19:09,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,356 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,356 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:09,361 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-14 19:19:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-14 19:19:09,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:09,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:09,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-14 19:19:09,361 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-14 19:19:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:09,362 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-14 19:19:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-14 19:19:09,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:09,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:09,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:19:09,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:19:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-14 19:19:09,363 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2022-04-14 19:19:09,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:19:09,363 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-14 19:19:09,364 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-14 19:19:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 19:19:09,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:19:09,364 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:19:09,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 19:19:09,364 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:19:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:19:09,365 INFO L85 PathProgramCache]: Analyzing trace with hash -415543775, now seen corresponding path program 1 times [2022-04-14 19:19:09,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:19:09,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053996896] [2022-04-14 19:19:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:19:09,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:19:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:09,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:19:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:09,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {576#true} is VALID [2022-04-14 19:19:09,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {576#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {576#true} {576#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 19:19:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:09,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {576#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {576#true} is VALID [2022-04-14 19:19:09,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {576#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#true} {582#(= main_~m~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {582#(= main_~m~0 0)} is VALID [2022-04-14 19:19:09,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {576#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:19:09,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {576#true} is VALID [2022-04-14 19:19:09,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#true} {576#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {581#(= main_~x~0 0)} is VALID [2022-04-14 19:19:09,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {581#(= main_~x~0 0)} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {581#(= main_~x~0 0)} is VALID [2022-04-14 19:19:09,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {581#(= main_~x~0 0)} [73] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_3| 0)) (= v_main_~m~0_3 v_main_~x~0_3)) InVars {main_~x~0=v_main_~x~0_3, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~m~0=v_main_~m~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~m~0, main_#t~nondet2] {582#(= main_~m~0 0)} is VALID [2022-04-14 19:19:09,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {582#(= main_~m~0 0)} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {582#(= main_~m~0 0)} is VALID [2022-04-14 19:19:09,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {582#(= main_~m~0 0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {582#(= main_~m~0 0)} is VALID [2022-04-14 19:19:09,471 INFO L272 TraceCheckUtils]: 10: Hoare triple {582#(= main_~m~0 0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {576#true} is VALID [2022-04-14 19:19:09,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {576#true} is VALID [2022-04-14 19:19:09,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,473 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {576#true} {582#(= main_~m~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {582#(= main_~m~0 0)} is VALID [2022-04-14 19:19:09,474 INFO L272 TraceCheckUtils]: 15: Hoare triple {582#(= main_~m~0 0)} [75] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (or (<= v_main_~n~0_7 0) (< v_main_~m~0_6 v_main_~n~0_7)) 1 0)) InVars {main_~m~0=v_main_~m~0_6, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 19:19:09,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {588#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 19:19:09,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {588#(not (= __VERIFIER_assert_~cond 0))} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {577#false} is VALID [2022-04-14 19:19:09,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {577#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {577#false} is VALID [2022-04-14 19:19:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:19:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:19:09,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053996896] [2022-04-14 19:19:09,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053996896] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:19:09,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104512795] [2022-04-14 19:19:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:19:09,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:19:09,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:19:09,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 19:19:09,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 19:19:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:09,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 19:19:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:09,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:19:09,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {576#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {576#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {576#true} is VALID [2022-04-14 19:19:09,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#true} {576#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {576#true} is VALID [2022-04-14 19:19:09,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#true} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {611#(< main_~x~0 main_~n~0)} is VALID [2022-04-14 19:19:09,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {611#(< main_~x~0 main_~n~0)} [73] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_3| 0)) (= v_main_~m~0_3 v_main_~x~0_3)) InVars {main_~x~0=v_main_~x~0_3, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~m~0=v_main_~m~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~m~0, main_#t~nondet2] {615#(< main_~m~0 main_~n~0)} is VALID [2022-04-14 19:19:09,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {615#(< main_~m~0 main_~n~0)} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {615#(< main_~m~0 main_~n~0)} is VALID [2022-04-14 19:19:09,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {615#(< main_~m~0 main_~n~0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {615#(< main_~m~0 main_~n~0)} is VALID [2022-04-14 19:19:09,633 INFO L272 TraceCheckUtils]: 10: Hoare triple {615#(< main_~m~0 main_~n~0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {576#true} is VALID [2022-04-14 19:19:09,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {576#true} is VALID [2022-04-14 19:19:09,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {576#true} is VALID [2022-04-14 19:19:09,633 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {576#true} {615#(< main_~m~0 main_~n~0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {615#(< main_~m~0 main_~n~0)} is VALID [2022-04-14 19:19:09,634 INFO L272 TraceCheckUtils]: 15: Hoare triple {615#(< main_~m~0 main_~n~0)} [75] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (or (<= v_main_~n~0_7 0) (< v_main_~m~0_6 v_main_~n~0_7)) 1 0)) InVars {main_~m~0=v_main_~m~0_6, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:19:09,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {640#(<= 1 |__VERIFIER_assert_#in~cond|)} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:19:09,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {644#(<= 1 __VERIFIER_assert_~cond)} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {577#false} is VALID [2022-04-14 19:19:09,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {577#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {577#false} is VALID [2022-04-14 19:19:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:19:09,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 19:19:09,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104512795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:19:09,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 19:19:09,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-04-14 19:19:09,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980832956] [2022-04-14 19:19:09,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:19:09,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-14 19:19:09,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:19:09,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:09,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:19:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:19:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:19:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-14 19:19:09,650 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:09,739 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-14 19:19:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 19:19:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-14 19:19:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:19:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-14 19:19:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-14 19:19:09,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2022-04-14 19:19:09,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:09,760 INFO L225 Difference]: With dead ends: 27 [2022-04-14 19:19:09,760 INFO L226 Difference]: Without dead ends: 20 [2022-04-14 19:19:09,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-14 19:19:09,761 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:19:09,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:19:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-14 19:19:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-14 19:19:09,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:19:09,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,764 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,764 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:09,765 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-14 19:19:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-14 19:19:09,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:09,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:09,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-14 19:19:09,766 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-14 19:19:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:09,767 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-14 19:19:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-14 19:19:09,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:09,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:09,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:19:09,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:19:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-14 19:19:09,769 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2022-04-14 19:19:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:19:09,769 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-14 19:19:09,770 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-14 19:19:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 19:19:09,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:19:09,772 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:19:09,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 19:19:09,990 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:19:09,990 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:19:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:19:09,990 INFO L85 PathProgramCache]: Analyzing trace with hash -286461056, now seen corresponding path program 1 times [2022-04-14 19:19:09,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:19:09,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366357039] [2022-04-14 19:19:09,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:19:09,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:19:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:19:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:10,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {741#true} is VALID [2022-04-14 19:19:10,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {741#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {741#true} is VALID [2022-04-14 19:19:10,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {741#true} {741#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {741#true} is VALID [2022-04-14 19:19:10,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 19:19:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:19:10,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {741#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {741#true} is VALID [2022-04-14 19:19:10,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {741#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {741#true} is VALID [2022-04-14 19:19:10,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {741#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {741#true} is VALID [2022-04-14 19:19:10,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {741#true} {746#(= main_~m~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {746#(= main_~m~0 0)} is VALID [2022-04-14 19:19:10,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {741#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:19:10,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {741#true} is VALID [2022-04-14 19:19:10,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {741#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {741#true} is VALID [2022-04-14 19:19:10,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {741#true} {741#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {741#true} is VALID [2022-04-14 19:19:10,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {741#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {741#true} is VALID [2022-04-14 19:19:10,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {741#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {746#(= main_~m~0 0)} is VALID [2022-04-14 19:19:10,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {746#(= main_~m~0 0)} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {746#(= main_~m~0 0)} is VALID [2022-04-14 19:19:10,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {746#(= main_~m~0 0)} [74] L29-->L29-2: Formula: (= |v_main_#t~nondet2_5| 0) InVars {main_#t~nondet2=|v_main_#t~nondet2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet2] {746#(= main_~m~0 0)} is VALID [2022-04-14 19:19:10,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {746#(= main_~m~0 0)} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {746#(= main_~m~0 0)} is VALID [2022-04-14 19:19:10,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {746#(= main_~m~0 0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {746#(= main_~m~0 0)} is VALID [2022-04-14 19:19:10,039 INFO L272 TraceCheckUtils]: 10: Hoare triple {746#(= main_~m~0 0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {741#true} is VALID [2022-04-14 19:19:10,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {741#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {741#true} is VALID [2022-04-14 19:19:10,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {741#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {741#true} is VALID [2022-04-14 19:19:10,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {741#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {741#true} is VALID [2022-04-14 19:19:10,040 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {741#true} {746#(= main_~m~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {746#(= main_~m~0 0)} is VALID [2022-04-14 19:19:10,040 INFO L272 TraceCheckUtils]: 15: Hoare triple {746#(= main_~m~0 0)} [75] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (or (<= v_main_~n~0_7 0) (< v_main_~m~0_6 v_main_~n~0_7)) 1 0)) InVars {main_~m~0=v_main_~m~0_6, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {751#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 19:19:10,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {751#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {752#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 19:19:10,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {752#(not (= __VERIFIER_assert_~cond 0))} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {742#false} is VALID [2022-04-14 19:19:10,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {742#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {742#false} is VALID [2022-04-14 19:19:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 19:19:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:19:10,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366357039] [2022-04-14 19:19:10,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366357039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:19:10,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:19:10,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:19:10,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758364224] [2022-04-14 19:19:10,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:19:10,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-14 19:19:10,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:19:10,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:10,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:10,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:19:10,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:19:10,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:19:10,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:19:10,055 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:10,138 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-14 19:19:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:19:10,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-14 19:19:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:19:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-14 19:19:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-14 19:19:10,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-14 19:19:10,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:19:10,153 INFO L225 Difference]: With dead ends: 18 [2022-04-14 19:19:10,154 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 19:19:10,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-14 19:19:10,154 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:19:10,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:19:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 19:19:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 19:19:10,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:19:10,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:19:10,155 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:19:10,155 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:19:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:10,155 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:19:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:19:10,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:10,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:10,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 19:19:10,156 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 19:19:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:19:10,156 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:19:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:19:10,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:10,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:19:10,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:19:10,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:19:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:19:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 19:19:10,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-04-14 19:19:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:19:10,156 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 19:19:10,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:19:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:19:10,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:19:10,158 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 19:19:10,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 19:19:10,161 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-14 19:19:10,161 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 19:19:10,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:19:10 BasicIcfg [2022-04-14 19:19:10,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 19:19:10,164 INFO L158 Benchmark]: Toolchain (without parser) took 3442.64ms. Allocated memory was 185.6MB in the beginning and 292.6MB in the end (delta: 107.0MB). Free memory was 131.0MB in the beginning and 178.1MB in the end (delta: -47.1MB). Peak memory consumption was 60.7MB. Max. memory is 8.0GB. [2022-04-14 19:19:10,164 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 147.7MB in the beginning and 147.6MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 19:19:10,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.62ms. Allocated memory was 185.6MB in the beginning and 292.6MB in the end (delta: 107.0MB). Free memory was 130.8MB in the beginning and 262.3MB in the end (delta: -131.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 19:19:10,164 INFO L158 Benchmark]: Boogie Preprocessor took 28.80ms. Allocated memory is still 292.6MB. Free memory was 262.3MB in the beginning and 260.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 19:19:10,164 INFO L158 Benchmark]: RCFGBuilder took 224.89ms. Allocated memory is still 292.6MB. Free memory was 260.7MB in the beginning and 250.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 19:19:10,164 INFO L158 Benchmark]: IcfgTransformer took 45.55ms. Allocated memory is still 292.6MB. Free memory was 250.0MB in the beginning and 248.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 19:19:10,164 INFO L158 Benchmark]: TraceAbstraction took 2715.61ms. Allocated memory is still 292.6MB. Free memory was 247.9MB in the beginning and 178.1MB in the end (delta: 69.8MB). Peak memory consumption was 71.1MB. Max. memory is 8.0GB. [2022-04-14 19:19:10,165 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 147.7MB in the beginning and 147.6MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 413.62ms. Allocated memory was 185.6MB in the beginning and 292.6MB in the end (delta: 107.0MB). Free memory was 130.8MB in the beginning and 262.3MB in the end (delta: -131.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.80ms. Allocated memory is still 292.6MB. Free memory was 262.3MB in the beginning and 260.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 224.89ms. Allocated memory is still 292.6MB. Free memory was 260.7MB in the beginning and 250.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 45.55ms. Allocated memory is still 292.6MB. Free memory was 250.0MB in the beginning and 248.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2715.61ms. Allocated memory is still 292.6MB. Free memory was 247.9MB in the beginning and 178.1MB in the end (delta: 69.8MB). Peak memory consumption was 71.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 93 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 39, 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, 6 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 5 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10/14 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 19:19:10,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...