/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-new/count_by_1_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:09:22,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:09:22,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:09:22,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:09:22,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:09:22,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:09:22,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:09:22,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:09:22,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:09:22,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:09:22,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:09:22,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:09:22,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:09:22,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:09:22,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:09:22,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:09:22,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:09:22,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:09:22,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:09:22,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:09:22,408 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:09:22,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:09:22,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:09:22,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:09:22,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:09:22,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:09:22,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:09:22,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:09:22,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:09:22,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:09:22,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:09:22,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:09:22,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:09:22,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:09:22,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:09:22,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:09:22,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:09:22,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:09:22,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:09:22,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:09:22,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:09:22,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:09:22,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:09:22,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:09:22,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:09:22,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:09:22,442 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:09:22,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:09:22,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:09:22,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:09:22,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:09:22,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:09:22,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:09:22,444 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:09:22,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:09:22,444 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:09:22,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:09:22,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:09:22,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:09:22,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:09:22,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:09:22,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:09:22,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:09:22,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:09:22,446 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:09:22,447 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-07 17:09:22,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:09:22,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:09:22,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:09:22,734 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:09:22,735 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:09:22,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1_variant.i [2022-04-07 17:09:22,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05de8cc94/9ee2d4b5ab914185a3c155b1badbbe5f/FLAGb743dcfd2 [2022-04-07 17:09:23,209 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:09:23,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_variant.i [2022-04-07 17:09:23,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05de8cc94/9ee2d4b5ab914185a3c155b1badbbe5f/FLAGb743dcfd2 [2022-04-07 17:09:23,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05de8cc94/9ee2d4b5ab914185a3c155b1badbbe5f [2022-04-07 17:09:23,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:09:23,237 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:09:23,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:09:23,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:09:23,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:09:23,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e3dc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23, skipping insertion in model container [2022-04-07 17:09:23,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:09:23,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:09:23,433 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-new/count_by_1_variant.i[891,904] [2022-04-07 17:09:23,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:09:23,453 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:09:23,464 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-new/count_by_1_variant.i[891,904] [2022-04-07 17:09:23,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:09:23,477 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:09:23,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23 WrapperNode [2022-04-07 17:09:23,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:09:23,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:09:23,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:09:23,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:09:23,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:09:23,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:09:23,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:09:23,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:09:23,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:09:23,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:09:23,544 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-07 17:09:23,552 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-07 17:09:23,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:09:23,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:09:23,581 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:09:23,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:09:23,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:09:23,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:09:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:09:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:09:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 17:09:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 17:09:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:09:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:09:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:09:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:09:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:09:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:09:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:09:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:09:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:09:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:09:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:09:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:09:23,643 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:09:23,645 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:09:23,782 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:09:23,788 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:09:23,788 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 17:09:23,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:09:23 BoogieIcfgContainer [2022-04-07 17:09:23,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:09:23,791 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:09:23,791 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:09:23,799 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:09:23,818 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:09:23" (1/1) ... [2022-04-07 17:09:23,819 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:09:23,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:09:23 BasicIcfg [2022-04-07 17:09:23,848 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:09:23,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:09:23,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:09:23,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:09:23,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:09:23" (1/4) ... [2022-04-07 17:09:23,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44904e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:09:23, skipping insertion in model container [2022-04-07 17:09:23,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:09:23" (2/4) ... [2022-04-07 17:09:23,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44904e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:09:23, skipping insertion in model container [2022-04-07 17:09:23,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:09:23" (3/4) ... [2022-04-07 17:09:23,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44904e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:09:23, skipping insertion in model container [2022-04-07 17:09:23,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:09:23" (4/4) ... [2022-04-07 17:09:23,855 INFO L111 eAbstractionObserver]: Analyzing ICFG count_by_1_variant.iJordan [2022-04-07 17:09:23,859 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:09:23,859 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:09:23,894 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:09:23,900 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-07 17:09:23,900 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:09:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:09:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 17:09:23,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:09:23,922 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:09:23,922 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:09:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:09:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1861424559, now seen corresponding path program 1 times [2022-04-07 17:09:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:09:23,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003997668] [2022-04-07 17:09:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:09:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:09:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:09:24,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:09:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:09:24,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] 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] {23#true} is VALID [2022-04-07 17:09:24,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:09:24,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:09:24,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:09:24,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] 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] {23#true} is VALID [2022-04-07 17:09:24,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:09:24,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:09:24,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:09:24,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [58] mainENTRY-->L26-2: Formula: (= v_main_~i~0_6 0) InVars {} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {28#(<= main_~i~0 1000000)} is VALID [2022-04-07 17:09:24,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(<= main_~i~0 1000000)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {28#(<= main_~i~0 1000000)} is VALID [2022-04-07 17:09:24,230 INFO L272 TraceCheckUtils]: 7: Hoare triple {28#(<= main_~i~0 1000000)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:09:24,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:09:24,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} [68] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 17:09:24,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [70] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 17:09:24,233 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-07 17:09:24,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:09:24,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003997668] [2022-04-07 17:09:24,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003997668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:09:24,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:09:24,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:09:24,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191986891] [2022-04-07 17:09:24,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:09:24,244 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-07 17:09:24,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:09:24,249 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-07 17:09:24,265 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-07 17:09:24,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:09:24,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:09:24,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:09:24,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:09:24,295 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-07 17:09:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:09:24,541 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-07 17:09:24,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:09:24,542 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-07 17:09:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:09:24,543 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-07 17:09:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-07 17:09:24,553 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-07 17:09:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-07 17:09:24,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-07 17:09:24,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:09:24,595 INFO L225 Difference]: With dead ends: 27 [2022-04-07 17:09:24,595 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 17:09:24,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 17:09:24,599 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:09:24,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:09:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 17:09:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-07 17:09:24,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:09:24,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:09:24,637 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:09:24,637 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:09:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:09:24,640 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-07 17:09:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-07 17:09:24,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:09:24,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:09:24,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-07 17:09:24,642 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-07 17:09:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:09:24,644 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-07 17:09:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-07 17:09:24,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:09:24,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:09:24,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:09:24,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:09:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:09:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-07 17:09:24,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2022-04-07 17:09:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:09:24,648 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-07 17:09:24,648 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-07 17:09:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-07 17:09:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 17:09:24,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:09:24,649 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:09:24,650 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:09:24,650 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:09:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:09:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1022018108, now seen corresponding path program 1 times [2022-04-07 17:09:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:09:24,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965991645] [2022-04-07 17:09:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:09:24,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:09:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:09:24,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:09:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:09:24,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] 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] {134#true} is VALID [2022-04-07 17:09:24,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:24,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134#true} {134#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:24,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 17:09:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:09:24,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#true} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {134#true} is VALID [2022-04-07 17:09:24,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#true} [69] L18-->L18-2: Formula: (not (= 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[] {134#true} is VALID [2022-04-07 17:09:24,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} [72] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:24,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#true} {139#(= main_~i~0 0)} [75] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {139#(= main_~i~0 0)} is VALID [2022-04-07 17:09:24,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {134#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:09:24,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] 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] {134#true} is VALID [2022-04-07 17:09:24,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:24,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:24,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {134#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:24,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#true} [58] mainENTRY-->L26-2: Formula: (= v_main_~i~0_6 0) InVars {} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {139#(= main_~i~0 0)} is VALID [2022-04-07 17:09:24,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {139#(= main_~i~0 0)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {139#(= main_~i~0 0)} is VALID [2022-04-07 17:09:24,725 INFO L272 TraceCheckUtils]: 7: Hoare triple {139#(= main_~i~0 0)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {134#true} is VALID [2022-04-07 17:09:24,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#true} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {134#true} is VALID [2022-04-07 17:09:24,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#true} [69] L18-->L18-2: Formula: (not (= 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[] {134#true} is VALID [2022-04-07 17:09:24,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {134#true} [72] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:24,726 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {134#true} {139#(= main_~i~0 0)} [75] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {139#(= main_~i~0 0)} is VALID [2022-04-07 17:09:24,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {139#(= main_~i~0 0)} [66] L27-1-->L26-2: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {144#(<= main_~i~0 1)} is VALID [2022-04-07 17:09:24,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {144#(<= main_~i~0 1)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {144#(<= main_~i~0 1)} is VALID [2022-04-07 17:09:24,728 INFO L272 TraceCheckUtils]: 14: Hoare triple {144#(<= main_~i~0 1)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {145#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:09:24,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {145#(not (= |__VERIFIER_assert_#in~cond| 0))} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {146#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:09:24,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {146#(not (= __VERIFIER_assert_~cond 0))} [68] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {135#false} is VALID [2022-04-07 17:09:24,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {135#false} [70] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#false} is VALID [2022-04-07 17:09:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:09:24,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:09:24,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965991645] [2022-04-07 17:09:24,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965991645] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:09:24,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749943405] [2022-04-07 17:09:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:09:24,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:09:24,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:09:24,733 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-07 17:09:24,781 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-07 17:09:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:09:24,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 17:09:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:09:24,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:09:25,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {134#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:25,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#true} [56] 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] {134#true} is VALID [2022-04-07 17:09:25,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:25,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:25,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {134#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:25,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#true} [58] mainENTRY-->L26-2: Formula: (= v_main_~i~0_6 0) InVars {} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {166#(<= main_~i~0 0)} is VALID [2022-04-07 17:09:25,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(<= main_~i~0 0)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {166#(<= main_~i~0 0)} is VALID [2022-04-07 17:09:25,065 INFO L272 TraceCheckUtils]: 7: Hoare triple {166#(<= main_~i~0 0)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {134#true} is VALID [2022-04-07 17:09:25,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#true} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {134#true} is VALID [2022-04-07 17:09:25,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#true} [69] L18-->L18-2: Formula: (not (= 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[] {134#true} is VALID [2022-04-07 17:09:25,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {134#true} [72] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:25,072 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {134#true} {166#(<= main_~i~0 0)} [75] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {166#(<= main_~i~0 0)} is VALID [2022-04-07 17:09:25,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(<= main_~i~0 0)} [66] L27-1-->L26-2: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {144#(<= main_~i~0 1)} is VALID [2022-04-07 17:09:25,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {144#(<= main_~i~0 1)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {144#(<= main_~i~0 1)} is VALID [2022-04-07 17:09:25,076 INFO L272 TraceCheckUtils]: 14: Hoare triple {144#(<= main_~i~0 1)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {194#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:09:25,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {194#(<= 1 |__VERIFIER_assert_#in~cond|)} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {198#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:09:25,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {198#(<= 1 __VERIFIER_assert_~cond)} [68] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {135#false} is VALID [2022-04-07 17:09:25,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {135#false} [70] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#false} is VALID [2022-04-07 17:09:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:09:25,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:09:25,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {135#false} [70] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#false} is VALID [2022-04-07 17:09:25,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {198#(<= 1 __VERIFIER_assert_~cond)} [68] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {135#false} is VALID [2022-04-07 17:09:25,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {194#(<= 1 |__VERIFIER_assert_#in~cond|)} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {198#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:09:25,283 INFO L272 TraceCheckUtils]: 14: Hoare triple {214#(<= main_~i~0 1000000)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {194#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:09:25,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {214#(<= main_~i~0 1000000)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {214#(<= main_~i~0 1000000)} is VALID [2022-04-07 17:09:25,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {221#(<= main_~i~0 999999)} [66] L27-1-->L26-2: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {214#(<= main_~i~0 1000000)} is VALID [2022-04-07 17:09:25,285 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {134#true} {221#(<= main_~i~0 999999)} [75] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {221#(<= main_~i~0 999999)} is VALID [2022-04-07 17:09:25,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {134#true} [72] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:25,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#true} [69] L18-->L18-2: Formula: (not (= 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[] {134#true} is VALID [2022-04-07 17:09:25,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#true} [67] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {134#true} is VALID [2022-04-07 17:09:25,286 INFO L272 TraceCheckUtils]: 7: Hoare triple {221#(<= main_~i~0 999999)} [64] L27-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~i~0_9 1000000) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {134#true} is VALID [2022-04-07 17:09:25,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {221#(<= main_~i~0 999999)} [62] L26-2-->L27: Formula: (not (= v_main_~i~0_2 1000000)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {221#(<= main_~i~0 999999)} is VALID [2022-04-07 17:09:25,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#true} [58] mainENTRY-->L26-2: Formula: (= v_main_~i~0_6 0) InVars {} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {221#(<= main_~i~0 999999)} is VALID [2022-04-07 17:09:25,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {134#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:25,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} [73] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:25,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:25,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#true} [56] 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] {134#true} is VALID [2022-04-07 17:09:25,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {134#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#true} is VALID [2022-04-07 17:09:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:09:25,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749943405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:09:25,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:09:25,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-07 17:09:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005069174] [2022-04-07 17:09:25,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:09:25,296 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-04-07 17:09:25,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:09:25,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:09:25,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:09:25,326 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 17:09:25,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:09:25,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 17:09:25,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-07 17:09:25,328 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:09:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:09:25,568 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-07 17:09:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 17:09:25,569 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-04-07 17:09:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:09:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:09:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-07 17:09:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:09:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-07 17:09:25,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-07 17:09:25,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:09:25,601 INFO L225 Difference]: With dead ends: 24 [2022-04-07 17:09:25,602 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:09:25,602 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-07 17:09:25,603 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:09:25,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 30 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:09:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:09:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:09:25,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:09:25,605 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-07 17:09:25,605 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-07 17:09:25,605 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-07 17:09:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:09:25,605 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:09:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:09:25,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:09:25,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:09:25,606 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-07 17:09:25,606 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-07 17:09:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:09:25,606 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:09:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:09:25,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:09:25,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:09:25,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:09:25,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:09:25,607 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-07 17:09:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:09:25,607 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-07 17:09:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:09:25,607 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:09:25,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:09:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:09:25,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:09:25,610 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:09:25,640 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-07 17:09:25,836 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:09:25,839 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-07 17:09:25,840 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:09:25,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:09:25 BasicIcfg [2022-04-07 17:09:25,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:09:25,845 INFO L158 Benchmark]: Toolchain (without parser) took 2607.25ms. Allocated memory is still 174.1MB. Free memory was 120.6MB in the beginning and 90.7MB in the end (delta: 29.9MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. [2022-04-07 17:09:25,845 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:09:25,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.31ms. Allocated memory is still 174.1MB. Free memory was 120.6MB in the beginning and 149.9MB in the end (delta: -29.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 17:09:25,846 INFO L158 Benchmark]: Boogie Preprocessor took 32.72ms. Allocated memory is still 174.1MB. Free memory was 149.9MB in the beginning and 148.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:09:25,846 INFO L158 Benchmark]: RCFGBuilder took 277.67ms. Allocated memory is still 174.1MB. Free memory was 148.3MB in the beginning and 138.2MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 17:09:25,846 INFO L158 Benchmark]: IcfgTransformer took 57.43ms. Allocated memory is still 174.1MB. Free memory was 138.2MB in the beginning and 136.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:09:25,847 INFO L158 Benchmark]: TraceAbstraction took 1994.10ms. Allocated memory is still 174.1MB. Free memory was 136.4MB in the beginning and 90.7MB in the end (delta: 45.7MB). Peak memory consumption was 46.7MB. Max. memory is 8.0GB. [2022-04-07 17:09:25,848 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.20ms. Allocated memory is still 174.1MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.31ms. Allocated memory is still 174.1MB. Free memory was 120.6MB in the beginning and 149.9MB in the end (delta: -29.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.72ms. Allocated memory is still 174.1MB. Free memory was 149.9MB in the beginning and 148.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 277.67ms. Allocated memory is still 174.1MB. Free memory was 148.3MB in the beginning and 138.2MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 57.43ms. Allocated memory is still 174.1MB. Free memory was 138.2MB in the beginning and 136.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1994.10ms. Allocated memory is still 174.1MB. Free memory was 136.4MB in the beginning and 90.7MB in the end (delta: 45.7MB). Peak memory consumption was 46.7MB. 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 22 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=1, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 127 SizeOfPredicates, 1 NumberOfNonLiveVariables, 59 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6/12 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-07 17:09:25,883 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...