/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/nla-digbench-scaling/ps2-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 19:54:12,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 19:54:12,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 19:54:12,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 19:54:12,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 19:54:12,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 19:54:12,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 19:54:12,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 19:54:12,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 19:54:12,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 19:54:12,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 19:54:12,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 19:54:12,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 19:54:12,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 19:54:12,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 19:54:12,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 19:54:12,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 19:54:12,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 19:54:12,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 19:54:12,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 19:54:12,386 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 19:54:12,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 19:54:12,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 19:54:12,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 19:54:12,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 19:54:12,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 19:54:12,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 19:54:12,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 19:54:12,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 19:54:12,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 19:54:12,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 19:54:12,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 19:54:12,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 19:54:12,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 19:54:12,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 19:54:12,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 19:54:12,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 19:54:12,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 19:54:12,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 19:54:12,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 19:54:12,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 19:54:12,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 19:54:12,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 19:54:12,437 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 19:54:12,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 19:54:12,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 19:54:12,439 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 19:54:12,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 19:54:12,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 19:54:12,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 19:54:12,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 19:54:12,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 19:54:12,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 19:54:12,440 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 19:54:12,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 19:54:12,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 19:54:12,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 19:54:12,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 19:54:12,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 19:54:12,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 19:54:12,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 19:54:12,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 19:54:12,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 19:54:12,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 19:54:12,442 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 19:54:12,442 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-27 19:54:12,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 19:54:12,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 19:54:12,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 19:54:12,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 19:54:12,599 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 19:54:12,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound1.c [2022-04-27 19:54:12,668 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76638273a/45eead68509645b1b5108fe5c8493868/FLAG4e2a14b74 [2022-04-27 19:54:12,939 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 19:54:12,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound1.c [2022-04-27 19:54:12,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76638273a/45eead68509645b1b5108fe5c8493868/FLAG4e2a14b74 [2022-04-27 19:54:13,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76638273a/45eead68509645b1b5108fe5c8493868 [2022-04-27 19:54:13,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 19:54:13,379 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 19:54:13,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 19:54:13,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 19:54:13,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 19:54:13,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a4af5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13, skipping insertion in model container [2022-04-27 19:54:13,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 19:54:13,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 19:54:13,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound1.c[454,467] [2022-04-27 19:54:13,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 19:54:13,532 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 19:54:13,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound1.c[454,467] [2022-04-27 19:54:13,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 19:54:13,549 INFO L208 MainTranslator]: Completed translation [2022-04-27 19:54:13,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13 WrapperNode [2022-04-27 19:54:13,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 19:54:13,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 19:54:13,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 19:54:13,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 19:54:13,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 19:54:13,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 19:54:13,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 19:54:13,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 19:54:13,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 19:54:13,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:54:13,608 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-27 19:54:13,613 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-27 19:54:13,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 19:54:13,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 19:54:13,656 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 19:54:13,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 19:54:13,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 19:54:13,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 19:54:13,657 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 19:54:13,657 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 19:54:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 19:54:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 19:54:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 19:54:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 19:54:13,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 19:54:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 19:54:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 19:54:13,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 19:54:13,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 19:54:13,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 19:54:13,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 19:54:13,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 19:54:13,701 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 19:54:13,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 19:54:13,788 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 19:54:13,792 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 19:54:13,793 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 19:54:13,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:54:13 BoogieIcfgContainer [2022-04-27 19:54:13,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 19:54:13,794 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 19:54:13,794 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 19:54:13,795 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 19:54:13,797 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:54:13" (1/1) ... [2022-04-27 19:54:13,798 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 19:54:13,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 07:54:13 BasicIcfg [2022-04-27 19:54:13,811 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 19:54:13,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 19:54:13,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 19:54:13,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 19:54:13,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 07:54:13" (1/4) ... [2022-04-27 19:54:13,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5938a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 07:54:13, skipping insertion in model container [2022-04-27 19:54:13,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:54:13" (2/4) ... [2022-04-27 19:54:13,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5938a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 07:54:13, skipping insertion in model container [2022-04-27 19:54:13,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:54:13" (3/4) ... [2022-04-27 19:54:13,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5938a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 07:54:13, skipping insertion in model container [2022-04-27 19:54:13,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 07:54:13" (4/4) ... [2022-04-27 19:54:13,817 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_valuebound1.cJordan [2022-04-27 19:54:13,825 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 19:54:13,826 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 19:54:13,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 19:54:13,856 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@db4c55, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@724bc027 [2022-04-27 19:54:13,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 19:54:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:54:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 19:54:13,866 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:54:13,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:54:13,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:54:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:54:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash 409333534, now seen corresponding path program 1 times [2022-04-27 19:54:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:54:13,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666685123] [2022-04-27 19:54:13,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:54:13,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:54:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:54:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 19:54:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:54:13,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {30#true} is VALID [2022-04-27 19:54:13,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-27 19:54:13,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-27 19:54:13,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 19:54:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:54:13,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} [68] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {30#true} is VALID [2022-04-27 19:54:13,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} [72] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-27 19:54:13,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} [76] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-27 19:54:13,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} [88] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {31#false} is VALID [2022-04-27 19:54:14,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 19:54:14,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {30#true} is VALID [2022-04-27 19:54:14,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-27 19:54:14,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-27 19:54:14,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-27 19:54:14,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} [64] mainENTRY-->L21: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {30#true} is VALID [2022-04-27 19:54:14,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {30#true} [66] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {30#true} is VALID [2022-04-27 19:54:14,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#true} [68] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {30#true} is VALID [2022-04-27 19:54:14,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#true} [72] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-27 19:54:14,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} [76] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-27 19:54:14,002 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31#false} {30#true} [88] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {31#false} is VALID [2022-04-27 19:54:14,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} [67] L21-1-->L27-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~y~0_5 0) (= v_main_~x~0_5 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_5, main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {31#false} is VALID [2022-04-27 19:54:14,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} [69] L27-2-->L27-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-27 19:54:14,003 INFO L272 TraceCheckUtils]: 13: Hoare triple {31#false} [74] L27-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {31#false} is VALID [2022-04-27 19:54:14,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} [78] __VERIFIER_assertENTRY-->L10: 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] {31#false} is VALID [2022-04-27 19:54:14,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} [82] L10-->L11: 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[] {31#false} is VALID [2022-04-27 19:54:14,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} [84] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-27 19:54:14,004 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-27 19:54:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:54:14,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666685123] [2022-04-27 19:54:14,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666685123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:54:14,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:54:14,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 19:54:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649345948] [2022-04-27 19:54:14,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:54:14,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 19:54:14,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:54:14,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 19:54:14,050 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-27 19:54:14,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 19:54:14,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:54:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 19:54:14,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 19:54:14,075 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 19:54:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:54:14,174 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-27 19:54:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 19:54:14,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 19:54:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:54:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 19:54:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 19:54:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 19:54:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 19:54:14,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-27 19:54:14,232 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-27 19:54:14,240 INFO L225 Difference]: With dead ends: 27 [2022-04-27 19:54:14,240 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 19:54:14,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-27 19:54:14,245 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:54:14,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:54:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 19:54:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 19:54:14,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:54:14,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:54:14,270 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:54:14,270 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:54:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:54:14,277 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 19:54:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 19:54:14,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:54:14,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:54:14,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-27 19:54:14,278 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-27 19:54:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:54:14,280 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 19:54:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 19:54:14,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:54:14,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:54:14,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:54:14,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:54:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:54:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-27 19:54:14,291 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-27 19:54:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:54:14,291 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-27 19:54:14,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 19:54:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 19:54:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 19:54:14,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:54:14,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:54:14,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 19:54:14,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:54:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:54:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1396244096, now seen corresponding path program 1 times [2022-04-27 19:54:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:54:14,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163141236] [2022-04-27 19:54:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:54:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:54:14,308 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:54:14,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723352895] [2022-04-27 19:54:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:54:14,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:54:14,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:54:14,315 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-27 19:54:14,341 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-27 19:54:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:54:14,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 19:54:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:54:14,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:54:14,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-27 19:54:14,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} [62] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {135#true} is VALID [2022-04-27 19:54:14,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-27 19:54:14,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-27 19:54:14,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-27 19:54:14,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} [64] mainENTRY-->L21: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {135#true} is VALID [2022-04-27 19:54:14,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {135#true} [66] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {135#true} is VALID [2022-04-27 19:54:14,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {135#true} [68] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {135#true} is VALID [2022-04-27 19:54:14,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {135#true} [73] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-27 19:54:14,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {135#true} [76] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#true} is VALID [2022-04-27 19:54:14,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {135#true} {135#true} [88] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {135#true} is VALID [2022-04-27 19:54:14,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {135#true} [67] L21-1-->L27-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~y~0_5 0) (= v_main_~x~0_5 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_5, main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {173#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:54:14,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#(and (= main_~x~0 0) (= main_~y~0 0))} [71] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:54:14,475 INFO L272 TraceCheckUtils]: 13: Hoare triple {173#(and (= main_~x~0 0) (= main_~y~0 0))} [75] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~y~0_7 (* v_main_~y~0_7 v_main_~y~0_7) (* (- 2) v_main_~x~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {180#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:54:14,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {180#(<= 1 |__VERIFIER_assert_#in~cond|)} [78] __VERIFIER_assertENTRY-->L10: 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] {184#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:54:14,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {184#(<= 1 __VERIFIER_assert_~cond)} [82] L10-->L11: 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[] {136#false} is VALID [2022-04-27 19:54:14,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {136#false} [84] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#false} is VALID [2022-04-27 19:54:14,476 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-27 19:54:14,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 19:54:14,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:54:14,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163141236] [2022-04-27 19:54:14,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:54:14,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723352895] [2022-04-27 19:54:14,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723352895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:54:14,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:54:14,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 19:54:14,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689360012] [2022-04-27 19:54:14,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:54:14,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 19:54:14,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:54:14,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 19:54:14,490 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-27 19:54:14,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:54:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:54:14,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:54:14,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 19:54:14,491 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 19:54:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:54:14,560 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 19:54:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:54:14,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 19:54:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:54:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 19:54:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-27 19:54:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 19:54:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-27 19:54:14,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-27 19:54:14,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:54:14,586 INFO L225 Difference]: With dead ends: 30 [2022-04-27 19:54:14,586 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 19:54:14,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 19:54:14,587 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:54:14,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:54:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 19:54:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 19:54:14,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:54:14,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:54:14,590 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:54:14,590 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:54:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:54:14,592 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 19:54:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 19:54:14,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:54:14,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:54:14,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 19:54:14,593 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 19:54:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:54:14,594 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 19:54:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 19:54:14,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:54:14,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:54:14,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:54:14,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:54:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:54:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-27 19:54:14,596 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2022-04-27 19:54:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:54:14,596 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-27 19:54:14,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 19:54:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 19:54:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 19:54:14,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:54:14,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:54:14,619 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-27 19:54:14,817 WARN L477 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-27 19:54:14,817 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:54:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:54:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash 279144821, now seen corresponding path program 1 times [2022-04-27 19:54:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:54:14,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259534257] [2022-04-27 19:54:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:54:14,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:54:14,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:54:14,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335063676] [2022-04-27 19:54:14,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:54:14,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:54:14,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:54:14,844 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-27 19:54:14,846 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-27 19:54:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:54:14,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 19:54:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:54:14,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:54:15,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} [62] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {309#true} is VALID [2022-04-27 19:54:15,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} [64] mainENTRY-->L21: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {309#true} is VALID [2022-04-27 19:54:15,062 INFO L272 TraceCheckUtils]: 6: Hoare triple {309#true} [66] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {309#true} is VALID [2022-04-27 19:54:15,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} [68] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {309#true} is VALID [2022-04-27 19:54:15,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} [73] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} [76] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {309#true} {309#true} [88] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {309#true} is VALID [2022-04-27 19:54:15,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {309#true} [67] L21-1-->L27-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~y~0_5 0) (= v_main_~x~0_5 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_5, main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {347#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:54:15,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {347#(and (= main_~x~0 0) (= main_~y~0 0))} [71] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:54:15,064 INFO L272 TraceCheckUtils]: 13: Hoare triple {347#(and (= main_~x~0 0) (= main_~y~0 0))} [75] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~y~0_7 (* v_main_~y~0_7 v_main_~y~0_7) (* (- 2) v_main_~x~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {309#true} is VALID [2022-04-27 19:54:15,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {309#true} [78] __VERIFIER_assertENTRY-->L10: 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] {309#true} is VALID [2022-04-27 19:54:15,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {309#true} [83] L10-->L10-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[] {309#true} is VALID [2022-04-27 19:54:15,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {309#true} [86] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,065 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {309#true} {347#(and (= main_~x~0 0) (= main_~y~0 0))} [90] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~y~0_7 (* v_main_~y~0_7 v_main_~y~0_7) (* (- 2) v_main_~x~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {347#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:54:15,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {347#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-1-->L27-2: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_3)) (= v_main_~y~0_3 (+ v_main_~y~0_4 1)) (< v_main_~c~0_4 v_main_~k~0_6) (= v_main_~c~0_3 (+ v_main_~c~0_4 1))) InVars {main_~y~0=v_main_~y~0_4, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_3, main_~c~0=v_main_~c~0_3, main_~x~0=v_main_~x~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {369#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 19:54:15,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {369#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} [71] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 19:54:15,067 INFO L272 TraceCheckUtils]: 20: Hoare triple {369#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} [75] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~y~0_7 (* v_main_~y~0_7 v_main_~y~0_7) (* (- 2) v_main_~x~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:54:15,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {376#(<= 1 |__VERIFIER_assert_#in~cond|)} [78] __VERIFIER_assertENTRY-->L10: 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] {380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:54:15,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {380#(<= 1 __VERIFIER_assert_~cond)} [82] L10-->L11: 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[] {310#false} is VALID [2022-04-27 19:54:15,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {310#false} [84] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {310#false} is VALID [2022-04-27 19:54:15,068 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-27 19:54:15,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:54:15,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {310#false} [84] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {310#false} is VALID [2022-04-27 19:54:15,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {380#(<= 1 __VERIFIER_assert_~cond)} [82] L10-->L11: 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[] {310#false} is VALID [2022-04-27 19:54:15,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {376#(<= 1 |__VERIFIER_assert_#in~cond|)} [78] __VERIFIER_assertENTRY-->L10: 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] {380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:54:15,204 INFO L272 TraceCheckUtils]: 20: Hoare triple {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [75] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~y~0_7 (* v_main_~y~0_7 v_main_~y~0_7) (* (- 2) v_main_~x~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:54:15,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [71] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 19:54:15,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [80] L28-1-->L27-2: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_3)) (= v_main_~y~0_3 (+ v_main_~y~0_4 1)) (< v_main_~c~0_4 v_main_~k~0_6) (= v_main_~c~0_3 (+ v_main_~c~0_4 1))) InVars {main_~y~0=v_main_~y~0_4, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_6} OutVars{main_~y~0=v_main_~y~0_3, main_~c~0=v_main_~c~0_3, main_~x~0=v_main_~x~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 19:54:15,207 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {309#true} {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [90] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~y~0_7 (* v_main_~y~0_7 v_main_~y~0_7) (* (- 2) v_main_~x~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 19:54:15,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {309#true} [86] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {309#true} [83] L10-->L10-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[] {309#true} is VALID [2022-04-27 19:54:15,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {309#true} [78] __VERIFIER_assertENTRY-->L10: 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] {309#true} is VALID [2022-04-27 19:54:15,208 INFO L272 TraceCheckUtils]: 13: Hoare triple {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [75] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~y~0_7 (* v_main_~y~0_7 v_main_~y~0_7) (* (- 2) v_main_~x~0_7)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {309#true} is VALID [2022-04-27 19:54:15,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [71] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 19:54:15,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {309#true} [67] L21-1-->L27-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~y~0_5 0) (= v_main_~x~0_5 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_5, main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {396#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 19:54:15,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {309#true} {309#true} [88] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {309#true} is VALID [2022-04-27 19:54:15,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} [76] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} [73] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} [68] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {309#true} is VALID [2022-04-27 19:54:15,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {309#true} [66] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {309#true} is VALID [2022-04-27 19:54:15,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} [64] mainENTRY-->L21: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {309#true} is VALID [2022-04-27 19:54:15,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} [62] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {309#true} is VALID [2022-04-27 19:54:15,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 19:54:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 19:54:15,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:54:15,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259534257] [2022-04-27 19:54:15,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:54:15,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335063676] [2022-04-27 19:54:15,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335063676] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 19:54:15,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:54:15,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 19:54:15,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488311025] [2022-04-27 19:54:15,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:54:15,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 19:54:15,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:54:15,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 19:54:15,228 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-27 19:54:15,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:54:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:54:15,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:54:15,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 19:54:15,230 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 19:54:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:54:15,304 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-27 19:54:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:54:15,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 19:54:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:54:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 19:54:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-27 19:54:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 19:54:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-27 19:54:15,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-04-27 19:54:15,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:54:15,322 INFO L225 Difference]: With dead ends: 27 [2022-04-27 19:54:15,322 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 19:54:15,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 19:54:15,323 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:54:15,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:54:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 19:54:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 19:54:15,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:54:15,324 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-27 19:54:15,324 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-27 19:54:15,325 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-27 19:54:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:54:15,325 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 19:54:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 19:54:15,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:54:15,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:54:15,325 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-27 19:54:15,325 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-27 19:54:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:54:15,325 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 19:54:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 19:54:15,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:54:15,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:54:15,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:54:15,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:54:15,326 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-27 19:54:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 19:54:15,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-27 19:54:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:54:15,326 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 19:54:15,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 19:54:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 19:54:15,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:54:15,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 19:54:15,346 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-27 19:54:15,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 19:54:15,546 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 19:54:15,547 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 19:54:15,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 07:54:15 BasicIcfg [2022-04-27 19:54:15,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 19:54:15,549 INFO L158 Benchmark]: Toolchain (without parser) took 2169.99ms. Allocated memory was 196.1MB in the beginning and 241.2MB in the end (delta: 45.1MB). Free memory was 142.2MB in the beginning and 205.7MB in the end (delta: -63.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 19:54:15,549 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 196.1MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 19:54:15,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.87ms. Allocated memory is still 196.1MB. Free memory was 142.1MB in the beginning and 167.4MB in the end (delta: -25.3MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-27 19:54:15,550 INFO L158 Benchmark]: Boogie Preprocessor took 22.86ms. Allocated memory is still 196.1MB. Free memory was 167.4MB in the beginning and 165.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 19:54:15,550 INFO L158 Benchmark]: RCFGBuilder took 220.23ms. Allocated memory is still 196.1MB. Free memory was 165.8MB in the beginning and 154.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 19:54:15,550 INFO L158 Benchmark]: IcfgTransformer took 17.14ms. Allocated memory is still 196.1MB. Free memory was 154.8MB in the beginning and 153.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 19:54:15,551 INFO L158 Benchmark]: TraceAbstraction took 1736.14ms. Allocated memory was 196.1MB in the beginning and 241.2MB in the end (delta: 45.1MB). Free memory was 152.7MB in the beginning and 205.7MB in the end (delta: -53.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 19:54:15,552 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.08ms. Allocated memory is still 196.1MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 161.87ms. Allocated memory is still 196.1MB. Free memory was 142.1MB in the beginning and 167.4MB in the end (delta: -25.3MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.86ms. Allocated memory is still 196.1MB. Free memory was 167.4MB in the beginning and 165.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 220.23ms. Allocated memory is still 196.1MB. Free memory was 165.8MB in the beginning and 154.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 17.14ms. Allocated memory is still 196.1MB. Free memory was 154.8MB in the beginning and 153.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1736.14ms. Allocated memory was 196.1MB in the beginning and 241.2MB in the end (delta: 45.1MB). Free memory was 152.7MB in the beginning and 205.7MB in the end (delta: -53.0MB). There was no memory consumed. 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: 12]: 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 5 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 62 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=2, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 2 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 6/8 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-27 19:54:15,584 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...