/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/ps6-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 23:15:00,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 23:15:00,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 23:15:00,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 23:15:00,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 23:15:00,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 23:15:00,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 23:15:00,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 23:15:00,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 23:15:00,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 23:15:00,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 23:15:00,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 23:15:00,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 23:15:00,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 23:15:00,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 23:15:00,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 23:15:00,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 23:15:00,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 23:15:00,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 23:15:00,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 23:15:00,410 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 23:15:00,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 23:15:00,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 23:15:00,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 23:15:00,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 23:15:00,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 23:15:00,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 23:15:00,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 23:15:00,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 23:15:00,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 23:15:00,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 23:15:00,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 23:15:00,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 23:15:00,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 23:15:00,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 23:15:00,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 23:15:00,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 23:15:00,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 23:15:00,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 23:15:00,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 23:15:00,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 23:15:00,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 23:15:00,424 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 23:15:00,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 23:15:00,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 23:15:00,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 23:15:00,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 23:15:00,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 23:15:00,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 23:15:00,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 23:15:00,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 23:15:00,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 23:15:00,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 23:15:00,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 23:15:00,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 23:15:00,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 23:15:00,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 23:15:00,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 23:15:00,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 23:15:00,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 23:15:00,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 23:15:00,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:15:00,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 23:15:00,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 23:15:00,433 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 23:15:00,433 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 23:15:00,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 23:15:00,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 23:15:00,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 23:15:00,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 23:15:00,610 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 23:15:00,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound1.c [2022-04-14 23:15:00,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fd933114/77a46f55934542eaaeedac385d83f065/FLAG04029a292 [2022-04-14 23:15:00,991 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 23:15:00,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound1.c [2022-04-14 23:15:00,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fd933114/77a46f55934542eaaeedac385d83f065/FLAG04029a292 [2022-04-14 23:15:01,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fd933114/77a46f55934542eaaeedac385d83f065 [2022-04-14 23:15:01,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 23:15:01,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 23:15:01,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 23:15:01,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 23:15:01,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 23:15:01,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714c7e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01, skipping insertion in model container [2022-04-14 23:15:01,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 23:15:01,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 23:15:01,595 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/ps6-ll_valuebound1.c[458,471] [2022-04-14 23:15:01,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:15:01,628 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 23:15:01,635 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/ps6-ll_valuebound1.c[458,471] [2022-04-14 23:15:01,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:15:01,648 INFO L208 MainTranslator]: Completed translation [2022-04-14 23:15:01,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01 WrapperNode [2022-04-14 23:15:01,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 23:15:01,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 23:15:01,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 23:15:01,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 23:15:01,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 23:15:01,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 23:15:01,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 23:15:01,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 23:15:01,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:15:01,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:15:01,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 23:15:01,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 23:15:01,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 23:15:01,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 23:15:01,760 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 23:15:01,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 23:15:01,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 23:15:01,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 23:15:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 23:15:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 23:15:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 23:15:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 23:15:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-14 23:15:01,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 23:15:01,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 23:15:01,771 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 23:15:01,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 23:15:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 23:15:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 23:15:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 23:15:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 23:15:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 23:15:01,819 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 23:15:01,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 23:15:01,950 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 23:15:01,957 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 23:15:01,957 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 23:15:01,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:15:01 BoogieIcfgContainer [2022-04-14 23:15:01,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 23:15:01,959 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 23:15:01,959 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 23:15:01,961 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 23:15:01,964 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:15:01" (1/1) ... [2022-04-14 23:15:01,966 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 23:15:01,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:15:01 BasicIcfg [2022-04-14 23:15:01,988 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 23:15:01,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 23:15:01,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 23:15:01,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 23:15:01,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:15:01" (1/4) ... [2022-04-14 23:15:01,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b30100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:15:01, skipping insertion in model container [2022-04-14 23:15:01,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:15:01" (2/4) ... [2022-04-14 23:15:01,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b30100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:15:01, skipping insertion in model container [2022-04-14 23:15:01,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:15:01" (3/4) ... [2022-04-14 23:15:01,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b30100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:15:01, skipping insertion in model container [2022-04-14 23:15:01,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:15:01" (4/4) ... [2022-04-14 23:15:01,993 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound1.cJordan [2022-04-14 23:15:01,997 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 23:15:01,997 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 23:15:02,022 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 23:15:02,026 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 23:15:02,026 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 23:15:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 23:15:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:15:02,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:15:02,053 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:15:02,054 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:15:02,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:15:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1187991702, now seen corresponding path program 1 times [2022-04-14 23:15:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:15:02,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419545297] [2022-04-14 23:15:02,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:15:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:15:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:15:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:02,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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] {32#true} is VALID [2022-04-14 23:15:02,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-14 23:15:02,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-14 23:15:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 23:15:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:02,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [74] 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] {32#true} is VALID [2022-04-14 23:15:02,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} [96] 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_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {33#false} is VALID [2022-04-14 23:15:02,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 23:15:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:02,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [74] 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] {32#true} is VALID [2022-04-14 23:15:02,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-14 23:15:02,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:15:02,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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] {32#true} is VALID [2022-04-14 23:15:02,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-14 23:15:02,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-14 23:15:02,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-14 23:15:02,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= 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_1, main_~y~0=v_main_~y~0_3, 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] {32#true} is VALID [2022-04-14 23:15:02,286 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {32#true} is VALID [2022-04-14 23:15:02,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [74] 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] {32#true} is VALID [2022-04-14 23:15:02,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} [96] 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_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {33#false} is VALID [2022-04-14 23:15:02,288 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-14 23:15:02,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} [74] 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] {32#true} is VALID [2022-04-14 23:15:02,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,289 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-14 23:15:02,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {33#false} is VALID [2022-04-14 23:15:02,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,291 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {33#false} is VALID [2022-04-14 23:15:02,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#false} is VALID [2022-04-14 23:15:02,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-14 23:15:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 23:15:02,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:15:02,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419545297] [2022-04-14 23:15:02,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419545297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:15:02,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:15:02,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 23:15:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642457259] [2022-04-14 23:15:02,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:15:02,300 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 23:15:02,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:15:02,304 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 23:15:02,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:15:02,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 23:15:02,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:15:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 23:15:02,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 23:15:02,355 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 23:15:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:02,704 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-14 23:15:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 23:15:02,704 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 23:15:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:15:02,705 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 23:15:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-14 23:15:02,709 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 23:15:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-14 23:15:02,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-14 23:15:02,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:15:02,760 INFO L225 Difference]: With dead ends: 29 [2022-04-14 23:15:02,760 INFO L226 Difference]: Without dead ends: 24 [2022-04-14 23:15:02,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 23:15:02,763 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:15:02,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:15:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-14 23:15:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-14 23:15:02,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:15:02,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 23:15:02,782 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 23:15:02,782 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 23:15:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:02,785 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-14 23:15:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 23:15:02,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:02,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:15:02,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-14 23:15:02,786 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-14 23:15:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:02,788 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-14 23:15:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 23:15:02,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:02,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:15:02,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:15:02,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:15:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 23:15:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-14 23:15:02,791 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-14 23:15:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:15:02,792 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-14 23:15:02,792 INFO L479 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 23:15:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 23:15:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:15:02,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:15:02,793 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:15:02,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 23:15:02,793 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:15:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:15:02,793 INFO L85 PathProgramCache]: Analyzing trace with hash 793962506, now seen corresponding path program 1 times [2022-04-14 23:15:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:15:02,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668580254] [2022-04-14 23:15:02,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:15:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:15:02,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 23:15:02,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226625449] [2022-04-14 23:15:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:15:02,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:15:02,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:15:02,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 23:15:02,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 23:15:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:02,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 23:15:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:02,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 23:15:03,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-14 23:15:03,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} [68] 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] {149#true} is VALID [2022-04-14 23:15:03,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-14 23:15:03,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-14 23:15:03,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-14 23:15:03,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= 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_1, main_~y~0=v_main_~y~0_3, 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] {149#true} is VALID [2022-04-14 23:15:03,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {149#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {149#true} is VALID [2022-04-14 23:15:03,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {149#true} [74] 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] {149#true} is VALID [2022-04-14 23:15:03,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {149#true} [77] 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[] {149#true} is VALID [2022-04-14 23:15:03,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {149#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-14 23:15:03,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {149#true} {149#true} [96] 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_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {149#true} is VALID [2022-04-14 23:15:03,020 INFO L272 TraceCheckUtils]: 11: Hoare triple {149#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {149#true} is VALID [2022-04-14 23:15:03,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {149#true} [74] 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] {149#true} is VALID [2022-04-14 23:15:03,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#true} [77] 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[] {149#true} is VALID [2022-04-14 23:15:03,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {149#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-14 23:15:03,023 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {149#true} {149#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {149#true} is VALID [2022-04-14 23:15:03,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {149#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {202#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 23:15:03,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {202#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 23:15:03,026 INFO L272 TraceCheckUtils]: 18: Hoare triple {202#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {209#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 23:15:03,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {209#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {213#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:15:03,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {213#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {150#false} is VALID [2022-04-14 23:15:03,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {150#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#false} is VALID [2022-04-14 23:15:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 23:15:03,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 23:15:03,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:15:03,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668580254] [2022-04-14 23:15:03,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 23:15:03,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226625449] [2022-04-14 23:15:03,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226625449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:15:03,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:15:03,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 23:15:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810133247] [2022-04-14 23:15:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:15:03,035 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-14 23:15:03,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:15:03,036 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 23:15:03,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:15:03,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 23:15:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:15:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 23:15:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 23:15:03,050 INFO L87 Difference]: Start difference. First operand 24 states and 27 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 23:15:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:03,211 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-14 23:15:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 23:15:03,211 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-14 23:15:03,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:15:03,211 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 23:15:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-14 23:15:03,214 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 23:15:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-14 23:15:03,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-14 23:15:03,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:15:03,252 INFO L225 Difference]: With dead ends: 33 [2022-04-14 23:15:03,252 INFO L226 Difference]: Without dead ends: 31 [2022-04-14 23:15:03,252 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-14 23:15:03,253 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:15:03,253 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:15:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-14 23:15:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-14 23:15:03,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:15:03,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 23:15:03,256 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 23:15:03,257 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 23:15:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:03,258 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-14 23:15:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 23:15:03,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:03,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:15:03,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-14 23:15:03,260 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-14 23:15:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:03,261 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-14 23:15:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 23:15:03,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:03,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:15:03,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:15:03,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:15:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 23:15:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-14 23:15:03,264 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-14 23:15:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:15:03,264 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-14 23:15:03,264 INFO L479 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 23:15:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 23:15:03,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:15:03,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:15:03,265 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:15:03,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 23:15:03,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:15:03,484 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:15:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:15:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash -503871754, now seen corresponding path program 1 times [2022-04-14 23:15:03,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:15:03,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261615640] [2022-04-14 23:15:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:15:03,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:15:03,496 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 23:15:03,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491874596] [2022-04-14 23:15:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:15:03,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:15:03,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:15:03,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 23:15:03,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 23:15:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:03,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 23:15:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:03,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 23:15:03,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:03,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [68] 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] {347#true} is VALID [2022-04-14 23:15:03,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:03,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:03,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:03,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= 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_1, main_~y~0=v_main_~y~0_3, 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] {347#true} is VALID [2022-04-14 23:15:03,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {347#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {347#true} is VALID [2022-04-14 23:15:03,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#true} [74] 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] {347#true} is VALID [2022-04-14 23:15:03,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#true} [77] 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[] {347#true} is VALID [2022-04-14 23:15:03,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:03,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {347#true} {347#true} [96] 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_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {347#true} is VALID [2022-04-14 23:15:03,723 INFO L272 TraceCheckUtils]: 11: Hoare triple {347#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-14 23:15:03,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {347#true} [74] 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] {347#true} is VALID [2022-04-14 23:15:03,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#true} [77] 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[] {347#true} is VALID [2022-04-14 23:15:03,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:03,724 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#true} {347#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-14 23:15:03,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {347#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {400#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 23:15:03,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {400#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 23:15:03,725 INFO L272 TraceCheckUtils]: 18: Hoare triple {400#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {347#true} is VALID [2022-04-14 23:15:03,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {347#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {347#true} is VALID [2022-04-14 23:15:03,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {347#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:03,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {347#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:03,726 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {347#true} {400#(and (= main_~x~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {400#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 23:15:03,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {400#(and (= main_~x~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {422#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-14 23:15:03,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {422#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-14 23:15:03,729 INFO L272 TraceCheckUtils]: 25: Hoare triple {422#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {429#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 23:15:03,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {429#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {433#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:15:03,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {433#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-14 23:15:03,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {348#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-14 23:15:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 23:15:03,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 23:15:03,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {348#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-14 23:15:03,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {433#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-14 23:15:03,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {429#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {433#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:15:03,910 INFO L272 TraceCheckUtils]: 25: Hoare triple {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {429#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 23:15:03,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-14 23:15:04,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-14 23:15:04,026 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {347#true} {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-14 23:15:04,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {347#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:04,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {347#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:04,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {347#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {347#true} is VALID [2022-04-14 23:15:04,027 INFO L272 TraceCheckUtils]: 18: Hoare triple {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {347#true} is VALID [2022-04-14 23:15:04,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-14 23:15:04,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {347#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {449#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-14 23:15:04,029 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#true} {347#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-14 23:15:04,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:04,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#true} [77] 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[] {347#true} is VALID [2022-04-14 23:15:04,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {347#true} [74] 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] {347#true} is VALID [2022-04-14 23:15:04,029 INFO L272 TraceCheckUtils]: 11: Hoare triple {347#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-14 23:15:04,029 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {347#true} {347#true} [96] 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_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {347#true} is VALID [2022-04-14 23:15:04,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:04,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#true} [77] 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[] {347#true} is VALID [2022-04-14 23:15:04,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#true} [74] 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] {347#true} is VALID [2022-04-14 23:15:04,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {347#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {347#true} is VALID [2022-04-14 23:15:04,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= 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_1, main_~y~0=v_main_~y~0_3, 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] {347#true} is VALID [2022-04-14 23:15:04,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:04,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:04,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:04,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [68] 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] {347#true} is VALID [2022-04-14 23:15:04,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-14 23:15:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 23:15:04,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:15:04,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261615640] [2022-04-14 23:15:04,031 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 23:15:04,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491874596] [2022-04-14 23:15:04,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491874596] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 23:15:04,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 23:15:04,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-14 23:15:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958561435] [2022-04-14 23:15:04,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:15:04,034 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-14 23:15:04,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:15:04,035 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 23:15:04,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:15:04,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 23:15:04,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:15:04,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 23:15:04,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 23:15:04,167 INFO L87 Difference]: Start difference. First operand 31 states and 34 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 23:15:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:04,260 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-14 23:15:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 23:15:04,261 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-14 23:15:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:15:04,261 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 23:15:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-14 23:15:04,263 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 23:15:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-14 23:15:04,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-14 23:15:04,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:15:04,419 INFO L225 Difference]: With dead ends: 35 [2022-04-14 23:15:04,419 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 23:15:04,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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-14 23:15:04,420 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:15:04,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:15:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 23:15:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-14 23:15:04,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:15:04,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 23:15:04,423 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 23:15:04,424 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 23:15:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:04,425 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-14 23:15:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 23:15:04,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:04,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:15:04,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-14 23:15:04,426 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-14 23:15:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:04,428 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-14 23:15:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 23:15:04,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:04,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:15:04,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:15:04,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:15:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 23:15:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-14 23:15:04,430 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-14 23:15:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:15:04,430 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-14 23:15:04,430 INFO L479 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 23:15:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 23:15:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-14 23:15:04,431 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:15:04,431 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:15:04,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-14 23:15:04,631 WARN L460 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-14 23:15:04,631 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:15:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:15:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1285656823, now seen corresponding path program 1 times [2022-04-14 23:15:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:15:04,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906787378] [2022-04-14 23:15:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:15:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:15:04,648 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 23:15:04,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688737056] [2022-04-14 23:15:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:15:04,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:15:04,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:15:04,664 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 23:15:04,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 23:15:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:04,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 23:15:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:04,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 23:15:05,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-14 23:15:05,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#true} [68] 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] {663#true} is VALID [2022-04-14 23:15:05,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-14 23:15:05,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-14 23:15:05,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-14 23:15:05,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= 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_1, main_~y~0=v_main_~y~0_3, 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] {663#true} is VALID [2022-04-14 23:15:05,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {663#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {663#true} is VALID [2022-04-14 23:15:05,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {663#true} [74] 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] {663#true} is VALID [2022-04-14 23:15:05,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {663#true} [77] 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[] {663#true} is VALID [2022-04-14 23:15:05,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {663#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-14 23:15:05,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {663#true} {663#true} [96] 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_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {663#true} is VALID [2022-04-14 23:15:05,102 INFO L272 TraceCheckUtils]: 11: Hoare triple {663#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {663#true} is VALID [2022-04-14 23:15:05,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {663#true} [74] 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] {663#true} is VALID [2022-04-14 23:15:05,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {663#true} [77] 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[] {663#true} is VALID [2022-04-14 23:15:05,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {663#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-14 23:15:05,102 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {663#true} {663#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {663#true} is VALID [2022-04-14 23:15:05,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {663#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {716#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 23:15:05,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {716#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 23:15:05,104 INFO L272 TraceCheckUtils]: 18: Hoare triple {716#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {663#true} is VALID [2022-04-14 23:15:05,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {663#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {663#true} is VALID [2022-04-14 23:15:05,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {663#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-14 23:15:05,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {663#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-14 23:15:05,105 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {663#true} {716#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {716#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 23:15:05,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {716#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (<= main_~c~0 1))} is VALID [2022-04-14 23:15:05,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (<= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (<= main_~c~0 1))} is VALID [2022-04-14 23:15:05,106 INFO L272 TraceCheckUtils]: 25: Hoare triple {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (<= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {663#true} is VALID [2022-04-14 23:15:05,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {663#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {748#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:15:05,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {748#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 23:15:05,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {752#(not (= |__VERIFIER_assert_#in~cond| 0))} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 23:15:05,108 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {752#(not (= |__VERIFIER_assert_#in~cond| 0))} {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (<= main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {759#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-14 23:15:05,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {759#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {763#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-14 23:15:05,109 INFO L272 TraceCheckUtils]: 31: Hoare triple {763#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {663#true} is VALID [2022-04-14 23:15:05,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {663#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {663#true} is VALID [2022-04-14 23:15:05,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {663#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-14 23:15:05,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {663#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-14 23:15:05,110 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {663#true} {763#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {763#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-14 23:15:05,111 INFO L272 TraceCheckUtils]: 36: Hoare triple {763#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {782#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 23:15:05,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {782#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {786#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 23:15:05,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {786#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {664#false} is VALID [2022-04-14 23:15:05,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {664#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#false} is VALID [2022-04-14 23:15:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-14 23:15:05,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 23:15:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:15:33,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906787378] [2022-04-14 23:15:33,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 23:15:33,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688737056] [2022-04-14 23:15:33,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688737056] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 23:15:33,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 23:15:33,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-14 23:15:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227761588] [2022-04-14 23:15:33,524 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 23:15:33,525 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-14 23:15:33,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:15:33,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 23:15:33,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:15:33,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 23:15:33,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:15:33,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 23:15:33,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-14 23:15:33,552 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 23:15:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:33,934 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-14 23:15:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 23:15:33,934 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-14 23:15:33,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:15:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 23:15:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-14 23:15:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 23:15:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-14 23:15:33,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-14 23:15:33,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:15:33,972 INFO L225 Difference]: With dead ends: 40 [2022-04-14 23:15:33,972 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 23:15:33,972 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-14 23:15:33,973 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:15:33,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 151 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:15:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 23:15:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 23:15:33,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:15:33,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 23:15:33,978 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 23:15:33,978 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 23:15:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:33,981 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-14 23:15:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 23:15:33,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:33,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:15:33,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-14 23:15:33,982 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-14 23:15:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:33,983 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-14 23:15:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 23:15:33,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:33,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:15:33,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:15:33,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:15:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 23:15:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-14 23:15:33,985 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-14 23:15:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:15:33,985 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-14 23:15:33,986 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 23:15:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 23:15:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-14 23:15:33,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:15:33,987 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:15:34,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 23:15:34,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:15:34,204 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:15:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:15:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -542323485, now seen corresponding path program 2 times [2022-04-14 23:15:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:15:34,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88057926] [2022-04-14 23:15:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:15:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:15:34,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 23:15:34,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177616561] [2022-04-14 23:15:34,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 23:15:34,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:15:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:15:34,221 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 23:15:34,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 23:15:34,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 23:15:34,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 23:15:34,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-14 23:15:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:15:34,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 23:15:34,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {1005#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {1005#true} [68] 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] {1005#true} is VALID [2022-04-14 23:15:34,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {1005#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {1005#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {1005#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= 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_1, main_~y~0=v_main_~y~0_3, 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] {1005#true} is VALID [2022-04-14 23:15:34,501 INFO L272 TraceCheckUtils]: 6: Hoare triple {1005#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {1005#true} is VALID [2022-04-14 23:15:34,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {1005#true} [74] 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] {1031#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 23:15:34,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {1031#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [77] 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[] {1035#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 23:15:34,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {1035#(not (= |assume_abort_if_not_#in~cond| 0))} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1035#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 23:15:34,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1035#(not (= |assume_abort_if_not_#in~cond| 0))} {1005#true} [96] 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_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {1042#(and (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-14 23:15:34,503 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#(and (<= 0 main_~k~0) (<= main_~k~0 1))} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1005#true} is VALID [2022-04-14 23:15:34,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {1005#true} [74] 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] {1005#true} is VALID [2022-04-14 23:15:34,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {1005#true} [77] 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[] {1005#true} is VALID [2022-04-14 23:15:34,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {1005#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1005#true} {1042#(and (<= 0 main_~k~0) (<= main_~k~0 1))} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1042#(and (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-14 23:15:34,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#(and (<= 0 main_~k~0) (<= main_~k~0 1))} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1061#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-14 23:15:34,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1061#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-14 23:15:34,504 INFO L272 TraceCheckUtils]: 18: Hoare triple {1061#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1005#true} is VALID [2022-04-14 23:15:34,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {1005#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1005#true} is VALID [2022-04-14 23:15:34,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {1005#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {1005#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,505 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1005#true} {1061#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1061#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-14 23:15:34,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {1061#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1083#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-14 23:15:34,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {1083#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-14 23:15:34,507 INFO L272 TraceCheckUtils]: 25: Hoare triple {1083#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1005#true} is VALID [2022-04-14 23:15:34,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {1005#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1005#true} is VALID [2022-04-14 23:15:34,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {1005#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {1005#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,507 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1005#true} {1083#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1083#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-14 23:15:34,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {1083#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1006#false} is VALID [2022-04-14 23:15:34,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {1006#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,508 INFO L272 TraceCheckUtils]: 32: Hoare triple {1006#false} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1006#false} is VALID [2022-04-14 23:15:34,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {1006#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1006#false} is VALID [2022-04-14 23:15:34,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {1006#false} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {1006#false} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,509 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1006#false} {1006#false} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1006#false} is VALID [2022-04-14 23:15:34,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {1006#false} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,509 INFO L272 TraceCheckUtils]: 38: Hoare triple {1006#false} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1006#false} is VALID [2022-04-14 23:15:34,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {1006#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1006#false} is VALID [2022-04-14 23:15:34,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {1006#false} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {1006#false} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,509 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1006#false} {1006#false} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1006#false} is VALID [2022-04-14 23:15:34,509 INFO L272 TraceCheckUtils]: 43: Hoare triple {1006#false} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1006#false} is VALID [2022-04-14 23:15:34,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {1006#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1006#false} is VALID [2022-04-14 23:15:34,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {1006#false} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {1006#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-14 23:15:34,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 23:15:34,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {1006#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {1006#false} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {1006#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1006#false} is VALID [2022-04-14 23:15:34,773 INFO L272 TraceCheckUtils]: 43: Hoare triple {1006#false} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1006#false} is VALID [2022-04-14 23:15:34,773 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1005#true} {1006#false} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1006#false} is VALID [2022-04-14 23:15:34,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {1005#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {1005#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {1005#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1005#true} is VALID [2022-04-14 23:15:34,774 INFO L272 TraceCheckUtils]: 38: Hoare triple {1006#false} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1005#true} is VALID [2022-04-14 23:15:34,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {1006#false} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,774 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1005#true} {1006#false} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1006#false} is VALID [2022-04-14 23:15:34,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {1005#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {1005#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {1005#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1005#true} is VALID [2022-04-14 23:15:34,774 INFO L272 TraceCheckUtils]: 32: Hoare triple {1006#false} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1005#true} is VALID [2022-04-14 23:15:34,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {1006#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1006#false} is VALID [2022-04-14 23:15:34,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {1201#(not (< main_~c~0 main_~k~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1006#false} is VALID [2022-04-14 23:15:34,775 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1005#true} {1201#(not (< main_~c~0 main_~k~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1201#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-14 23:15:34,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {1005#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {1005#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {1005#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1005#true} is VALID [2022-04-14 23:15:34,776 INFO L272 TraceCheckUtils]: 25: Hoare triple {1201#(not (< main_~c~0 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1005#true} is VALID [2022-04-14 23:15:34,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {1201#(not (< main_~c~0 main_~k~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1201#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-14 23:15:34,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {1223#(<= main_~k~0 (+ main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1201#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-14 23:15:34,778 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1005#true} {1223#(<= main_~k~0 (+ main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1223#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-14 23:15:34,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {1005#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {1005#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {1005#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1005#true} is VALID [2022-04-14 23:15:34,779 INFO L272 TraceCheckUtils]: 18: Hoare triple {1223#(<= main_~k~0 (+ main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 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_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1005#true} is VALID [2022-04-14 23:15:34,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {1223#(<= main_~k~0 (+ main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1223#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-14 23:15:34,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {1245#(<= main_~k~0 1)} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1223#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-14 23:15:34,780 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1005#true} {1245#(<= main_~k~0 1)} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1245#(<= main_~k~0 1)} is VALID [2022-04-14 23:15:34,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {1005#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {1005#true} [77] 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[] {1005#true} is VALID [2022-04-14 23:15:34,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {1005#true} [74] 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] {1005#true} is VALID [2022-04-14 23:15:34,780 INFO L272 TraceCheckUtils]: 11: Hoare triple {1245#(<= main_~k~0 1)} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1005#true} is VALID [2022-04-14 23:15:34,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1035#(not (= |assume_abort_if_not_#in~cond| 0))} {1005#true} [96] 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_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {1245#(<= main_~k~0 1)} is VALID [2022-04-14 23:15:34,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {1035#(not (= |assume_abort_if_not_#in~cond| 0))} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1035#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 23:15:34,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {1273#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [77] 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[] {1035#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 23:15:34,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {1005#true} [74] 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] {1273#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 23:15:34,782 INFO L272 TraceCheckUtils]: 6: Hoare triple {1005#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 1)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {1005#true} is VALID [2022-04-14 23:15:34,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {1005#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= 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_1, main_~y~0=v_main_~y~0_3, 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] {1005#true} is VALID [2022-04-14 23:15:34,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {1005#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {1005#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1005#true} [68] 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] {1005#true} is VALID [2022-04-14 23:15:34,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {1005#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1005#true} is VALID [2022-04-14 23:15:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-14 23:15:34,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:15:34,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88057926] [2022-04-14 23:15:34,787 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 23:15:34,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177616561] [2022-04-14 23:15:34,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177616561] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 23:15:34,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 23:15:34,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-04-14 23:15:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287555856] [2022-04-14 23:15:34,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 23:15:34,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-14 23:15:34,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:15:34,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-14 23:15:34,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:15:34,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 23:15:34,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:15:34,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 23:15:34,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-14 23:15:34,831 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-14 23:15:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:34,950 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-14 23:15:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 23:15:34,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-14 23:15:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:15:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-14 23:15:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-04-14 23:15:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-14 23:15:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-04-14 23:15:34,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2022-04-14 23:15:34,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:15:34,976 INFO L225 Difference]: With dead ends: 29 [2022-04-14 23:15:34,976 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 23:15:34,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-14 23:15:34,977 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:15:34,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:15:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 23:15:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 23:15:34,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:15:34,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:15:34,980 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:15:34,980 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:15:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:34,980 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 23:15:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:15:34,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:34,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:15:34,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 23:15:34,980 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 23:15:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:15:34,980 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 23:15:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:15:34,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:34,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:15:34,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:15:34,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:15:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:15:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 23:15:34,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-04-14 23:15:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:15:34,981 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 23:15:34,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-14 23:15:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:15:34,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:15:34,983 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 23:15:35,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 23:15:35,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 23:15:35,201 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-14 23:15:35,202 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 23:15:35,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:15:35 BasicIcfg [2022-04-14 23:15:35,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 23:15:35,205 INFO L158 Benchmark]: Toolchain (without parser) took 33759.78ms. Allocated memory was 181.4MB in the beginning and 265.3MB in the end (delta: 83.9MB). Free memory was 127.7MB in the beginning and 200.1MB in the end (delta: -72.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-14 23:15:35,205 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 23:15:35,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.64ms. Allocated memory is still 181.4MB. Free memory was 127.4MB in the beginning and 156.8MB in the end (delta: -29.4MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-14 23:15:35,205 INFO L158 Benchmark]: Boogie Preprocessor took 28.20ms. Allocated memory is still 181.4MB. Free memory was 156.8MB in the beginning and 155.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 23:15:35,205 INFO L158 Benchmark]: RCFGBuilder took 280.90ms. Allocated memory is still 181.4MB. Free memory was 155.1MB in the beginning and 144.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 23:15:35,205 INFO L158 Benchmark]: IcfgTransformer took 29.60ms. Allocated memory is still 181.4MB. Free memory was 144.2MB in the beginning and 142.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 23:15:35,205 INFO L158 Benchmark]: TraceAbstraction took 33214.53ms. Allocated memory was 181.4MB in the beginning and 265.3MB in the end (delta: 83.9MB). Free memory was 142.1MB in the beginning and 200.1MB in the end (delta: -58.0MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2022-04-14 23:15:35,206 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.64ms. Allocated memory is still 181.4MB. Free memory was 127.4MB in the beginning and 156.8MB in the end (delta: -29.4MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.20ms. Allocated memory is still 181.4MB. Free memory was 156.8MB in the beginning and 155.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 280.90ms. Allocated memory is still 181.4MB. Free memory was 155.1MB in the beginning and 144.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 29.60ms. Allocated memory is still 181.4MB. Free memory was 144.2MB in the beginning and 142.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 33214.53ms. Allocated memory was 181.4MB in the beginning and 265.3MB in the end (delta: 83.9MB). Free memory was 142.1MB in the beginning and 200.1MB in the end (delta: -58.0MB). Peak memory consumption was 26.4MB. 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 318 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 116 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 30.1s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 685 SizeOfPredicates, 7 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 124/139 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 23:15:35,245 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...