/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 15:32:11,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 15:32:11,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 15:32:11,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 15:32:11,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 15:32:11,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 15:32:11,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 15:32:11,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 15:32:11,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 15:32:11,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 15:32:11,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 15:32:11,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 15:32:11,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 15:32:11,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 15:32:11,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 15:32:11,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 15:32:11,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 15:32:11,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 15:32:11,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 15:32:11,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 15:32:11,952 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 15:32:11,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 15:32:11,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 15:32:11,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 15:32:11,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 15:32:11,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 15:32:11,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 15:32:11,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 15:32:11,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 15:32:11,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 15:32:11,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 15:32:11,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 15:32:11,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 15:32:11,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 15:32:11,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 15:32:11,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 15:32:11,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 15:32:11,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 15:32:11,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 15:32:11,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 15:32:11,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 15:32:11,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 15:32:11,975 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 15:32:11,986 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 15:32:11,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 15:32:11,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 15:32:11,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 15:32:11,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 15:32:11,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 15:32:11,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 15:32:11,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 15:32:11,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 15:32:11,990 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 15:32:11,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 15:32:11,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 15:32:11,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 15:32:11,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 15:32:11,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 15:32:11,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:32:11,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 15:32:11,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 15:32:11,992 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 15:32:11,992 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 15:32:11,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 15:32:11,992 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 15:32:11,992 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 15:32:12,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 15:32:12,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 15:32:12,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 15:32:12,269 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 15:32:12,271 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 15:32:12,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound5.c [2022-04-15 15:32:12,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a7b61fa/194c5fe40d874a9393d5e93d598b43b4/FLAG190a81bc8 [2022-04-15 15:32:12,684 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 15:32:12,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound5.c [2022-04-15 15:32:12,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a7b61fa/194c5fe40d874a9393d5e93d598b43b4/FLAG190a81bc8 [2022-04-15 15:32:13,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a7b61fa/194c5fe40d874a9393d5e93d598b43b4 [2022-04-15 15:32:13,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 15:32:13,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 15:32:13,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 15:32:13,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 15:32:13,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 15:32:13,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:32:13" (1/1) ... [2022-04-15 15:32:13,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6956d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13, skipping insertion in model container [2022-04-15 15:32:13,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:32:13" (1/1) ... [2022-04-15 15:32:13,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 15:32:13,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 15:32:13,281 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/geo3-ll_valuebound5.c[525,538] [2022-04-15 15:32:13,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:32:13,334 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 15:32:13,345 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/geo3-ll_valuebound5.c[525,538] [2022-04-15 15:32:13,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:32:13,366 INFO L208 MainTranslator]: Completed translation [2022-04-15 15:32:13,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13 WrapperNode [2022-04-15 15:32:13,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 15:32:13,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 15:32:13,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 15:32:13,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 15:32:13,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13" (1/1) ... [2022-04-15 15:32:13,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13" (1/1) ... [2022-04-15 15:32:13,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13" (1/1) ... [2022-04-15 15:32:13,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13" (1/1) ... [2022-04-15 15:32:13,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13" (1/1) ... [2022-04-15 15:32:13,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13" (1/1) ... [2022-04-15 15:32:13,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13" (1/1) ... [2022-04-15 15:32:13,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 15:32:13,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 15:32:13,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 15:32:13,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 15:32:13,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13" (1/1) ... [2022-04-15 15:32:13,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:32:13,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:32:13,429 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-15 15:32:13,431 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-15 15:32:13,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 15:32:13,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 15:32:13,458 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 15:32:13,458 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 15:32:13,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 15:32:13,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 15:32:13,458 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 15:32:13,458 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 15:32:13,458 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 15:32:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 15:32:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 15:32:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 15:32:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 15:32:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 15:32:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 15:32:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 15:32:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 15:32:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 15:32:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 15:32:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 15:32:13,513 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 15:32:13,515 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 15:32:13,714 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 15:32:13,721 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 15:32:13,721 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 15:32:13,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:32:13 BoogieIcfgContainer [2022-04-15 15:32:13,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 15:32:13,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 15:32:13,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 15:32:13,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 15:32:13,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:32:13" (1/3) ... [2022-04-15 15:32:13,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d18e4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:32:13, skipping insertion in model container [2022-04-15 15:32:13,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:32:13" (2/3) ... [2022-04-15 15:32:13,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d18e4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:32:13, skipping insertion in model container [2022-04-15 15:32:13,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:32:13" (3/3) ... [2022-04-15 15:32:13,732 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_valuebound5.c [2022-04-15 15:32:13,737 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 15:32:13,737 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 15:32:13,781 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 15:32:13,787 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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-15 15:32:13,787 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 15:32:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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-15 15:32:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 15:32:13,815 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:32:13,816 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:32:13,816 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:32:13,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:32:13,822 INFO L85 PathProgramCache]: Analyzing trace with hash -779299010, now seen corresponding path program 1 times [2022-04-15 15:32:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:32:13,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [901347354] [2022-04-15 15:32:13,842 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:32:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash -779299010, now seen corresponding path program 2 times [2022-04-15 15:32:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:32:13,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748137767] [2022-04-15 15:32:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:32:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:32:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:32:14,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 15:32:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:32:14,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 15:32:14,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 15:32:14,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #65#return; {34#true} is VALID [2022-04-15 15:32:14,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 15:32:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:32:14,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 15:32:14,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 15:32:14,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 15:32:14,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-15 15:32:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 15:32:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:32:14,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 15:32:14,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 15:32:14,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 15:32:14,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #57#return; {35#false} is VALID [2022-04-15 15:32:14,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 15:32:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:32:14,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 15:32:14,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 15:32:14,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 15:32:14,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #59#return; {35#false} is VALID [2022-04-15 15:32:14,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 15:32:14,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 15:32:14,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 15:32:14,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #65#return; {34#true} is VALID [2022-04-15 15:32:14,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-15 15:32:14,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-15 15:32:14,090 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {34#true} is VALID [2022-04-15 15:32:14,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 15:32:14,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 15:32:14,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 15:32:14,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-15 15:32:14,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {35#false} is VALID [2022-04-15 15:32:14,092 INFO L272 TraceCheckUtils]: 12: Hoare triple {35#false} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {34#true} is VALID [2022-04-15 15:32:14,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 15:32:14,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 15:32:14,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 15:32:14,095 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {35#false} {35#false} #57#return; {35#false} is VALID [2022-04-15 15:32:14,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#false} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {35#false} is VALID [2022-04-15 15:32:14,095 INFO L272 TraceCheckUtils]: 18: Hoare triple {35#false} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {34#true} is VALID [2022-04-15 15:32:14,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 15:32:14,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 15:32:14,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 15:32:14,098 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35#false} {35#false} #59#return; {35#false} is VALID [2022-04-15 15:32:14,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#false} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {35#false} is VALID [2022-04-15 15:32:14,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-15 15:32:14,099 INFO L272 TraceCheckUtils]: 25: Hoare triple {35#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {35#false} is VALID [2022-04-15 15:32:14,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-15 15:32:14,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-15 15:32:14,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-15 15:32:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 15:32:14,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:32:14,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748137767] [2022-04-15 15:32:14,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748137767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:32:14,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:32:14,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 15:32:14,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:32:14,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [901347354] [2022-04-15 15:32:14,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [901347354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:32:14,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:32:14,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 15:32:14,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83005058] [2022-04-15 15:32:14,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:32:14,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 15:32:14,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:32:14,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 15:32:14,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:32:14,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 15:32:14,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:32:14,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 15:32:14,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 15:32:14,200 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 15:32:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:32:14,401 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-04-15 15:32:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 15:32:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 15:32:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:32:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 15:32:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 15:32:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 15:32:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 15:32:14,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-15 15:32:14,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:32:14,554 INFO L225 Difference]: With dead ends: 55 [2022-04-15 15:32:14,559 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 15:32:14,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-15 15:32:14,566 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 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-15 15:32:14,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:32:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 15:32:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 15:32:14,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:32:14,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 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-15 15:32:14,608 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 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-15 15:32:14,609 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 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-15 15:32:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:32:14,613 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 15:32:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 15:32:14,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:32:14,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:32:14,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 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 26 states. [2022-04-15 15:32:14,615 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 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 26 states. [2022-04-15 15:32:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:32:14,617 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 15:32:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 15:32:14,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:32:14,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:32:14,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:32:14,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:32:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 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-15 15:32:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-15 15:32:14,622 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 29 [2022-04-15 15:32:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:32:14,623 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-15 15:32:14,623 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 15:32:14,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-15 15:32:14,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:32:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 15:32:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 15:32:14,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:32:14,660 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:32:14,660 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 15:32:14,661 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:32:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:32:14,662 INFO L85 PathProgramCache]: Analyzing trace with hash -963850242, now seen corresponding path program 1 times [2022-04-15 15:32:14,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:32:14,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [853515761] [2022-04-15 15:32:14,663 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:32:14,663 INFO L85 PathProgramCache]: Analyzing trace with hash -963850242, now seen corresponding path program 2 times [2022-04-15 15:32:14,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:32:14,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774486117] [2022-04-15 15:32:14,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:32:14,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:32:14,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:32:14,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080189422] [2022-04-15 15:32:14,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:32:14,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:32:14,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:32:14,699 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-15 15:32:14,705 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-15 15:32:14,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:32:14,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:32:14,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:32:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:32:14,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:32:14,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2022-04-15 15:32:14,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {268#true} is VALID [2022-04-15 15:32:14,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#true} assume true; {268#true} is VALID [2022-04-15 15:32:14,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {268#true} {268#true} #65#return; {268#true} is VALID [2022-04-15 15:32:14,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {268#true} call #t~ret7 := main(); {268#true} is VALID [2022-04-15 15:32:14,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {268#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {268#true} is VALID [2022-04-15 15:32:14,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {268#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {268#true} is VALID [2022-04-15 15:32:14,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#true} ~cond := #in~cond; {268#true} is VALID [2022-04-15 15:32:14,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#true} assume !(0 == ~cond); {268#true} is VALID [2022-04-15 15:32:14,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#true} assume true; {268#true} is VALID [2022-04-15 15:32:14,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {268#true} {268#true} #55#return; {268#true} is VALID [2022-04-15 15:32:14,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {268#true} is VALID [2022-04-15 15:32:14,945 INFO L272 TraceCheckUtils]: 12: Hoare triple {268#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {268#true} is VALID [2022-04-15 15:32:14,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {268#true} ~cond := #in~cond; {268#true} is VALID [2022-04-15 15:32:14,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#true} assume !(0 == ~cond); {268#true} is VALID [2022-04-15 15:32:14,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {268#true} assume true; {268#true} is VALID [2022-04-15 15:32:14,946 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {268#true} {268#true} #57#return; {268#true} is VALID [2022-04-15 15:32:14,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {268#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {268#true} is VALID [2022-04-15 15:32:14,946 INFO L272 TraceCheckUtils]: 18: Hoare triple {268#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {268#true} is VALID [2022-04-15 15:32:14,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {268#true} ~cond := #in~cond; {268#true} is VALID [2022-04-15 15:32:14,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {268#true} assume !(0 == ~cond); {268#true} is VALID [2022-04-15 15:32:14,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {268#true} assume true; {268#true} is VALID [2022-04-15 15:32:14,947 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {268#true} {268#true} #59#return; {268#true} is VALID [2022-04-15 15:32:14,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {268#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {342#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:14,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {342#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {342#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:14,950 INFO L272 TraceCheckUtils]: 25: Hoare triple {342#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {349#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:32:14,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {349#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {353#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:32:14,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {353#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {269#false} is VALID [2022-04-15 15:32:14,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {269#false} assume !false; {269#false} is VALID [2022-04-15 15:32:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 15:32:14,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:32:14,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:32:14,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774486117] [2022-04-15 15:32:14,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:32:14,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080189422] [2022-04-15 15:32:14,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080189422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:32:14,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:32:14,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:32:14,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:32:14,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [853515761] [2022-04-15 15:32:14,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [853515761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:32:14,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:32:14,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:32:14,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249417170] [2022-04-15 15:32:14,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:32:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 15:32:14,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:32:14,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:32:14,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:32:14,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:32:14,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:32:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:32:14,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:32:14,981 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:32:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:32:15,204 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 15:32:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:32:15,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 15:32:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:32:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:32:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 15:32:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:32:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 15:32:15,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 15:32:15,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:32:15,252 INFO L225 Difference]: With dead ends: 36 [2022-04-15 15:32:15,252 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 15:32:15,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-15 15:32:15,254 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 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-15 15:32:15,255 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:32:15,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 15:32:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 15:32:15,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:32:15,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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-15 15:32:15,267 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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-15 15:32:15,268 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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-15 15:32:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:32:15,270 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-15 15:32:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 15:32:15,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:32:15,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:32:15,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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 33 states. [2022-04-15 15:32:15,272 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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 33 states. [2022-04-15 15:32:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:32:15,275 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-15 15:32:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 15:32:15,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:32:15,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:32:15,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:32:15,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:32:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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-15 15:32:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-15 15:32:15,279 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-04-15 15:32:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:32:15,279 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-15 15:32:15,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:32:15,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-15 15:32:15,331 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-15 15:32:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 15:32:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 15:32:15,333 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:32:15,333 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:32:15,366 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-15 15:32:15,543 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-15 15:32:15,544 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:32:15,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:32:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash -425626518, now seen corresponding path program 1 times [2022-04-15 15:32:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:32:15,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1724928804] [2022-04-15 15:32:15,546 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:32:15,546 INFO L85 PathProgramCache]: Analyzing trace with hash -425626518, now seen corresponding path program 2 times [2022-04-15 15:32:15,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:32:15,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662852295] [2022-04-15 15:32:15,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:32:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:32:15,579 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:32:15,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567838918] [2022-04-15 15:32:15,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:32:15,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:32:15,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:32:15,581 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-15 15:32:15,591 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-15 15:32:15,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:32:15,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:32:15,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:32:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:32:15,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:32:16,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2022-04-15 15:32:16,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {565#true} is VALID [2022-04-15 15:32:16,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-15 15:32:16,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #65#return; {565#true} is VALID [2022-04-15 15:32:16,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret7 := main(); {565#true} is VALID [2022-04-15 15:32:16,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {565#true} is VALID [2022-04-15 15:32:16,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {565#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {565#true} is VALID [2022-04-15 15:32:16,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-15 15:32:16,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-15 15:32:16,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-15 15:32:16,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {565#true} {565#true} #55#return; {565#true} is VALID [2022-04-15 15:32:16,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {565#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {565#true} is VALID [2022-04-15 15:32:16,045 INFO L272 TraceCheckUtils]: 12: Hoare triple {565#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {565#true} is VALID [2022-04-15 15:32:16,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-15 15:32:16,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-15 15:32:16,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-15 15:32:16,046 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {565#true} {565#true} #57#return; {565#true} is VALID [2022-04-15 15:32:16,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {565#true} is VALID [2022-04-15 15:32:16,046 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {565#true} is VALID [2022-04-15 15:32:16,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#true} ~cond := #in~cond; {627#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:32:16,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {627#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:32:16,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:32:16,050 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {631#(not (= |assume_abort_if_not_#in~cond| 0))} {565#true} #59#return; {565#true} is VALID [2022-04-15 15:32:16,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:16,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:16,051 INFO L272 TraceCheckUtils]: 25: Hoare triple {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {565#true} is VALID [2022-04-15 15:32:16,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {565#true} ~cond := #in~cond; {651#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:32:16,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {651#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {655#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:32:16,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {655#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {655#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:32:16,055 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {655#(not (= |__VERIFIER_assert_#in~cond| 0))} {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #61#return; {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:16,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {665#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:16,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {665#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {665#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:16,059 INFO L272 TraceCheckUtils]: 32: Hoare triple {665#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:32:16,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:32:16,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {566#false} is VALID [2022-04-15 15:32:16,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-15 15:32:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 15:32:16,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:32:25,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-15 15:32:25,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {566#false} is VALID [2022-04-15 15:32:25,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:32:25,289 INFO L272 TraceCheckUtils]: 32: Hoare triple {692#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:32:25,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {692#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {692#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 15:32:25,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {699#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {692#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 15:32:25,345 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {655#(not (= |__VERIFIER_assert_#in~cond| 0))} {565#true} #61#return; {699#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-15 15:32:25,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {655#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {655#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:32:25,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {655#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:32:25,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {565#true} ~cond := #in~cond; {712#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:32:25,348 INFO L272 TraceCheckUtils]: 25: Hoare triple {565#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {565#true} is VALID [2022-04-15 15:32:25,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {565#true} assume !false; {565#true} is VALID [2022-04-15 15:32:25,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {565#true} is VALID [2022-04-15 15:32:25,348 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {565#true} {565#true} #59#return; {565#true} is VALID [2022-04-15 15:32:25,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-15 15:32:25,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-15 15:32:25,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-15 15:32:25,349 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {565#true} is VALID [2022-04-15 15:32:25,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {565#true} is VALID [2022-04-15 15:32:25,349 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {565#true} {565#true} #57#return; {565#true} is VALID [2022-04-15 15:32:25,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-15 15:32:25,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-15 15:32:25,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-15 15:32:25,350 INFO L272 TraceCheckUtils]: 12: Hoare triple {565#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {565#true} is VALID [2022-04-15 15:32:25,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {565#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {565#true} is VALID [2022-04-15 15:32:25,350 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {565#true} {565#true} #55#return; {565#true} is VALID [2022-04-15 15:32:25,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-15 15:32:25,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-15 15:32:25,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-15 15:32:25,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {565#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {565#true} is VALID [2022-04-15 15:32:25,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {565#true} is VALID [2022-04-15 15:32:25,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret7 := main(); {565#true} is VALID [2022-04-15 15:32:25,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #65#return; {565#true} is VALID [2022-04-15 15:32:25,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-15 15:32:25,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {565#true} is VALID [2022-04-15 15:32:25,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2022-04-15 15:32:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 15:32:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:32:25,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662852295] [2022-04-15 15:32:25,353 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:32:25,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567838918] [2022-04-15 15:32:25,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567838918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:32:25,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:32:25,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-15 15:32:25,353 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:32:25,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1724928804] [2022-04-15 15:32:25,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1724928804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:32:25,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:32:25,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:32:25,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008327512] [2022-04-15 15:32:25,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:32:25,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 15:32:25,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:32:25,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:32:25,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:32:25,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:32:25,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:32:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:32:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-15 15:32:25,430 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:32:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:32:26,638 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-15 15:32:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 15:32:26,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 15:32:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:32:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:32:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-15 15:32:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:32:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-15 15:32:26,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-15 15:32:26,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:32:26,769 INFO L225 Difference]: With dead ends: 43 [2022-04-15 15:32:26,769 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 15:32:26,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:32:26,771 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 15:32:26,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 15:32:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 15:32:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 15:32:26,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:32:26,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 15:32:26,790 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 15:32:26,790 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 15:32:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:32:26,792 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-15 15:32:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-15 15:32:26,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:32:26,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:32:26,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-15 15:32:26,794 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-15 15:32:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:32:26,796 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-15 15:32:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-15 15:32:26,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:32:26,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:32:26,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:32:26,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:32:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 15:32:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-15 15:32:26,799 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-04-15 15:32:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:32:26,800 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-15 15:32:26,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:32:26,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-15 15:32:26,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:32:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-15 15:32:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 15:32:26,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:32:26,890 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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-15 15:32:26,911 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-15 15:32:27,103 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-15 15:32:27,104 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:32:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:32:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1540046462, now seen corresponding path program 3 times [2022-04-15 15:32:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:32:27,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [126894377] [2022-04-15 15:32:27,105 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:32:27,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1540046462, now seen corresponding path program 4 times [2022-04-15 15:32:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:32:27,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763156923] [2022-04-15 15:32:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:32:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:32:27,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:32:27,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751153477] [2022-04-15 15:32:27,132 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:32:27,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:32:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:32:27,152 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-15 15:32:27,176 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-15 15:32:27,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:32:27,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:32:27,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 15:32:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:32:27,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:32:28,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {1045#true} call ULTIMATE.init(); {1045#true} is VALID [2022-04-15 15:32:28,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1045#true} is VALID [2022-04-15 15:32:28,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-15 15:32:28,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1045#true} {1045#true} #65#return; {1045#true} is VALID [2022-04-15 15:32:28,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {1045#true} call #t~ret7 := main(); {1045#true} is VALID [2022-04-15 15:32:28,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {1045#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {1045#true} is VALID [2022-04-15 15:32:28,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {1045#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {1045#true} is VALID [2022-04-15 15:32:28,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {1045#true} ~cond := #in~cond; {1071#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:32:28,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1075#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:32:28,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {1075#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1075#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:32:28,196 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1075#(not (= |assume_abort_if_not_#in~cond| 0))} {1045#true} #55#return; {1082#(and (<= main_~z~0 5) (<= 0 main_~z~0))} is VALID [2022-04-15 15:32:28,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {1082#(and (<= main_~z~0 5) (<= 0 main_~z~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {1082#(and (<= main_~z~0 5) (<= 0 main_~z~0))} is VALID [2022-04-15 15:32:28,197 INFO L272 TraceCheckUtils]: 12: Hoare triple {1082#(and (<= main_~z~0 5) (<= 0 main_~z~0))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1045#true} is VALID [2022-04-15 15:32:28,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#true} ~cond := #in~cond; {1071#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:32:28,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1075#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:32:28,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1075#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:32:28,199 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1075#(not (= |assume_abort_if_not_#in~cond| 0))} {1082#(and (<= main_~z~0 5) (<= 0 main_~z~0))} #57#return; {1101#(and (<= main_~z~0 5) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5))} is VALID [2022-04-15 15:32:28,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {1101#(and (<= main_~z~0 5) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {1101#(and (<= main_~z~0 5) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5))} is VALID [2022-04-15 15:32:28,200 INFO L272 TraceCheckUtils]: 18: Hoare triple {1101#(and (<= main_~z~0 5) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5))} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1045#true} is VALID [2022-04-15 15:32:28,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-15 15:32:28,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-15 15:32:28,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-15 15:32:28,201 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1045#true} {1101#(and (<= main_~z~0 5) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5))} #59#return; {1101#(and (<= main_~z~0 5) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5))} is VALID [2022-04-15 15:32:28,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {1101#(and (<= main_~z~0 5) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5))} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1123#(and (<= main_~z~0 5) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:28,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {1123#(and (<= main_~z~0 5) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {1123#(and (<= main_~z~0 5) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:28,208 INFO L272 TraceCheckUtils]: 25: Hoare triple {1123#(and (<= main_~z~0 5) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1045#true} is VALID [2022-04-15 15:32:28,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {1045#true} ~cond := #in~cond; {1133#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:32:28,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {1133#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:32:28,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:32:28,210 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} {1123#(and (<= main_~z~0 5) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #61#return; {1123#(and (<= main_~z~0 5) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:28,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {1123#(and (<= main_~z~0 5) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1147#(and (<= main_~z~0 5) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:28,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {1147#(and (<= main_~z~0 5) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {1147#(and (<= main_~z~0 5) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:28,211 INFO L272 TraceCheckUtils]: 32: Hoare triple {1147#(and (<= main_~z~0 5) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1045#true} is VALID [2022-04-15 15:32:28,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {1045#true} ~cond := #in~cond; {1133#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:32:28,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {1133#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:32:28,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:32:28,214 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} {1147#(and (<= main_~z~0 5) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} #61#return; {1147#(and (<= main_~z~0 5) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:28,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {1147#(and (<= main_~z~0 5) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1169#(and (<= main_~z~0 5) (= main_~x~0 (+ (* main_~z~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) main_~a~0)) (<= 0 main_~a~0) (= (* main_~z~0 main_~z~0) main_~y~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:28,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {1169#(and (<= main_~z~0 5) (= main_~x~0 (+ (* main_~z~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) main_~a~0)) (<= 0 main_~a~0) (= (* main_~z~0 main_~z~0) main_~y~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {1169#(and (<= main_~z~0 5) (= main_~x~0 (+ (* main_~z~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) main_~a~0)) (<= 0 main_~a~0) (= (* main_~z~0 main_~z~0) main_~y~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:32:28,219 INFO L272 TraceCheckUtils]: 39: Hoare triple {1169#(and (<= main_~z~0 5) (= main_~x~0 (+ (* main_~z~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) main_~a~0)) (<= 0 main_~a~0) (= (* main_~z~0 main_~z~0) main_~y~0) (<= 0 main_~z~0) (<= main_~a~0 5) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:32:28,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1180#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:32:28,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {1180#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1046#false} is VALID [2022-04-15 15:32:28,220 INFO L290 TraceCheckUtils]: 42: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2022-04-15 15:32:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 15:32:28,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:33:01,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2022-04-15 15:33:01,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {1180#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1046#false} is VALID [2022-04-15 15:33:01,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1180#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:33:01,552 INFO L272 TraceCheckUtils]: 39: Hoare triple {1196#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:33:01,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {1196#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {1196#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 15:33:01,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1196#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 15:33:01,618 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} {1045#true} #61#return; {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-15 15:33:01,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:33:01,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {1216#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:33:01,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {1045#true} ~cond := #in~cond; {1216#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:33:01,620 INFO L272 TraceCheckUtils]: 32: Hoare triple {1045#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1045#true} is VALID [2022-04-15 15:33:01,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {1045#true} assume !false; {1045#true} is VALID [2022-04-15 15:33:01,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {1045#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1045#true} is VALID [2022-04-15 15:33:01,620 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1045#true} {1045#true} #61#return; {1045#true} is VALID [2022-04-15 15:33:01,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-15 15:33:01,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-15 15:33:01,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-15 15:33:01,621 INFO L272 TraceCheckUtils]: 25: Hoare triple {1045#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1045#true} is VALID [2022-04-15 15:33:01,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {1045#true} assume !false; {1045#true} is VALID [2022-04-15 15:33:01,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {1045#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1045#true} is VALID [2022-04-15 15:33:01,621 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1045#true} {1045#true} #59#return; {1045#true} is VALID [2022-04-15 15:33:01,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-15 15:33:01,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-15 15:33:01,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-15 15:33:01,622 INFO L272 TraceCheckUtils]: 18: Hoare triple {1045#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1045#true} is VALID [2022-04-15 15:33:01,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {1045#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {1045#true} is VALID [2022-04-15 15:33:01,622 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1045#true} {1045#true} #57#return; {1045#true} is VALID [2022-04-15 15:33:01,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-15 15:33:01,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-15 15:33:01,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-15 15:33:01,623 INFO L272 TraceCheckUtils]: 12: Hoare triple {1045#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1045#true} is VALID [2022-04-15 15:33:01,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {1045#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {1045#true} is VALID [2022-04-15 15:33:01,623 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1045#true} {1045#true} #55#return; {1045#true} is VALID [2022-04-15 15:33:01,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-15 15:33:01,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-15 15:33:01,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-15 15:33:01,623 INFO L272 TraceCheckUtils]: 6: Hoare triple {1045#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {1045#true} is VALID [2022-04-15 15:33:01,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {1045#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {1045#true} is VALID [2022-04-15 15:33:01,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {1045#true} call #t~ret7 := main(); {1045#true} is VALID [2022-04-15 15:33:01,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1045#true} {1045#true} #65#return; {1045#true} is VALID [2022-04-15 15:33:01,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-15 15:33:01,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1045#true} is VALID [2022-04-15 15:33:01,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {1045#true} call ULTIMATE.init(); {1045#true} is VALID [2022-04-15 15:33:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 15:33:01,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:33:01,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763156923] [2022-04-15 15:33:01,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:33:01,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751153477] [2022-04-15 15:33:01,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751153477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:33:01,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:33:01,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-15 15:33:01,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:33:01,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [126894377] [2022-04-15 15:33:01,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [126894377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:33:01,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:33:01,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:33:01,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683441641] [2022-04-15 15:33:01,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:33:01,627 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-04-15 15:33:01,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:33:01,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:33:01,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:33:01,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:33:01,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:33:01,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:33:01,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:33:01,670 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:33:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:33:02,395 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 15:33:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 15:33:02,396 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-04-15 15:33:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:33:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:33:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2022-04-15 15:33:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:33:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2022-04-15 15:33:02,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 48 transitions. [2022-04-15 15:33:02,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:33:02,456 INFO L225 Difference]: With dead ends: 50 [2022-04-15 15:33:02,456 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 15:33:02,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-15 15:33:02,458 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:33:02,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 159 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:33:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 15:33:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 15:33:02,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:33:02,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:33:02,528 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:33:02,529 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:33:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:33:02,535 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 15:33:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 15:33:02,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:33:02,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:33:02,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-15 15:33:02,537 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-15 15:33:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:33:02,542 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 15:33:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 15:33:02,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:33:02,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:33:02,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:33:02,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:33:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:33:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 15:33:02,545 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 43 [2022-04-15 15:33:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:33:02,545 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 15:33:02,546 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:33:02,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 15:33:02,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:33:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 15:33:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 15:33:02,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:33:02,615 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:33:02,633 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-15 15:33:02,815 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-15 15:33:02,815 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:33:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:33:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1099019754, now seen corresponding path program 5 times [2022-04-15 15:33:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:33:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032517721] [2022-04-15 15:33:02,816 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:33:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1099019754, now seen corresponding path program 6 times [2022-04-15 15:33:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:33:02,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566533874] [2022-04-15 15:33:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:33:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:33:02,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:33:02,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643463350] [2022-04-15 15:33:02,836 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:33:02,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:33:02,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:33:02,837 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-15 15:33:02,838 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-15 15:33:03,836 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 15:33:03,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:33:03,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 15:33:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:33:03,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:33:13,288 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 15:33:16,765 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 15:33:23,527 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 15:34:19,339 WARN L232 SmtUtils]: Spent 43.56s on a formula simplification. DAG size of input: 46 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 15:34:31,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {1612#true} call ULTIMATE.init(); {1612#true} is VALID [2022-04-15 15:34:31,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1612#true} is VALID [2022-04-15 15:34:31,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:34:31,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1612#true} #65#return; {1612#true} is VALID [2022-04-15 15:34:31,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {1612#true} call #t~ret7 := main(); {1612#true} is VALID [2022-04-15 15:34:31,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {1612#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {1612#true} is VALID [2022-04-15 15:34:31,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {1612#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:34:31,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-15 15:34:31,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-15 15:34:31,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:34:31,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1612#true} {1612#true} #55#return; {1612#true} is VALID [2022-04-15 15:34:31,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {1612#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {1612#true} is VALID [2022-04-15 15:34:31,651 INFO L272 TraceCheckUtils]: 12: Hoare triple {1612#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:34:31,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-15 15:34:31,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-15 15:34:31,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:34:31,651 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1612#true} {1612#true} #57#return; {1612#true} is VALID [2022-04-15 15:34:31,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {1612#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {1612#true} is VALID [2022-04-15 15:34:31,652 INFO L272 TraceCheckUtils]: 18: Hoare triple {1612#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:34:31,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-15 15:34:31,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-15 15:34:31,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:34:31,652 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1612#true} {1612#true} #59#return; {1612#true} is VALID [2022-04-15 15:34:31,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {1612#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:34:31,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:34:31,654 INFO L272 TraceCheckUtils]: 25: Hoare triple {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:34:31,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-15 15:34:31,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-15 15:34:31,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:34:31,655 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1612#true} {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #61#return; {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:34:31,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} is VALID [2022-04-15 15:34:31,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} assume !false; {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} is VALID [2022-04-15 15:34:31,656 INFO L272 TraceCheckUtils]: 32: Hoare triple {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:34:31,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-15 15:34:31,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-15 15:34:31,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:34:31,657 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1612#true} {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} #61#return; {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} is VALID [2022-04-15 15:34:31,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} is VALID [2022-04-15 15:34:31,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} assume !false; {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} is VALID [2022-04-15 15:34:31,658 INFO L272 TraceCheckUtils]: 39: Hoare triple {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:34:31,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {1612#true} ~cond := #in~cond; {1739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:34:31,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {1739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:34:31,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:34:31,660 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} #61#return; {1750#(and (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:34:33,662 WARN L290 TraceCheckUtils]: 44: Hoare triple {1750#(and (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1754#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))) (= main_~az~0 0)) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (* main_~a~0 main_~z~0) main_~az~0))} is UNKNOWN [2022-04-15 15:34:33,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {1754#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))) (= main_~az~0 0)) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {1754#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))) (= main_~az~0 0)) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 15:34:33,680 INFO L272 TraceCheckUtils]: 46: Hoare triple {1754#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))) (= main_~az~0 0)) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:34:33,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:34:33,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {1765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1613#false} is VALID [2022-04-15 15:34:33,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {1613#false} assume !false; {1613#false} is VALID [2022-04-15 15:34:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 15:34:33,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:35:06,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {1613#false} assume !false; {1613#false} is VALID [2022-04-15 15:35:06,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {1765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1613#false} is VALID [2022-04-15 15:35:06,577 INFO L290 TraceCheckUtils]: 47: Hoare triple {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:35:06,577 INFO L272 TraceCheckUtils]: 46: Hoare triple {1781#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:35:06,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {1781#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {1781#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 15:35:06,595 INFO L290 TraceCheckUtils]: 44: Hoare triple {1788#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1781#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 15:35:06,598 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} {1612#true} #61#return; {1788#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-15 15:35:06,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:35:06,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {1801#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:35:06,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {1612#true} ~cond := #in~cond; {1801#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:35:06,599 INFO L272 TraceCheckUtils]: 39: Hoare triple {1612#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:35:06,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {1612#true} assume !false; {1612#true} is VALID [2022-04-15 15:35:06,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {1612#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1612#true} is VALID [2022-04-15 15:35:06,600 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1612#true} {1612#true} #61#return; {1612#true} is VALID [2022-04-15 15:35:06,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:35:06,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-15 15:35:06,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-15 15:35:06,600 INFO L272 TraceCheckUtils]: 32: Hoare triple {1612#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:35:06,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {1612#true} assume !false; {1612#true} is VALID [2022-04-15 15:35:06,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {1612#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1612#true} is VALID [2022-04-15 15:35:06,600 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1612#true} {1612#true} #61#return; {1612#true} is VALID [2022-04-15 15:35:06,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:35:06,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-15 15:35:06,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-15 15:35:06,601 INFO L272 TraceCheckUtils]: 25: Hoare triple {1612#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:35:06,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {1612#true} assume !false; {1612#true} is VALID [2022-04-15 15:35:06,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {1612#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1612#true} is VALID [2022-04-15 15:35:06,601 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1612#true} {1612#true} #59#return; {1612#true} is VALID [2022-04-15 15:35:06,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:35:06,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-15 15:35:06,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-15 15:35:06,602 INFO L272 TraceCheckUtils]: 18: Hoare triple {1612#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:35:06,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {1612#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {1612#true} is VALID [2022-04-15 15:35:06,602 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1612#true} {1612#true} #57#return; {1612#true} is VALID [2022-04-15 15:35:06,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:35:06,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-15 15:35:06,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-15 15:35:06,602 INFO L272 TraceCheckUtils]: 12: Hoare triple {1612#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:35:06,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {1612#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {1612#true} is VALID [2022-04-15 15:35:06,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1612#true} {1612#true} #55#return; {1612#true} is VALID [2022-04-15 15:35:06,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:35:06,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-15 15:35:06,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-15 15:35:06,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {1612#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {1612#true} is VALID [2022-04-15 15:35:06,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {1612#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {1612#true} is VALID [2022-04-15 15:35:06,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {1612#true} call #t~ret7 := main(); {1612#true} is VALID [2022-04-15 15:35:06,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1612#true} #65#return; {1612#true} is VALID [2022-04-15 15:35:06,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-15 15:35:06,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1612#true} is VALID [2022-04-15 15:35:06,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {1612#true} call ULTIMATE.init(); {1612#true} is VALID [2022-04-15 15:35:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 15:35:06,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:35:06,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566533874] [2022-04-15 15:35:06,605 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:35:06,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643463350] [2022-04-15 15:35:06,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643463350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:35:06,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:35:06,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-15 15:35:06,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:35:06,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032517721] [2022-04-15 15:35:06,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032517721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:35:06,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:35:06,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:35:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666532884] [2022-04-15 15:35:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:35:06,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2022-04-15 15:35:06,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:35:06,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 15:35:08,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:35:08,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:35:08,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:35:08,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:35:08,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-15 15:35:08,679 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 15:35:12,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:35:14,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:35:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:35:15,386 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 15:35:15,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 15:35:15,387 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2022-04-15 15:35:15,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:35:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 15:35:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 15:35:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 15:35:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 15:35:15,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-15 15:35:19,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 31 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:35:19,489 INFO L225 Difference]: With dead ends: 47 [2022-04-15 15:35:19,489 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 15:35:19,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:35:19,490 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 15:35:19,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 15:35:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 15:35:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 15:35:19,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:35:19,491 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-15 15:35:19,491 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-15 15:35:19,492 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-15 15:35:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:35:19,492 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 15:35:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 15:35:19,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:35:19,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:35:19,492 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-15 15:35:19,492 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-15 15:35:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:35:19,492 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 15:35:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 15:35:19,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:35:19,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:35:19,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:35:19,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:35:19,493 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-15 15:35:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 15:35:19,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2022-04-15 15:35:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:35:19,493 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 15:35:19,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 15:35:19,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 15:35:19,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:35:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 15:35:19,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:35:19,496 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 15:35:19,507 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-15 15:35:19,702 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-15 15:35:19,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 15:35:49,289 WARN L232 SmtUtils]: Spent 29.55s on a formula simplification. DAG size of input: 58 DAG size of output: 48 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 15:36:25,090 WARN L232 SmtUtils]: Spent 35.79s on a formula simplification. DAG size of input: 58 DAG size of output: 48 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 15:37:12,371 WARN L232 SmtUtils]: Spent 47.27s on a formula simplification. DAG size of input: 58 DAG size of output: 49 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 15:37:44,586 WARN L232 SmtUtils]: Spent 32.18s on a formula simplification. DAG size of input: 58 DAG size of output: 48 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 15:37:44,640 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-15 15:37:44,640 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-15 15:37:44,641 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-15 15:37:44,641 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-15 15:37:44,641 INFO L878 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-15 15:37:44,641 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 15:37:44,641 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 15:37:44,641 INFO L878 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (<= main_~z~0 5) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5)) [2022-04-15 15:37:44,641 INFO L878 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= main_~z~0 5) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5)) [2022-04-15 15:37:44,641 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~z~0 5) (<= 0 main_~z~0)) [2022-04-15 15:37:44,641 INFO L878 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~z~0 5) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 5)) [2022-04-15 15:37:44,641 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-15 15:37:44,641 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 21 48) the Hoare annotation is: true [2022-04-15 15:37:44,641 INFO L878 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (<= main_~z~0 5) (<= 0 main_~z~0)) [2022-04-15 15:37:44,641 INFO L885 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-15 15:37:44,641 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 21 48) the Hoare annotation is: true [2022-04-15 15:37:44,642 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 45) the Hoare annotation is: (let ((.cse0 (<= main_~z~0 5)) (.cse8 (<= 0 main_~a~0)) (.cse9 (<= 0 main_~z~0)) (.cse10 (<= main_~a~0 5)) (.cse7 (= main_~a~0 main_~x~0)) (.cse11 (= (* main_~a~0 main_~z~0) main_~az~0))) (or (and .cse0 (let ((.cse6 (= main_~z~0 0))) (or (let ((.cse1 (+ (* (- 1) main_~a~0) main_~x~0))) (and (= 0 (mod .cse1 main_~z~0)) (let ((.cse2 (div .cse1 main_~z~0))) (let ((.cse4 (= main_~az~0 0)) (.cse3 (* .cse2 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse2 (+ main_~a~0 .cse3)) .cse4) (let ((.cse5 (+ (* (- 1) .cse2) main_~a~0 .cse3))) (and (= (mod .cse5 main_~az~0) 0) (not .cse4) (= (* (div .cse5 main_~az~0) main_~z~0) main_~y~0)))))) (not .cse6))) (and .cse6 (= main_~y~0 0) .cse7))) .cse8 .cse9 .cse10 .cse11) (and .cse0 (= main_~y~0 1) .cse8 .cse9 .cse10 .cse7 .cse11))) [2022-04-15 15:37:44,642 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 45) the Hoare annotation is: (let ((.cse6 (* main_~a~0 main_~z~0))) (let ((.cse5 (= .cse6 main_~az~0))) (or (let ((.cse0 (+ (* (- 1) main_~a~0) main_~x~0))) (and (<= main_~z~0 5) (= 0 (mod .cse0 main_~z~0)) (<= 0 main_~a~0) (let ((.cse1 (div .cse0 main_~z~0))) (let ((.cse3 (= main_~az~0 0)) (.cse2 (* .cse1 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse1 (+ main_~a~0 .cse2)) .cse3) (let ((.cse4 (+ (* (- 1) .cse1) main_~a~0 .cse2))) (and (= (mod .cse4 main_~az~0) 0) (not .cse3) (= (* (div .cse4 main_~az~0) main_~z~0) main_~y~0)))))) (not (= main_~z~0 0)) (<= 0 main_~z~0) (<= main_~a~0 5) .cse5)) (and (= main_~y~0 1) (= main_~a~0 main_~x~0) .cse5) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse6 main_~a~0)) .cse5)))) [2022-04-15 15:37:44,642 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 21 48) the Hoare annotation is: true [2022-04-15 15:37:44,642 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (<= main_~z~0 5)) (.cse8 (<= 0 main_~a~0)) (.cse9 (<= 0 main_~z~0)) (.cse10 (<= main_~a~0 5)) (.cse7 (= main_~a~0 main_~x~0)) (.cse11 (= (* main_~a~0 main_~z~0) main_~az~0))) (or (and .cse0 (let ((.cse6 (= main_~z~0 0))) (or (let ((.cse1 (+ (* (- 1) main_~a~0) main_~x~0))) (and (= 0 (mod .cse1 main_~z~0)) (let ((.cse2 (div .cse1 main_~z~0))) (let ((.cse4 (= main_~az~0 0)) (.cse3 (* .cse2 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse2 (+ main_~a~0 .cse3)) .cse4) (let ((.cse5 (+ (* (- 1) .cse2) main_~a~0 .cse3))) (and (= (mod .cse5 main_~az~0) 0) (not .cse4) (= (* (div .cse5 main_~az~0) main_~z~0) main_~y~0)))))) (not .cse6))) (and .cse6 (= main_~y~0 0) .cse7))) .cse8 .cse9 .cse10 .cse11) (and .cse0 (= main_~y~0 1) .cse8 .cse9 .cse10 .cse7 .cse11))) [2022-04-15 15:37:44,642 INFO L878 garLoopResultBuilder]: At program point L37-1(lines 36 45) the Hoare annotation is: (let ((.cse0 (<= main_~z~0 5)) (.cse8 (<= 0 main_~a~0)) (.cse9 (<= 0 main_~z~0)) (.cse10 (<= main_~a~0 5)) (.cse7 (= main_~a~0 main_~x~0)) (.cse11 (= (* main_~a~0 main_~z~0) main_~az~0))) (or (and .cse0 (let ((.cse6 (= main_~z~0 0))) (or (let ((.cse1 (+ (* (- 1) main_~a~0) main_~x~0))) (and (= 0 (mod .cse1 main_~z~0)) (let ((.cse2 (div .cse1 main_~z~0))) (let ((.cse4 (= main_~az~0 0)) (.cse3 (* .cse2 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse2 (+ main_~a~0 .cse3)) .cse4) (let ((.cse5 (+ (* (- 1) .cse2) main_~a~0 .cse3))) (and (= (mod .cse5 main_~az~0) 0) (not .cse4) (= (* (div .cse5 main_~az~0) main_~z~0) main_~y~0)))))) (not .cse6))) (and .cse6 (= main_~y~0 0) .cse7))) .cse8 .cse9 .cse10 .cse11) (and .cse0 (= main_~y~0 1) .cse8 .cse9 .cse10 .cse7 .cse11))) [2022-04-15 15:37:44,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 15:37:44,642 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 15:37:44,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 15:37:44,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 15:37:44,642 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 15:37:44,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 15:37:44,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 15:37:44,642 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 15:37:44,642 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 15:37:44,643 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 15:37:44,643 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 15:37:44,643 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 15:37:44,643 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 15:37:44,645 INFO L719 BasicCegarLoop]: Path program histogram: [6, 2, 2] [2022-04-15 15:37:44,646 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 15:37:44,650 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 15:37:44,652 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 15:37:46,674 INFO L163 areAnnotationChecker]: CFG has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 15:37:46,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:37:46 BoogieIcfgContainer [2022-04-15 15:37:46,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 15:37:46,685 INFO L158 Benchmark]: Toolchain (without parser) took 333564.32ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 138.8MB in the beginning and 90.0MB in the end (delta: 48.8MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. [2022-04-15 15:37:46,685 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 186.6MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 15:37:46,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.89ms. Allocated memory is still 186.6MB. Free memory was 138.6MB in the beginning and 164.7MB in the end (delta: -26.1MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-15 15:37:46,686 INFO L158 Benchmark]: Boogie Preprocessor took 29.08ms. Allocated memory is still 186.6MB. Free memory was 164.7MB in the beginning and 163.5MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 15:37:46,686 INFO L158 Benchmark]: RCFGBuilder took 326.33ms. Allocated memory is still 186.6MB. Free memory was 163.1MB in the beginning and 151.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 15:37:46,686 INFO L158 Benchmark]: TraceAbstraction took 332959.11ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 151.0MB in the beginning and 90.0MB in the end (delta: 61.0MB). Peak memory consumption was 99.8MB. Max. memory is 8.0GB. [2022-04-15 15:37:46,687 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.21ms. Allocated memory is still 186.6MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.89ms. Allocated memory is still 186.6MB. Free memory was 138.6MB in the beginning and 164.7MB in the end (delta: -26.1MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.08ms. Allocated memory is still 186.6MB. Free memory was 164.7MB in the beginning and 163.5MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 326.33ms. Allocated memory is still 186.6MB. Free memory was 163.1MB in the beginning and 151.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 332959.11ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 151.0MB in the beginning and 90.0MB in the end (delta: 61.0MB). Peak memory consumption was 99.8MB. 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: 17]: 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 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 330.9s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 144.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 573 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 448 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 401 IncrementalHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 125 mSDtfsCounter, 401 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 253 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 44.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=4, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 101 PreInvPairs, 161 NumberOfFragments, 724 HoareAnnotationTreeSize, 101 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 31 FomulaSimplificationsInter, 990 FormulaSimplificationTreeSizeReductionInter, 144.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((z <= 5 && (((0 == (-1 * a + x) % z && (((y % z == 0 && (-1 * a + x) / z == a + (-1 * a + x) / z * z) && az == 0) || (((-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) % az == 0 && !(az == 0)) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az * z == y))) && !(z == 0)) || ((z == 0 && y == 0) && a == x))) && 0 <= a) && 0 <= z) && a <= 5) && a * z == az) || ((((((z <= 5 && y == 1) && 0 <= a) && 0 <= z) && a <= 5) && a == x) && a * z == az) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-15 15:37:46,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...