/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/cohencu-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:18:50,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:18:50,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:18:50,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:18:50,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:18:50,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:18:50,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:18:50,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:18:50,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:18:50,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:18:50,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:18:50,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:18:50,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:18:50,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:18:50,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:18:50,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:18:50,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:18:50,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:18:50,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:18:50,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:18:50,698 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:18:50,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:18:50,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:18:50,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:18:50,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:18:50,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:18:50,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:18:50,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:18:50,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:18:50,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:18:50,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:18:50,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:18:50,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:18:50,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:18:50,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:18:50,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:18:50,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:18:50,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:18:50,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:18:50,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:18:50,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:18:50,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:18:50,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:18:50,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:18:50,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:18:50,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:18:50,720 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:18:50,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:18:50,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:18:50,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:18:50,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:18:50,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:18:50,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:18:50,721 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:18:50,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:18:50,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:18:50,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:18:50,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:18:50,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:18:50,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:18:50,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:18:50,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:18:50,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:18:50,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:18:50,722 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:18:50,722 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:18:50,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:18:50,723 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:18:50,723 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-08 04:18:50,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:18:50,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:18:50,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:18:50,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:18:50,926 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:18:50,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohencu-ll.c [2022-04-08 04:18:50,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be847de08/63aca0187c764ac2bff90008554dc861/FLAG1204dc21f [2022-04-08 04:18:51,272 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:18:51,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohencu-ll.c [2022-04-08 04:18:51,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be847de08/63aca0187c764ac2bff90008554dc861/FLAG1204dc21f [2022-04-08 04:18:51,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be847de08/63aca0187c764ac2bff90008554dc861 [2022-04-08 04:18:51,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:18:51,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:18:51,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:18:51,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:18:51,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:18:51,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:18:51" (1/1) ... [2022-04-08 04:18:51,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7081bec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51, skipping insertion in model container [2022-04-08 04:18:51,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:18:51" (1/1) ... [2022-04-08 04:18:51,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:18:51,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:18:51,858 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/cohencu-ll.c[588,601] [2022-04-08 04:18:51,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:18:51,881 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:18:51,891 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/cohencu-ll.c[588,601] [2022-04-08 04:18:51,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:18:51,911 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:18:51,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51 WrapperNode [2022-04-08 04:18:51,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:18:51,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:18:51,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:18:51,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:18:51,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51" (1/1) ... [2022-04-08 04:18:51,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51" (1/1) ... [2022-04-08 04:18:51,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51" (1/1) ... [2022-04-08 04:18:51,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51" (1/1) ... [2022-04-08 04:18:51,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51" (1/1) ... [2022-04-08 04:18:51,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51" (1/1) ... [2022-04-08 04:18:51,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51" (1/1) ... [2022-04-08 04:18:51,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:18:51,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:18:51,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:18:51,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:18:51,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51" (1/1) ... [2022-04-08 04:18:51,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:18:51,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:18:51,968 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-08 04:18:51,991 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-08 04:18:51,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:18:51,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:18:51,999 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:18:52,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:18:52,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:18:52,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:18:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:18:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:18:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:18:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:18:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-08 04:18:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:18:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:18:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:18:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:18:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:18:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:18:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:18:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:18:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:18:52,048 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:18:52,049 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:18:52,176 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:18:52,181 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:18:52,181 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:18:52,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:18:52 BoogieIcfgContainer [2022-04-08 04:18:52,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:18:52,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:18:52,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:18:52,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:18:52,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:18:51" (1/3) ... [2022-04-08 04:18:52,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd0a9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:18:52, skipping insertion in model container [2022-04-08 04:18:52,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:51" (2/3) ... [2022-04-08 04:18:52,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd0a9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:18:52, skipping insertion in model container [2022-04-08 04:18:52,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:18:52" (3/3) ... [2022-04-08 04:18:52,197 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll.c [2022-04-08 04:18:52,200 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:18:52,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:18:52,250 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:18:52,256 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-08 04:18:52,256 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:18:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:18:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:18:52,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:52,274 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:52,274 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:52,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1298655804, now seen corresponding path program 1 times [2022-04-08 04:18:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:52,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57373727] [2022-04-08 04:18:52,290 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:18:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1298655804, now seen corresponding path program 2 times [2022-04-08 04:18:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:52,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363250289] [2022-04-08 04:18:52,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:52,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:18:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:52,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(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(13, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-08 04:18:52,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 04:18:52,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #80#return; {33#true} is VALID [2022-04-08 04:18:52,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:18:52,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#(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(13, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-08 04:18:52,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 04:18:52,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #80#return; {33#true} is VALID [2022-04-08 04:18:52,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret5 := main(); {33#true} is VALID [2022-04-08 04:18:52,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {33#true} is VALID [2022-04-08 04:18:52,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume false; {34#false} is VALID [2022-04-08 04:18:52,459 INFO L272 TraceCheckUtils]: 7: Hoare triple {34#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34#false} is VALID [2022-04-08 04:18:52,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-08 04:18:52,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-08 04:18:52,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 04:18:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:18:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:18:52,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363250289] [2022-04-08 04:18:52,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363250289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:52,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:52,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:18:52,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:18:52,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57373727] [2022-04-08 04:18:52,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57373727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:52,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:52,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:18:52,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563263404] [2022-04-08 04:18:52,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:18:52,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:18:52,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:18:52,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:52,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:52,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:18:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:52,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:18:52,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:18:52,506 INFO L87 Difference]: Start difference. First operand has 30 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:52,669 INFO L93 Difference]: Finished difference Result 54 states and 91 transitions. [2022-04-08 04:18:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:18:52,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:18:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:18:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 04:18:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 04:18:52,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-08 04:18:52,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:52,809 INFO L225 Difference]: With dead ends: 54 [2022-04-08 04:18:52,809 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 04:18:52,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:18:52,813 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:18:52,814 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:18:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 04:18:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 04:18:52,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:18:52,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:18:52,835 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:18:52,835 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:18:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:52,839 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-04-08 04:18:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-08 04:18:52,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:52,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:52,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 25 states. [2022-04-08 04:18:52,853 INFO L87 Difference]: Start difference. First operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 25 states. [2022-04-08 04:18:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:52,856 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-04-08 04:18:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-08 04:18:52,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:52,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:52,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:18:52,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:18:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:18:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-04-08 04:18:52,862 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 11 [2022-04-08 04:18:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:18:52,863 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-04-08 04:18:52,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:52,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 35 transitions. [2022-04-08 04:18:52,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-08 04:18:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:18:52,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:52,902 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:52,902 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:18:52,903 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:52,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:52,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1297106672, now seen corresponding path program 1 times [2022-04-08 04:18:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:52,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1386198548] [2022-04-08 04:18:52,904 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:18:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1297106672, now seen corresponding path program 2 times [2022-04-08 04:18:52,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:52,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092427518] [2022-04-08 04:18:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:52,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:52,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:18:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:53,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#(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(13, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-04-08 04:18:53,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2022-04-08 04:18:53,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #80#return; {249#true} is VALID [2022-04-08 04:18:53,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:18:53,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#(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(13, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-04-08 04:18:53,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} assume true; {249#true} is VALID [2022-04-08 04:18:53,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {249#true} {249#true} #80#return; {249#true} is VALID [2022-04-08 04:18:53,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {249#true} call #t~ret5 := main(); {249#true} is VALID [2022-04-08 04:18:53,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-08 04:18:53,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-08 04:18:53,010 INFO L272 TraceCheckUtils]: 7: Hoare triple {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:18:53,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {256#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:18:53,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {250#false} is VALID [2022-04-08 04:18:53,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {250#false} assume !false; {250#false} is VALID [2022-04-08 04:18:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:18:53,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:18:53,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092427518] [2022-04-08 04:18:53,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092427518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:53,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:53,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:18:53,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:18:53,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1386198548] [2022-04-08 04:18:53,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1386198548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:53,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:53,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:18:53,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955168416] [2022-04-08 04:18:53,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:18:53,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:18:53,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:18:53,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:53,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:53,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:18:53,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:53,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:18:53,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:18:53,029 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:53,417 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-08 04:18:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:18:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:18:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:18:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-08 04:18:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-08 04:18:53,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-08 04:18:53,469 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-08 04:18:53,471 INFO L225 Difference]: With dead ends: 31 [2022-04-08 04:18:53,471 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 04:18:53,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:18:53,472 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:18:53,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 04:18:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 04:18:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 04:18:53,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:18:53,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:18:53,479 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:18:53,479 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:18:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:53,481 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-08 04:18:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-08 04:18:53,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:53,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:53,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 29 states. [2022-04-08 04:18:53,482 INFO L87 Difference]: Start difference. First operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 29 states. [2022-04-08 04:18:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:53,484 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-08 04:18:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-08 04:18:53,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:53,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:53,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:18:53,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:18:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:18:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-04-08 04:18:53,487 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2022-04-08 04:18:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:18:53,488 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-04-08 04:18:53,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:53,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 38 transitions. [2022-04-08 04:18:53,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-08 04:18:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 04:18:53,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:53,529 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:53,530 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:18:53,530 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:53,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:53,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2099401665, now seen corresponding path program 1 times [2022-04-08 04:18:53,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:53,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1725191119] [2022-04-08 04:18:53,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:18:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2099401665, now seen corresponding path program 2 times [2022-04-08 04:18:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:53,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804340765] [2022-04-08 04:18:53,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:53,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:53,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:18:53,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803564974] [2022-04-08 04:18:53,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:18:53,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:53,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:18:53,549 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-08 04:18:53,550 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-08 04:18:53,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:18:53,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:18:53,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:18:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:53,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:18:53,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {446#true} call ULTIMATE.init(); {446#true} is VALID [2022-04-08 04:18:53,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#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(13, 2);call #Ultimate.allocInit(12, 3); {446#true} is VALID [2022-04-08 04:18:53,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {446#true} assume true; {446#true} is VALID [2022-04-08 04:18:53,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {446#true} {446#true} #80#return; {446#true} is VALID [2022-04-08 04:18:53,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {446#true} call #t~ret5 := main(); {446#true} is VALID [2022-04-08 04:18:53,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {446#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 04:18:53,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 04:18:53,684 INFO L272 TraceCheckUtils]: 7: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {446#true} is VALID [2022-04-08 04:18:53,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {446#true} ~cond := #in~cond; {446#true} is VALID [2022-04-08 04:18:53,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {446#true} assume !(0 == ~cond); {446#true} is VALID [2022-04-08 04:18:53,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {446#true} assume true; {446#true} is VALID [2022-04-08 04:18:53,685 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {446#true} {466#(and (= main_~n~0 0) (= main_~y~0 1))} #58#return; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 04:18:53,686 INFO L272 TraceCheckUtils]: 12: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:18:53,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:53,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {447#false} is VALID [2022-04-08 04:18:53,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {447#false} assume !false; {447#false} is VALID [2022-04-08 04:18:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:18:53,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:18:53,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:18:53,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804340765] [2022-04-08 04:18:53,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:18:53,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803564974] [2022-04-08 04:18:53,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803564974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:53,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:53,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:18:53,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:18:53,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1725191119] [2022-04-08 04:18:53,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1725191119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:53,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:53,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:18:53,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706488156] [2022-04-08 04:18:53,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:18:53,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-08 04:18:53,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:18:53,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:53,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:53,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:18:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:18:53,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:18:53,704 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:53,897 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-08 04:18:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:18:53,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-08 04:18:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:18:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 04:18:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 04:18:53,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 04:18:53,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:53,955 INFO L225 Difference]: With dead ends: 48 [2022-04-08 04:18:53,955 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 04:18:53,956 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-08 04:18:53,956 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:18:53,957 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 125 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:18:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 04:18:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-04-08 04:18:53,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:18:53,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:18:53,968 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:18:53,968 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:18:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:53,971 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-04-08 04:18:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-04-08 04:18:53,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:53,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:53,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 46 states. [2022-04-08 04:18:53,973 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 46 states. [2022-04-08 04:18:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:53,975 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-04-08 04:18:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-04-08 04:18:53,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:53,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:53,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:18:53,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:18:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:18:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-04-08 04:18:53,978 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 16 [2022-04-08 04:18:53,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:18:53,978 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-04-08 04:18:53,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:53,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 46 transitions. [2022-04-08 04:18:54,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-08 04:18:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 04:18:54,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:54,023 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:54,042 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-08 04:18:54,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:54,240 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:54,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1061128656, now seen corresponding path program 1 times [2022-04-08 04:18:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:54,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1343165459] [2022-04-08 04:18:54,241 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:18:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1061128656, now seen corresponding path program 2 times [2022-04-08 04:18:54,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:54,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783932965] [2022-04-08 04:18:54,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:54,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:18:54,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320175079] [2022-04-08 04:18:54,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:18:54,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:54,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:18:54,251 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-08 04:18:54,252 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-08 04:18:54,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:18:54,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:18:54,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:18:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:54,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:18:54,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2022-04-08 04:18:54,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#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(13, 2);call #Ultimate.allocInit(12, 3); {760#true} is VALID [2022-04-08 04:18:54,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-08 04:18:54,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #80#return; {760#true} is VALID [2022-04-08 04:18:54,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret5 := main(); {760#true} is VALID [2022-04-08 04:18:54,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 04:18:54,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 04:18:54,366 INFO L272 TraceCheckUtils]: 7: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {760#true} is VALID [2022-04-08 04:18:54,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-08 04:18:54,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-08 04:18:54,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-08 04:18:54,367 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {760#true} {780#(and (= main_~x~0 0) (= main_~n~0 0))} #58#return; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 04:18:54,367 INFO L272 TraceCheckUtils]: 12: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {760#true} is VALID [2022-04-08 04:18:54,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-08 04:18:54,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-08 04:18:54,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-08 04:18:54,368 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {760#true} {780#(and (= main_~x~0 0) (= main_~n~0 0))} #60#return; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 04:18:54,369 INFO L272 TraceCheckUtils]: 17: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:18:54,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:54,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {761#false} is VALID [2022-04-08 04:18:54,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-04-08 04:18:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 04:18:54,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:18:54,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:18:54,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783932965] [2022-04-08 04:18:54,370 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:18:54,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320175079] [2022-04-08 04:18:54,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320175079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:54,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:54,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:18:54,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:18:54,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1343165459] [2022-04-08 04:18:54,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1343165459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:54,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:54,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:18:54,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598900727] [2022-04-08 04:18:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:18:54,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-08 04:18:54,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:18:54,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:18:54,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:54,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:18:54,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:54,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:18:54,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:18:54,384 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:18:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:54,589 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2022-04-08 04:18:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:18:54,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-08 04:18:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:18:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:18:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 04:18:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:18:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 04:18:54,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 04:18:54,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:54,647 INFO L225 Difference]: With dead ends: 52 [2022-04-08 04:18:54,647 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 04:18:54,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-08 04:18:54,648 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:18:54,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 126 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:18:54,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 04:18:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-04-08 04:18:54,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:18:54,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 04:18:54,669 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 04:18:54,669 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 04:18:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:54,674 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-08 04:18:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-08 04:18:54,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:54,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:54,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 50 states. [2022-04-08 04:18:54,675 INFO L87 Difference]: Start difference. First operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 50 states. [2022-04-08 04:18:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:54,678 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-08 04:18:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-08 04:18:54,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:54,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:54,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:18:54,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:18:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 04:18:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-04-08 04:18:54,683 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 21 [2022-04-08 04:18:54,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:18:54,683 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-04-08 04:18:54,683 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:18:54,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 61 transitions. [2022-04-08 04:18:54,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-04-08 04:18:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 04:18:54,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:54,772 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:54,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 04:18:54,988 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,SelfDestructingSolverStorable3 [2022-04-08 04:18:54,988 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2039501471, now seen corresponding path program 1 times [2022-04-08 04:18:54,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:54,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842475657] [2022-04-08 04:18:54,989 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:18:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2039501471, now seen corresponding path program 2 times [2022-04-08 04:18:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:54,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988025171] [2022-04-08 04:18:54,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:54,999 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:18:54,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620015819] [2022-04-08 04:18:54,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:18:55,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:55,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:18:55,000 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-08 04:18:55,001 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-08 04:18:55,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:18:55,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:18:55,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 04:18:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:55,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:18:55,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-08 04:18:55,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#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(13, 2);call #Ultimate.allocInit(12, 3); {1125#true} is VALID [2022-04-08 04:18:55,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-08 04:18:55,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #80#return; {1125#true} is VALID [2022-04-08 04:18:55,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret5 := main(); {1125#true} is VALID [2022-04-08 04:18:55,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {1125#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 04:18:55,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 04:18:55,160 INFO L272 TraceCheckUtils]: 7: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1125#true} is VALID [2022-04-08 04:18:55,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-08 04:18:55,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-08 04:18:55,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-08 04:18:55,161 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #58#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 04:18:55,161 INFO L272 TraceCheckUtils]: 12: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1125#true} is VALID [2022-04-08 04:18:55,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-08 04:18:55,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-08 04:18:55,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-08 04:18:55,162 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #60#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 04:18:55,162 INFO L272 TraceCheckUtils]: 17: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1125#true} is VALID [2022-04-08 04:18:55,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-08 04:18:55,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-08 04:18:55,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-08 04:18:55,163 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 04:18:55,163 INFO L272 TraceCheckUtils]: 22: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:18:55,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {1197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:55,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {1201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-08 04:18:55,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-08 04:18:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 04:18:55,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:18:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:18:55,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988025171] [2022-04-08 04:18:55,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:18:55,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620015819] [2022-04-08 04:18:55,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620015819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:55,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:55,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:18:55,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:18:55,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842475657] [2022-04-08 04:18:55,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842475657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:55,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:55,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:18:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962105046] [2022-04-08 04:18:55,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:18:55,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-04-08 04:18:55,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:18:55,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:18:55,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:55,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:18:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:18:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:18:55,184 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:18:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:55,444 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-04-08 04:18:55,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:18:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-04-08 04:18:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:18:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:18:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 04:18:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:18:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 04:18:55,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 04:18:55,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:55,503 INFO L225 Difference]: With dead ends: 60 [2022-04-08 04:18:55,503 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 04:18:55,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-08 04:18:55,504 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:18:55,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 112 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:18:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 04:18:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-08 04:18:55,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:18:55,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:18:55,520 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:18:55,521 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:18:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:55,522 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-08 04:18:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-08 04:18:55,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:55,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:55,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 48 states. [2022-04-08 04:18:55,523 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 48 states. [2022-04-08 04:18:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:55,525 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-08 04:18:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-08 04:18:55,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:55,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:55,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:18:55,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:18:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:18:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-04-08 04:18:55,527 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 26 [2022-04-08 04:18:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:18:55,527 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-04-08 04:18:55,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:18:55,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 59 transitions. [2022-04-08 04:18:55,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-08 04:18:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 04:18:55,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:55,590 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:55,608 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-08 04:18:55,800 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:55,800 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash 542006608, now seen corresponding path program 1 times [2022-04-08 04:18:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:55,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529047295] [2022-04-08 04:20:08,400 WARN L232 SmtUtils]: Spent 1.20m on a formula simplification. DAG size of input: 192 DAG size of output: 187 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-08 04:20:08,440 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 4=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:20:08,447 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:20:08,451 INFO L85 PathProgramCache]: Analyzing trace with hash 688371743, now seen corresponding path program 1 times [2022-04-08 04:20:08,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:20:08,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403453864] [2022-04-08 04:20:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:20:08,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:20:08,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:20:08,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233885379] [2022-04-08 04:20:08,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:20:08,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:20:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:20:08,477 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-08 04:20:08,477 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-08 04:20:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:20:08,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 04:20:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:20:08,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:20:11,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-08 04:20:11,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#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(13, 2);call #Ultimate.allocInit(12, 3); {1521#true} is VALID [2022-04-08 04:20:11,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-08 04:20:11,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #80#return; {1521#true} is VALID [2022-04-08 04:20:11,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret5 := main(); {1521#true} is VALID [2022-04-08 04:20:11,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1541#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 04:20:11,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {1541#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [84] L32-2-->L33_primed: Formula: (let ((.cse28 (* v_main_~y~0_27 12))) (let ((.cse2 (<= v_main_~n~0_22 v_main_~a~0_10)) (.cse4 (= (+ .cse28 (* v_main_~x~0_21 18) 6) (+ (* v_main_~y~0_27 v_main_~z~0_31) (* v_main_~z~0_31 2)))) (.cse3 (= v_main_~z~0_31 (+ (* v_main_~n~0_22 6) 6))) (.cse0 (= v_main_~x~0_21 v_main_~x~0_20)) (.cse1 (= v_main_~y~0_27 v_main_~y~0_26)) (.cse5 (= v_main_~z~0_31 v_main_~z~0_30)) (.cse6 (* v_main_~z~0_30 11)) (.cse18 (= (+ (* v_main_~z~0_31 v_main_~z~0_31) 12) (+ .cse28 (* v_main_~z~0_31 6)))) (.cse19 (* (- 1) v_main_~z~0_30))) (or (and (= v_main_~n~0_21 v_main_~n~0_22) .cse0 .cse1 (or (not .cse2) (not .cse3) (not (= v_main_~y~0_27 (+ (* v_main_~n~0_22 3) (* 3 (* v_main_~n~0_22 v_main_~n~0_22)) 1))) (not .cse4)) .cse5) (let ((.cse12 (div (+ v_main_~z~0_31 .cse19 6) (- 12)))) (let ((.cse9 (* 2 .cse12)) (.cse10 (* v_main_~z~0_31 .cse12)) (.cse11 (* .cse12 .cse12))) (and .cse2 (= (mod (+ v_main_~z~0_31 .cse6 6) 12) 0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ v_main_~z~0_31 (* (- 1) v_main_~z~0_30) 6) (- 12)))) (not (<= 1 v_itHalf_1)) (let ((.cse8 (* v_main_~y~0_27 v_itHalf_1)) (.cse7 (* v_main_~z~0_31 v_itHalf_1))) (and (<= (+ v_main_~n~0_22 (* v_itHalf_1 2)) v_main_~a~0_10) (= (+ (* (* v_itHalf_1 v_itHalf_1) 12) (* (* v_main_~n~0_22 v_main_~n~0_22 v_itHalf_1) 6) (* (* v_main_~n~0_22 v_itHalf_1 v_itHalf_1) 12) .cse7 (* v_main_~n~0_22 v_main_~n~0_22 v_main_~n~0_22)) (+ v_main_~x~0_21 (* v_itHalf_1 4) (* 2 (* v_main_~z~0_31 v_itHalf_1 v_itHalf_1)) (* .cse8 2))) (= (+ (* (* v_main_~z~0_31 v_main_~z~0_31 v_itHalf_1) 2) (* v_itHalf_1 24) (* v_main_~y~0_27 v_main_~z~0_31) (* v_main_~z~0_31 2)) (+ (* 12 .cse7) (* v_main_~y~0_27 12) (* v_main_~x~0_21 18) 6 (* .cse8 24))) (= (+ v_main_~y~0_27 (* 2 .cse7)) (+ (* v_main_~n~0_22 3) (* 3 (* v_main_~n~0_22 v_main_~n~0_22)) (* v_itHalf_1 12) (* (* v_main_~n~0_22 v_itHalf_1) 12) 1)))))) .cse4 (= v_main_~n~0_21 (+ v_main_~n~0_22 .cse9 1)) (= v_main_~y~0_26 (+ (* .cse10 2) v_main_~y~0_27 v_main_~z~0_31 (* .cse11 12) (* .cse12 6))) (<= 0 .cse12) (= (+ v_main_~x~0_20 .cse9) (+ v_main_~x~0_21 v_main_~y~0_27 .cse10 (* .cse11 4) (* 2 (* v_main_~y~0_27 .cse12)) (* 2 (* v_main_~z~0_31 .cse12 .cse12)) (* 8 (* .cse12 .cse12 .cse12)))) .cse3 (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ v_main_~z~0_31 (* (- 1) v_main_~z~0_30) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (let ((.cse13 (* 3 (* v_main_~n~0_22 v_main_~n~0_22))) (.cse15 (* (* v_main_~n~0_22 v_itHalf_1) 12)) (.cse16 (* v_main_~z~0_31 v_itHalf_1)) (.cse14 (* v_itHalf_1 v_itHalf_1)) (.cse17 (* v_main_~y~0_27 v_itHalf_1))) (and (= (+ (* v_main_~n~0_22 3) .cse13 (* (* v_main_~n~0_22 v_main_~n~0_22 v_itHalf_1) 6) (* (* v_main_~n~0_22 v_itHalf_1 v_itHalf_1) 12) (* .cse14 8) (* v_itHalf_1 8) (* v_main_~n~0_22 v_main_~n~0_22 v_main_~n~0_22) .cse15 1) (+ v_main_~x~0_21 v_main_~y~0_27 (* 2 (* v_main_~z~0_31 v_itHalf_1 v_itHalf_1)) .cse16 (* .cse17 2))) (= (+ .cse13 7 (* v_itHalf_1 12) (* v_main_~n~0_22 9) .cse15) (+ v_main_~y~0_27 v_main_~z~0_31 (* 2 .cse16))) (<= (+ v_main_~n~0_22 (* v_itHalf_1 2) 1) v_main_~a~0_10) (= (+ (* 12 .cse16) (* v_main_~z~0_31 4) (* v_main_~x~0_21 18) (* 72 .cse14) (* v_main_~y~0_27 24) (* .cse17 24)) (+ (* (* v_main_~z~0_31 v_main_~z~0_31 v_itHalf_1) 2) (* v_itHalf_1 24) (* v_main_~z~0_31 v_main_~z~0_31) 6 (* v_main_~y~0_27 v_main_~z~0_31))))))) .cse18))) (and (= v_main_~n~0_22 v_main_~n~0_21) .cse0 .cse1 (= v_main_~a~0_10 v_main_~a~0_10) .cse5) (let ((.cse25 (div (+ v_main_~z~0_31 .cse19) (- 12)))) (let ((.cse26 (* v_main_~z~0_31 .cse25)) (.cse27 (* 12 (* .cse25 .cse25)))) (and (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ v_main_~z~0_31 (* (- 1) v_main_~z~0_30)) (- 12)))) (let ((.cse20 (* 3 (* v_main_~n~0_22 v_main_~n~0_22))) (.cse22 (* (* v_main_~n~0_22 v_itHalf_1) 12)) (.cse23 (* v_main_~z~0_31 v_itHalf_1)) (.cse21 (* v_itHalf_1 v_itHalf_1)) (.cse24 (* v_main_~y~0_27 v_itHalf_1))) (and (= (+ (* v_main_~n~0_22 3) .cse20 (* (* v_main_~n~0_22 v_main_~n~0_22 v_itHalf_1) 6) (* (* v_main_~n~0_22 v_itHalf_1 v_itHalf_1) 12) (* .cse21 8) (* v_itHalf_1 8) (* v_main_~n~0_22 v_main_~n~0_22 v_main_~n~0_22) .cse22 1) (+ v_main_~x~0_21 v_main_~y~0_27 (* 2 (* v_main_~z~0_31 v_itHalf_1 v_itHalf_1)) .cse23 (* .cse24 2))) (= (+ .cse20 7 (* v_itHalf_1 12) (* v_main_~n~0_22 9) .cse22) (+ v_main_~y~0_27 v_main_~z~0_31 (* 2 .cse23))) (<= (+ v_main_~n~0_22 (* v_itHalf_1 2) 1) v_main_~a~0_10) (= (+ (* 12 .cse23) (* v_main_~z~0_31 4) (* v_main_~x~0_21 18) (* 72 .cse21) (* v_main_~y~0_27 24) (* .cse24 24)) (+ (* (* v_main_~z~0_31 v_main_~z~0_31 v_itHalf_1) 2) (* v_itHalf_1 24) (* v_main_~z~0_31 v_main_~z~0_31) 6 (* v_main_~y~0_27 v_main_~z~0_31))))))) (= (+ v_main_~x~0_21 (* 2 (* v_main_~y~0_27 .cse25)) (* 2 (* v_main_~z~0_31 .cse25 .cse25)) (* .cse25 4) (* (* .cse25 .cse25 .cse25) 8)) (+ v_main_~x~0_20 .cse26 .cse27)) (= v_main_~n~0_21 (+ v_main_~n~0_22 (* 2 .cse25))) (= (mod (+ v_main_~z~0_31 .cse6) 12) 0) (= (+ v_main_~y~0_27 (* 2 .cse26) .cse27) (+ (* .cse25 6) v_main_~y~0_26)) .cse18 (< 0 .cse25))))))) InVars {main_~y~0=v_main_~y~0_27, main_~n~0=v_main_~n~0_22, main_~x~0=v_main_~x~0_21, main_~z~0=v_main_~z~0_31, main_~a~0=v_main_~a~0_10} OutVars{main_~y~0=v_main_~y~0_26, main_~n~0=v_main_~n~0_21, main_~x~0=v_main_~x~0_20, main_~z~0=v_main_~z~0_30, main_~a~0=v_main_~a~0_10} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1545#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)))} is VALID [2022-04-08 04:20:11,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {1545#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)))} [83] L33_primed-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1545#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)))} is VALID [2022-04-08 04:20:11,249 INFO L272 TraceCheckUtils]: 8: Hoare triple {1545#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1521#true} is VALID [2022-04-08 04:20:11,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {1521#true} ~cond := #in~cond; {1555#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:20:11,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {1555#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1559#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:20:11,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {1559#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1559#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:20:11,381 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1559#(not (= |__VERIFIER_assert_#in~cond| 0))} {1545#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)))} #58#return; {1566#(or (and (= (+ main_~y~0 (* 6 (div (* main_~n~0 (- 6)) (- 12)))) (+ (* (* (div (* main_~n~0 (- 6)) (- 12)) (div (* main_~n~0 (- 6)) (- 12))) 12) (* 12 (div (* main_~n~0 (- 6)) (- 12))) 1)) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* main_~n~0 (- 6)) (- 12)))) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (< 0 (div (* main_~n~0 (- 6)) (- 12))) (= (mod (* main_~n~0 6) 12) 0)) (and (= main_~n~0 0) (= main_~y~0 1)) (and (= (+ 7 (* 12 (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))) (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 18)) main_~y~0) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (<= 0 (div (+ 6 (* main_~n~0 (- 6))) (- 12))) (= main_~n~0 (+ (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 2) 1))))} is VALID [2022-04-08 04:20:11,393 INFO L272 TraceCheckUtils]: 13: Hoare triple {1566#(or (and (= (+ main_~y~0 (* 6 (div (* main_~n~0 (- 6)) (- 12)))) (+ (* (* (div (* main_~n~0 (- 6)) (- 12)) (div (* main_~n~0 (- 6)) (- 12))) 12) (* 12 (div (* main_~n~0 (- 6)) (- 12))) 1)) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* main_~n~0 (- 6)) (- 12)))) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (< 0 (div (* main_~n~0 (- 6)) (- 12))) (= (mod (* main_~n~0 6) 12) 0)) (and (= main_~n~0 0) (= main_~y~0 1)) (and (= (+ 7 (* 12 (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))) (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 18)) main_~y~0) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (<= 0 (div (+ 6 (* main_~n~0 (- 6))) (- 12))) (= main_~n~0 (+ (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 2) 1))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:20:11,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {1570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:20:11,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1522#false} is VALID [2022-04-08 04:20:11,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-08 04:20:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:20:11,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:20:18,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-08 04:20:18,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1522#false} is VALID [2022-04-08 04:20:18,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {1570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:20:18,344 INFO L272 TraceCheckUtils]: 13: Hoare triple {1590#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:20:18,345 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1559#(not (= |__VERIFIER_assert_#in~cond| 0))} {1594#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #58#return; {1590#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 04:20:18,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {1559#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1559#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:20:18,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {1604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1559#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:20:18,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {1521#true} ~cond := #in~cond; {1604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:20:18,346 INFO L272 TraceCheckUtils]: 8: Hoare triple {1594#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1521#true} is VALID [2022-04-08 04:20:18,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1594#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} [83] L33_primed-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1594#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-08 04:20:20,354 WARN L290 TraceCheckUtils]: 6: Hoare triple {1594#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} [84] L32-2-->L33_primed: Formula: (let ((.cse28 (* v_main_~y~0_27 12))) (let ((.cse2 (<= v_main_~n~0_22 v_main_~a~0_10)) (.cse4 (= (+ .cse28 (* v_main_~x~0_21 18) 6) (+ (* v_main_~y~0_27 v_main_~z~0_31) (* v_main_~z~0_31 2)))) (.cse3 (= v_main_~z~0_31 (+ (* v_main_~n~0_22 6) 6))) (.cse0 (= v_main_~x~0_21 v_main_~x~0_20)) (.cse1 (= v_main_~y~0_27 v_main_~y~0_26)) (.cse5 (= v_main_~z~0_31 v_main_~z~0_30)) (.cse6 (* v_main_~z~0_30 11)) (.cse18 (= (+ (* v_main_~z~0_31 v_main_~z~0_31) 12) (+ .cse28 (* v_main_~z~0_31 6)))) (.cse19 (* (- 1) v_main_~z~0_30))) (or (and (= v_main_~n~0_21 v_main_~n~0_22) .cse0 .cse1 (or (not .cse2) (not .cse3) (not (= v_main_~y~0_27 (+ (* v_main_~n~0_22 3) (* 3 (* v_main_~n~0_22 v_main_~n~0_22)) 1))) (not .cse4)) .cse5) (let ((.cse12 (div (+ v_main_~z~0_31 .cse19 6) (- 12)))) (let ((.cse9 (* 2 .cse12)) (.cse10 (* v_main_~z~0_31 .cse12)) (.cse11 (* .cse12 .cse12))) (and .cse2 (= (mod (+ v_main_~z~0_31 .cse6 6) 12) 0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ v_main_~z~0_31 (* (- 1) v_main_~z~0_30) 6) (- 12)))) (not (<= 1 v_itHalf_1)) (let ((.cse8 (* v_main_~y~0_27 v_itHalf_1)) (.cse7 (* v_main_~z~0_31 v_itHalf_1))) (and (<= (+ v_main_~n~0_22 (* v_itHalf_1 2)) v_main_~a~0_10) (= (+ (* (* v_itHalf_1 v_itHalf_1) 12) (* (* v_main_~n~0_22 v_main_~n~0_22 v_itHalf_1) 6) (* (* v_main_~n~0_22 v_itHalf_1 v_itHalf_1) 12) .cse7 (* v_main_~n~0_22 v_main_~n~0_22 v_main_~n~0_22)) (+ v_main_~x~0_21 (* v_itHalf_1 4) (* 2 (* v_main_~z~0_31 v_itHalf_1 v_itHalf_1)) (* .cse8 2))) (= (+ (* (* v_main_~z~0_31 v_main_~z~0_31 v_itHalf_1) 2) (* v_itHalf_1 24) (* v_main_~y~0_27 v_main_~z~0_31) (* v_main_~z~0_31 2)) (+ (* 12 .cse7) (* v_main_~y~0_27 12) (* v_main_~x~0_21 18) 6 (* .cse8 24))) (= (+ v_main_~y~0_27 (* 2 .cse7)) (+ (* v_main_~n~0_22 3) (* 3 (* v_main_~n~0_22 v_main_~n~0_22)) (* v_itHalf_1 12) (* (* v_main_~n~0_22 v_itHalf_1) 12) 1)))))) .cse4 (= v_main_~n~0_21 (+ v_main_~n~0_22 .cse9 1)) (= v_main_~y~0_26 (+ (* .cse10 2) v_main_~y~0_27 v_main_~z~0_31 (* .cse11 12) (* .cse12 6))) (<= 0 .cse12) (= (+ v_main_~x~0_20 .cse9) (+ v_main_~x~0_21 v_main_~y~0_27 .cse10 (* .cse11 4) (* 2 (* v_main_~y~0_27 .cse12)) (* 2 (* v_main_~z~0_31 .cse12 .cse12)) (* 8 (* .cse12 .cse12 .cse12)))) .cse3 (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ v_main_~z~0_31 (* (- 1) v_main_~z~0_30) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (let ((.cse13 (* 3 (* v_main_~n~0_22 v_main_~n~0_22))) (.cse15 (* (* v_main_~n~0_22 v_itHalf_1) 12)) (.cse16 (* v_main_~z~0_31 v_itHalf_1)) (.cse14 (* v_itHalf_1 v_itHalf_1)) (.cse17 (* v_main_~y~0_27 v_itHalf_1))) (and (= (+ (* v_main_~n~0_22 3) .cse13 (* (* v_main_~n~0_22 v_main_~n~0_22 v_itHalf_1) 6) (* (* v_main_~n~0_22 v_itHalf_1 v_itHalf_1) 12) (* .cse14 8) (* v_itHalf_1 8) (* v_main_~n~0_22 v_main_~n~0_22 v_main_~n~0_22) .cse15 1) (+ v_main_~x~0_21 v_main_~y~0_27 (* 2 (* v_main_~z~0_31 v_itHalf_1 v_itHalf_1)) .cse16 (* .cse17 2))) (= (+ .cse13 7 (* v_itHalf_1 12) (* v_main_~n~0_22 9) .cse15) (+ v_main_~y~0_27 v_main_~z~0_31 (* 2 .cse16))) (<= (+ v_main_~n~0_22 (* v_itHalf_1 2) 1) v_main_~a~0_10) (= (+ (* 12 .cse16) (* v_main_~z~0_31 4) (* v_main_~x~0_21 18) (* 72 .cse14) (* v_main_~y~0_27 24) (* .cse17 24)) (+ (* (* v_main_~z~0_31 v_main_~z~0_31 v_itHalf_1) 2) (* v_itHalf_1 24) (* v_main_~z~0_31 v_main_~z~0_31) 6 (* v_main_~y~0_27 v_main_~z~0_31))))))) .cse18))) (and (= v_main_~n~0_22 v_main_~n~0_21) .cse0 .cse1 (= v_main_~a~0_10 v_main_~a~0_10) .cse5) (let ((.cse25 (div (+ v_main_~z~0_31 .cse19) (- 12)))) (let ((.cse26 (* v_main_~z~0_31 .cse25)) (.cse27 (* 12 (* .cse25 .cse25)))) (and (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ v_main_~z~0_31 (* (- 1) v_main_~z~0_30)) (- 12)))) (let ((.cse20 (* 3 (* v_main_~n~0_22 v_main_~n~0_22))) (.cse22 (* (* v_main_~n~0_22 v_itHalf_1) 12)) (.cse23 (* v_main_~z~0_31 v_itHalf_1)) (.cse21 (* v_itHalf_1 v_itHalf_1)) (.cse24 (* v_main_~y~0_27 v_itHalf_1))) (and (= (+ (* v_main_~n~0_22 3) .cse20 (* (* v_main_~n~0_22 v_main_~n~0_22 v_itHalf_1) 6) (* (* v_main_~n~0_22 v_itHalf_1 v_itHalf_1) 12) (* .cse21 8) (* v_itHalf_1 8) (* v_main_~n~0_22 v_main_~n~0_22 v_main_~n~0_22) .cse22 1) (+ v_main_~x~0_21 v_main_~y~0_27 (* 2 (* v_main_~z~0_31 v_itHalf_1 v_itHalf_1)) .cse23 (* .cse24 2))) (= (+ .cse20 7 (* v_itHalf_1 12) (* v_main_~n~0_22 9) .cse22) (+ v_main_~y~0_27 v_main_~z~0_31 (* 2 .cse23))) (<= (+ v_main_~n~0_22 (* v_itHalf_1 2) 1) v_main_~a~0_10) (= (+ (* 12 .cse23) (* v_main_~z~0_31 4) (* v_main_~x~0_21 18) (* 72 .cse21) (* v_main_~y~0_27 24) (* .cse24 24)) (+ (* (* v_main_~z~0_31 v_main_~z~0_31 v_itHalf_1) 2) (* v_itHalf_1 24) (* v_main_~z~0_31 v_main_~z~0_31) 6 (* v_main_~y~0_27 v_main_~z~0_31))))))) (= (+ v_main_~x~0_21 (* 2 (* v_main_~y~0_27 .cse25)) (* 2 (* v_main_~z~0_31 .cse25 .cse25)) (* .cse25 4) (* (* .cse25 .cse25 .cse25) 8)) (+ v_main_~x~0_20 .cse26 .cse27)) (= v_main_~n~0_21 (+ v_main_~n~0_22 (* 2 .cse25))) (= (mod (+ v_main_~z~0_31 .cse6) 12) 0) (= (+ v_main_~y~0_27 (* 2 .cse26) .cse27) (+ (* .cse25 6) v_main_~y~0_26)) .cse18 (< 0 .cse25))))))) InVars {main_~y~0=v_main_~y~0_27, main_~n~0=v_main_~n~0_22, main_~x~0=v_main_~x~0_21, main_~z~0=v_main_~z~0_31, main_~a~0=v_main_~a~0_10} OutVars{main_~y~0=v_main_~y~0_26, main_~n~0=v_main_~n~0_21, main_~x~0=v_main_~x~0_20, main_~z~0=v_main_~z~0_30, main_~a~0=v_main_~a~0_10} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1594#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is UNKNOWN [2022-04-08 04:20:20,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1594#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-08 04:20:20,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret5 := main(); {1521#true} is VALID [2022-04-08 04:20:20,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #80#return; {1521#true} is VALID [2022-04-08 04:20:20,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-08 04:20:20,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#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(13, 2);call #Ultimate.allocInit(12, 3); {1521#true} is VALID [2022-04-08 04:20:20,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-08 04:20:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:20:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:20:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403453864] [2022-04-08 04:20:20,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:20:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233885379] [2022-04-08 04:20:20,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233885379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:20:20,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:20:20,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-08 04:22:05,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:22:05,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529047295] [2022-04-08 04:22:05,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529047295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:22:05,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:22:05,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 04:22:05,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268633108] [2022-04-08 04:22:05,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:22:05,493 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 17 states have internal predecessors, (27), 8 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 43 [2022-04-08 04:22:05,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:22:05,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 17 states have internal predecessors, (27), 8 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:22:18,998 WARN L143 InductivityCheck]: Transition 1590#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) ( _ , call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); , 1642#(exists ((v_main_~n~0_31 Int) (v_main_~x~0_26 Int)) (and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= v_main_~x~0_26 (* (* v_main_~n~0_31 v_main_~n~0_31) v_main_~n~0_31)))) (and (= v_main_~x~0_26 (* (* v_main_~n~0_31 v_main_~n~0_31) v_main_~n~0_31)) (= |__VERIFIER_assert_#in~cond| 1))) (= main_~y~0 (+ (* (* v_main_~n~0_31 v_main_~n~0_31) 3) 1 (* v_main_~n~0_31 3))))) ) not inductive [2022-04-08 04:22:19,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 04:22:19,198 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:22:19,199 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 04:22:19,202 INFO L158 Benchmark]: Toolchain (without parser) took 207489.27ms. Allocated memory was 174.1MB in the beginning and 276.8MB in the end (delta: 102.8MB). Free memory was 119.1MB in the beginning and 245.8MB in the end (delta: -126.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:22:19,202 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:22:19,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.44ms. Allocated memory is still 174.1MB. Free memory was 118.9MB in the beginning and 148.6MB in the end (delta: -29.7MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2022-04-08 04:22:19,202 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 174.1MB. Free memory was 148.2MB in the beginning and 146.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 04:22:19,203 INFO L158 Benchmark]: RCFGBuilder took 235.01ms. Allocated memory is still 174.1MB. Free memory was 146.5MB in the beginning and 135.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 04:22:19,203 INFO L158 Benchmark]: TraceAbstraction took 207008.85ms. Allocated memory was 174.1MB in the beginning and 276.8MB in the end (delta: 102.8MB). Free memory was 135.0MB in the beginning and 245.8MB in the end (delta: -110.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:22:19,204 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.10ms. Allocated memory is still 174.1MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.44ms. Allocated memory is still 174.1MB. Free memory was 118.9MB in the beginning and 148.6MB in the end (delta: -29.7MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 174.1MB. Free memory was 148.2MB in the beginning and 146.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 235.01ms. Allocated memory is still 174.1MB. Free memory was 146.5MB in the beginning and 135.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 207008.85ms. Allocated memory was 174.1MB in the beginning and 276.8MB in the end (delta: 102.8MB). Free memory was 135.0MB in the beginning and 245.8MB in the end (delta: -110.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 04:22:19,413 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-08 04:22:19,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...