/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:10:24,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:10:24,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:10:24,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:10:24,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:10:24,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:10:24,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:10:24,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:10:24,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:10:24,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:10:24,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:10:24,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:10:24,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:10:24,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:10:24,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:10:24,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:10:24,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:10:24,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:10:24,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:10:24,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:10:24,506 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:10:24,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:10:24,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:10:24,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:10:24,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:10:24,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:10:24,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:10:24,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:10:24,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:10:24,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:10:24,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:10:24,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:10:24,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:10:24,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:10:24,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:10:24,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:10:24,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:10:24,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:10:24,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:10:24,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:10:24,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:10:24,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:10:24,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:10:24,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:10:24,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:10:24,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:10:24,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:10:24,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:10:24,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:10:24,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:10:24,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:10:24,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:10:24,535 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:10:24,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:10:24,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:10:24,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:10:24,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:10:24,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:10:24,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:10:24,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:10:24,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:10:24,536 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:10:24,537 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:10:24,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:10:24,537 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:10:24,537 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 11:10:24,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:10:24,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:10:24,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:10:24,794 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:10:24,794 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:10:24,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-04-08 11:10:24,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a8f256e1/76efb573a0214e53887fcda81504da6c/FLAG718558de0 [2022-04-08 11:10:25,221 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:10:25,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-04-08 11:10:25,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a8f256e1/76efb573a0214e53887fcda81504da6c/FLAG718558de0 [2022-04-08 11:10:25,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a8f256e1/76efb573a0214e53887fcda81504da6c [2022-04-08 11:10:25,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:10:25,641 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:10:25,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:10:25,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:10:25,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:10:25,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:10:25" (1/1) ... [2022-04-08 11:10:25,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2e5484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25, skipping insertion in model container [2022-04-08 11:10:25,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:10:25" (1/1) ... [2022-04-08 11:10:25,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:10:25,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:10:25,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c[588,601] [2022-04-08 11:10:25,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:10:25,823 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:10:25,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c[588,601] [2022-04-08 11:10:25,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:10:25,858 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:10:25,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25 WrapperNode [2022-04-08 11:10:25,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:10:25,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:10:25,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:10:25,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:10:25,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25" (1/1) ... [2022-04-08 11:10:25,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25" (1/1) ... [2022-04-08 11:10:25,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25" (1/1) ... [2022-04-08 11:10:25,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25" (1/1) ... [2022-04-08 11:10:25,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25" (1/1) ... [2022-04-08 11:10:25,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25" (1/1) ... [2022-04-08 11:10:25,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25" (1/1) ... [2022-04-08 11:10:25,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:10:25,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:10:25,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:10:25,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:10:25,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25" (1/1) ... [2022-04-08 11:10:25,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:10:25,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:25,916 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 11:10:25,917 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 11:10:25,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:10:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:10:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:10:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:10:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:10:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:10:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:10:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:10:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:10:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:10:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-08 11:10:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:10:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:10:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:10:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:10:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:10:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:10:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:10:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:10:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:10:26,004 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:10:26,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:10:26,165 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:10:26,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:10:26,171 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 11:10:26,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:10:26 BoogieIcfgContainer [2022-04-08 11:10:26,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:10:26,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:10:26,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:10:26,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:10:26,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:10:25" (1/3) ... [2022-04-08 11:10:26,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d00bae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:10:26, skipping insertion in model container [2022-04-08 11:10:26,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:10:25" (2/3) ... [2022-04-08 11:10:26,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d00bae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:10:26, skipping insertion in model container [2022-04-08 11:10:26,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:10:26" (3/3) ... [2022-04-08 11:10:26,179 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound100.c [2022-04-08 11:10:26,183 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:10:26,183 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:10:26,216 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:10:26,221 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 11:10:26,221 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:10:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 11:10:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 11:10:26,258 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:26,259 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:26,259 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-08 11:10:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:26,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [520993079] [2022-04-08 11:10:26,291 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-08 11:10:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:26,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587232101] [2022-04-08 11:10:26,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:26,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:26,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:10:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:26,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {34#true} is VALID [2022-04-08 11:10:26,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 11:10:26,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-08 11:10:26,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:10:26,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {34#true} is VALID [2022-04-08 11:10:26,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 11:10:26,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-08 11:10:26,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-08 11:10:26,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#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; {34#true} is VALID [2022-04-08 11:10:26,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-08 11:10:26,513 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-08 11:10:26,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 11:10:26,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 11:10:26,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 11:10:26,515 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 11:10:26,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:26,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587232101] [2022-04-08 11:10:26,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587232101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:26,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:26,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:10:26,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:26,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [520993079] [2022-04-08 11:10:26,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [520993079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:26,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:26,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:10:26,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94768895] [2022-04-08 11:10:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:26,528 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 11:10:26,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:26,532 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 11:10:26,551 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 11:10:26,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:10:26,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:26,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:10:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:10:26,583 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 11:10:26,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:26,827 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-08 11:10:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:10:26,827 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 11:10:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:26,828 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 11:10:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 11:10:26,844 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 11:10:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 11:10:26,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-08 11:10:26,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:26,984 INFO L225 Difference]: With dead ends: 57 [2022-04-08 11:10:26,985 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 11:10:26,989 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 11:10:26,992 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:26,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:10:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 11:10:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 11:10:27,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:27,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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 11:10:27,029 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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 11:10:27,029 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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 11:10:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:27,036 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-08 11:10:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-08 11:10:27,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:27,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:27,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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 27 states. [2022-04-08 11:10:27,038 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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 27 states. [2022-04-08 11:10:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:27,049 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-08 11:10:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-08 11:10:27,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:27,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:27,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:27,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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 11:10:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-08 11:10:27,057 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-08 11:10:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:27,057 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-08 11:10:27,058 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 11:10:27,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-08 11:10:27,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-08 11:10:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:10:27,106 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:27,107 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:27,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:10:27,111 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:27,112 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-08 11:10:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:27,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [334992095] [2022-04-08 11:10:27,114 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-08 11:10:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:27,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493706450] [2022-04-08 11:10:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:27,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:10:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:27,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:27,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:27,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:27,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:10:27,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:27,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:27,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:27,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:27,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(= ~counter~0 0)} 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; {267#(= ~counter~0 0)} is VALID [2022-04-08 11:10:27,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {268#(= |main_#t~post5| 0)} is VALID [2022-04-08 11:10:27,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {263#false} is VALID [2022-04-08 11:10:27,236 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {263#false} is VALID [2022-04-08 11:10:27,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-08 11:10:27,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-08 11:10:27,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 11:10:27,237 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 11:10:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:27,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493706450] [2022-04-08 11:10:27,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493706450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:27,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:27,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:10:27,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:27,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [334992095] [2022-04-08 11:10:27,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [334992095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:27,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:27,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:10:27,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822512969] [2022-04-08 11:10:27,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:27,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 12 [2022-04-08 11:10:27,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:27,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 11:10:27,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:27,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:10:27,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:27,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:10:27,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:10:27,257 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 11:10:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:27,584 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-08 11:10:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:10:27,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 12 [2022-04-08 11:10:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 11:10:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-08 11:10:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 11:10:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-08 11:10:27,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-08 11:10:27,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:27,656 INFO L225 Difference]: With dead ends: 40 [2022-04-08 11:10:27,656 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 11:10:27,657 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 11:10:27,658 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:27,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:10:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 11:10:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 11:10:27,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:27,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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 11:10:27,665 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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 11:10:27,665 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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 11:10:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:27,667 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-08 11:10:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:10:27,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:27,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:27,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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 28 states. [2022-04-08 11:10:27,669 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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 28 states. [2022-04-08 11:10:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:27,671 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-08 11:10:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:10:27,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:27,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:27,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:27,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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 11:10:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-08 11:10:27,675 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-08 11:10:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:27,675 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-08 11:10:27,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 11:10:27,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-08 11:10:27,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-08 11:10:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:10:27,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:27,721 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:27,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 11:10:27,721 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:27,722 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-08 11:10:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:27,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1979050006] [2022-04-08 11:10:27,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-08 11:10:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:27,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404817984] [2022-04-08 11:10:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:27,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:27,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:10:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:27,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {466#true} is VALID [2022-04-08 11:10:27,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 11:10:27,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-08 11:10:27,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:10:27,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {466#true} is VALID [2022-04-08 11:10:27,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 11:10:27,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-08 11:10:27,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-08 11:10:27,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#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; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-08 11:10:27,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-08 11:10:27,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 100);havoc #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-08 11:10:27,862 INFO L272 TraceCheckUtils]: 8: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:27,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:10:27,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-08 11:10:27,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-08 11:10:27,863 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 11:10:27,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:27,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404817984] [2022-04-08 11:10:27,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404817984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:27,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:27,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:10:27,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:27,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1979050006] [2022-04-08 11:10:27,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1979050006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:27,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:27,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:10:27,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610435533] [2022-04-08 11:10:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:27,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-08 11:10:27,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:27,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 11:10:27,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:27,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:10:27,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:27,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:10:27,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:10:27,879 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 11:10:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:28,286 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-08 11:10:28,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:10:28,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-08 11:10:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 11:10:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 11:10:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 11:10:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 11:10:28,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-08 11:10:28,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:28,341 INFO L225 Difference]: With dead ends: 34 [2022-04-08 11:10:28,341 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 11:10:28,341 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 11:10:28,342 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:28,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:10:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 11:10:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 11:10:28,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:28,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 11:10:28,349 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 11:10:28,350 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 11:10:28,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:28,352 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 11:10:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:10:28,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:28,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:28,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 32 states. [2022-04-08 11:10:28,354 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 32 states. [2022-04-08 11:10:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:28,356 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 11:10:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:10:28,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:28,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:28,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:28,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 11:10:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 11:10:28,359 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-08 11:10:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:28,360 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 11:10:28,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 11:10:28,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 11:10:28,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 11:10:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 11:10:28,406 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:28,406 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:28,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 11:10:28,407 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-08 11:10:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:28,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089956848] [2022-04-08 11:10:28,408 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-08 11:10:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705320345] [2022-04-08 11:10:28,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:28,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:28,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822035106] [2022-04-08 11:10:28,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:28,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:28,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:28,435 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 11:10:28,466 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 11:10:28,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:28,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:28,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:10:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:28,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:28,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-08 11:10:28,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#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);~counter~0 := 0; {681#true} is VALID [2022-04-08 11:10:28,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-08 11:10:28,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-08 11:10:28,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-08 11:10:28,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#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; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 11:10:28,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 11:10:28,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 11:10:28,701 INFO L272 TraceCheckUtils]: 8: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {681#true} is VALID [2022-04-08 11:10:28,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-08 11:10:28,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-08 11:10:28,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-08 11:10:28,702 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {681#true} {701#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-08 11:10:28,703 INFO L272 TraceCheckUtils]: 13: Hoare triple {701#(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)); {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:10:28,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:28,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-08 11:10:28,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-08 11:10:28,705 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 11:10:28,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:10:28,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:28,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705320345] [2022-04-08 11:10:28,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:28,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822035106] [2022-04-08 11:10:28,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822035106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:28,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:28,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:28,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:28,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089956848] [2022-04-08 11:10:28,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089956848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:28,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:28,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:28,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111797847] [2022-04-08 11:10:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:28,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 11:10:28,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:28,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:10:28,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:28,722 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:10:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:10:28,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:10:28,723 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:10:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:29,014 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-08 11:10:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:10:29,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 11:10:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:10:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:10:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:29,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:10:29,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:29,099 INFO L225 Difference]: With dead ends: 50 [2022-04-08 11:10:29,099 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 11:10:29,099 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:10:29,100 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:29,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:10:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 11:10:29,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-08 11:10:29,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:29,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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 11:10:29,118 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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 11:10:29,119 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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 11:10:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:29,125 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-08 11:10:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-08 11:10:29,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:29,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:29,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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 48 states. [2022-04-08 11:10:29,132 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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 48 states. [2022-04-08 11:10:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:29,135 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-08 11:10:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-08 11:10:29,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:29,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:29,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:29,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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 11:10:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-08 11:10:29,139 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-08 11:10:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:29,139 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-08 11:10:29,140 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 11:10:29,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-08 11:10:29,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-08 11:10:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 11:10:29,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:29,195 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:29,222 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 11:10:29,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:29,420 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:29,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-08 11:10:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:29,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737892947] [2022-04-08 11:10:29,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:29,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-08 11:10:29,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:29,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723497456] [2022-04-08 11:10:29,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:29,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:29,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:29,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407289533] [2022-04-08 11:10:29,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:29,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:29,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:29,436 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 11:10:29,463 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 11:10:29,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:29,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:29,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:10:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:29,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:29,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-08 11:10:29,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#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);~counter~0 := 0; {1010#true} is VALID [2022-04-08 11:10:29,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:10:29,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-08 11:10:29,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-08 11:10:29,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#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; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:10:29,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:10:29,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:10:29,627 INFO L272 TraceCheckUtils]: 8: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1010#true} is VALID [2022-04-08 11:10:29,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-08 11:10:29,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-08 11:10:29,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:10:29,628 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:10:29,628 INFO L272 TraceCheckUtils]: 13: Hoare triple {1030#(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)); {1010#true} is VALID [2022-04-08 11:10:29,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-08 11:10:29,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-08 11:10:29,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-08 11:10:29,629 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-08 11:10:29,630 INFO L272 TraceCheckUtils]: 18: Hoare triple {1030#(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)); {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:10:29,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:29,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-08 11:10:29,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-08 11:10:29,631 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 11:10:29,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:10:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:29,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723497456] [2022-04-08 11:10:29,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:29,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407289533] [2022-04-08 11:10:29,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407289533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:29,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:29,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:29,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:29,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [737892947] [2022-04-08 11:10:29,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [737892947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:29,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:29,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:29,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336325757] [2022-04-08 11:10:29,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:29,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 11:10:29,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:29,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:10:29,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:29,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:10:29,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:29,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:10:29,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:10:29,648 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:10:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:40,398 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-08 11:10:40,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:10:40,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 11:10:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:10:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:10:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:40,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:10:40,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:40,478 INFO L225 Difference]: With dead ends: 54 [2022-04-08 11:10:40,479 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 11:10:40,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:10:40,480 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 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 11:10:40,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:10:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 11:10:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-08 11:10:40,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:40,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 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 11:10:40,505 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 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 11:10:40,507 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 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 11:10:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:40,514 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-08 11:10:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 11:10:40,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:40,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:40,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 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 52 states. [2022-04-08 11:10:40,517 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 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 52 states. [2022-04-08 11:10:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:40,521 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-08 11:10:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 11:10:40,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:40,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:40,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:40,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 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 11:10:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-08 11:10:40,526 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-08 11:10:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:40,527 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-08 11:10:40,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:10:40,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-08 11:10:40,608 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 11:10:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-08 11:10:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:10:40,609 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:40,609 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:40,635 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 11:10:40,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:40,824 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:40,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:40,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-08 11:10:40,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:40,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1685338213] [2022-04-08 11:10:40,825 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-08 11:10:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:40,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744282460] [2022-04-08 11:10:40,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:40,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:40,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:40,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064592784] [2022-04-08 11:10:40,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:40,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:40,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:40,847 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 11:10:40,871 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 11:10:40,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:40,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:40,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:10:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:40,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:41,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-08 11:10:41,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#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);~counter~0 := 0; {1390#true} is VALID [2022-04-08 11:10:41,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:10:41,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-08 11:10:41,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-08 11:10:41,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#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; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:41,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:41,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:41,083 INFO L272 TraceCheckUtils]: 8: Hoare triple {1410#(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)); {1390#true} is VALID [2022-04-08 11:10:41,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:10:41,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:10:41,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:10:41,084 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:41,084 INFO L272 TraceCheckUtils]: 13: Hoare triple {1410#(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)); {1390#true} is VALID [2022-04-08 11:10:41,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:10:41,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:10:41,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:10:41,085 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:41,087 INFO L272 TraceCheckUtils]: 18: Hoare triple {1410#(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)); {1390#true} is VALID [2022-04-08 11:10:41,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-08 11:10:41,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-08 11:10:41,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-08 11:10:41,089 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:41,090 INFO L272 TraceCheckUtils]: 23: Hoare triple {1410#(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)); {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:10:41,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:41,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-08 11:10:41,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-08 11:10:41,091 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 11:10:41,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:10:41,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:41,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744282460] [2022-04-08 11:10:41,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:41,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064592784] [2022-04-08 11:10:41,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064592784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:41,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:41,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:41,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:41,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1685338213] [2022-04-08 11:10:41,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1685338213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:41,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:41,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352127484] [2022-04-08 11:10:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:41,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 27 [2022-04-08 11:10:41,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:41,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 11:10:41,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:41,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:10:41,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:41,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:10:41,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:10:41,115 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 11:10:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:41,458 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-08 11:10:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:10:41,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 27 [2022-04-08 11:10:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 11:10:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 11:10:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 11:10:41,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 11:10:41,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:41,563 INFO L225 Difference]: With dead ends: 62 [2022-04-08 11:10:41,563 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 11:10:41,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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 11:10:41,564 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:41,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:10:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 11:10:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 11:10:41,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:41,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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 11:10:41,586 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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 11:10:41,587 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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 11:10:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:41,590 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-08 11:10:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:10:41,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:41,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:41,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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 50 states. [2022-04-08 11:10:41,591 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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 50 states. [2022-04-08 11:10:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:41,594 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-08 11:10:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:10:41,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:41,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:41,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:41,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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 11:10:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-08 11:10:41,597 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-08 11:10:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:41,598 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-08 11:10:41,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 11:10:41,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-08 11:10:41,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 11:10:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 11:10:41,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:41,674 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:41,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 11:10:41,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:41,897 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-08 11:10:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:41,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1031750820] [2022-04-08 11:10:42,312 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:10:42,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:10:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 2 times [2022-04-08 11:10:42,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:42,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51616720] [2022-04-08 11:10:42,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:42,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:42,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885814554] [2022-04-08 11:10:42,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:42,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:42,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:42,333 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 11:10:42,335 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 11:10:42,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:42,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:42,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:10:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:42,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:42,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-08 11:10:42,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#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);~counter~0 := 0; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:42,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:42,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#(<= ~counter~0 0)} {1801#true} #81#return; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:42,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(<= ~counter~0 0)} call #t~ret6 := main(); {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:42,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {1809#(<= ~counter~0 0)} 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; {1809#(<= ~counter~0 0)} is VALID [2022-04-08 11:10:42,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1809#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,604 INFO L272 TraceCheckUtils]: 8: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,606 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #59#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,606 INFO L272 TraceCheckUtils]: 13: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,611 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #61#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,611 INFO L272 TraceCheckUtils]: 18: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,613 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #63#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,614 INFO L272 TraceCheckUtils]: 23: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,617 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #65#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,619 INFO L272 TraceCheckUtils]: 28: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,621 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #67#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {1825#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1825#(<= ~counter~0 1)} is VALID [2022-04-08 11:10:42,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {1825#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1910#(<= |main_#t~post5| 1)} is VALID [2022-04-08 11:10:42,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {1802#false} is VALID [2022-04-08 11:10:42,622 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1802#false} is VALID [2022-04-08 11:10:42,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:10:42,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {1802#false} assume !(0 == ~cond); {1802#false} is VALID [2022-04-08 11:10:42,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {1802#false} assume true; {1802#false} is VALID [2022-04-08 11:10:42,623 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1802#false} {1802#false} #69#return; {1802#false} is VALID [2022-04-08 11:10:42,623 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-08 11:10:42,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:10:42,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-08 11:10:42,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-08 11:10:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 11:10:42,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:10:42,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-08 11:10:42,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-08 11:10:42,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-08 11:10:42,840 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-08 11:10:42,840 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1801#true} {1802#false} #69#return; {1802#false} is VALID [2022-04-08 11:10:42,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:42,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:42,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:42,840 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-08 11:10:42,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {1802#false} is VALID [2022-04-08 11:10:42,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {1972#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1968#(< |main_#t~post5| 100)} is VALID [2022-04-08 11:10:42,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {1972#(< ~counter~0 100)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1972#(< ~counter~0 100)} is VALID [2022-04-08 11:10:42,842 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1801#true} {1972#(< ~counter~0 100)} #67#return; {1972#(< ~counter~0 100)} is VALID [2022-04-08 11:10:42,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:42,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:42,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:42,843 INFO L272 TraceCheckUtils]: 28: Hoare triple {1972#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1801#true} is VALID [2022-04-08 11:10:42,843 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1801#true} {1972#(< ~counter~0 100)} #65#return; {1972#(< ~counter~0 100)} is VALID [2022-04-08 11:10:42,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:42,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:42,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:42,844 INFO L272 TraceCheckUtils]: 23: Hoare triple {1972#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1801#true} is VALID [2022-04-08 11:10:42,845 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1801#true} {1972#(< ~counter~0 100)} #63#return; {1972#(< ~counter~0 100)} is VALID [2022-04-08 11:10:42,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:42,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:42,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:42,845 INFO L272 TraceCheckUtils]: 18: Hoare triple {1972#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-08 11:10:42,846 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1801#true} {1972#(< ~counter~0 100)} #61#return; {1972#(< ~counter~0 100)} is VALID [2022-04-08 11:10:42,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:42,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:42,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:42,847 INFO L272 TraceCheckUtils]: 13: Hoare triple {1972#(< ~counter~0 100)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1801#true} is VALID [2022-04-08 11:10:42,851 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1801#true} {1972#(< ~counter~0 100)} #59#return; {1972#(< ~counter~0 100)} is VALID [2022-04-08 11:10:42,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-08 11:10:42,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-08 11:10:42,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-08 11:10:42,851 INFO L272 TraceCheckUtils]: 8: Hoare triple {1972#(< ~counter~0 100)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-08 11:10:42,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {1972#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {1972#(< ~counter~0 100)} is VALID [2022-04-08 11:10:42,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {2057#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1972#(< ~counter~0 100)} is VALID [2022-04-08 11:10:42,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {2057#(< ~counter~0 99)} 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; {2057#(< ~counter~0 99)} is VALID [2022-04-08 11:10:42,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#(< ~counter~0 99)} call #t~ret6 := main(); {2057#(< ~counter~0 99)} is VALID [2022-04-08 11:10:42,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#(< ~counter~0 99)} {1801#true} #81#return; {2057#(< ~counter~0 99)} is VALID [2022-04-08 11:10:42,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#(< ~counter~0 99)} assume true; {2057#(< ~counter~0 99)} is VALID [2022-04-08 11:10:42,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#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);~counter~0 := 0; {2057#(< ~counter~0 99)} is VALID [2022-04-08 11:10:42,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-08 11:10:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 11:10:42,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:42,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51616720] [2022-04-08 11:10:42,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:42,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885814554] [2022-04-08 11:10:42,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885814554] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:10:42,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:10:42,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 11:10:42,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:42,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1031750820] [2022-04-08 11:10:42,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1031750820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:42,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:42,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:10:42,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101775514] [2022-04-08 11:10:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-08 11:10:42,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:42,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:10:42,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:42,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:10:42,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:42,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:10:42,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:10:42,888 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:10:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:43,191 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-08 11:10:43,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:10:43,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-08 11:10:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:10:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-08 11:10:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:10:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-08 11:10:43,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-08 11:10:43,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:43,255 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:10:43,255 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 11:10:43,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:10:43,256 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:43,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:10:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 11:10:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-08 11:10:43,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:43,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:10:43,297 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:10:43,297 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:10:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:43,299 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:10:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:10:43,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:43,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:43,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-08 11:10:43,300 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-08 11:10:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:43,302 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:10:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:10:43,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:43,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:43,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:43,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:10:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 11:10:43,306 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-08 11:10:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:43,306 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 11:10:43,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:10:43,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 11:10:43,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 11:10:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 11:10:43,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:43,389 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:43,414 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 11:10:43,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:43,589 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-08 11:10:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:43,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1742575937] [2022-04-08 11:10:43,954 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:10:43,954 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:10:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 2 times [2022-04-08 11:10:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:43,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958064971] [2022-04-08 11:10:43,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:43,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:43,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701898283] [2022-04-08 11:10:43,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:10:43,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:43,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:43,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:10:43,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 11:10:44,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:10:44,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:44,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:10:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:44,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:44,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-08 11:10:44,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#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);~counter~0 := 0; {2448#true} is VALID [2022-04-08 11:10:44,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-08 11:10:44,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-08 11:10:44,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#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; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:44,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:44,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:44,268 INFO L272 TraceCheckUtils]: 8: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:10:44,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,269 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:44,269 INFO L272 TraceCheckUtils]: 13: Hoare triple {2468#(and (= main_~n~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)); {2448#true} is VALID [2022-04-08 11:10:44,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,270 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:44,271 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#(and (= main_~n~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)); {2448#true} is VALID [2022-04-08 11:10:44,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,272 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:44,272 INFO L272 TraceCheckUtils]: 23: Hoare triple {2468#(and (= main_~n~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)); {2448#true} is VALID [2022-04-08 11:10:44,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,273 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:44,273 INFO L272 TraceCheckUtils]: 28: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2448#true} is VALID [2022-04-08 11:10:44,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,274 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:10:44,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-08 11:10:44,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-08 11:10:44,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-08 11:10:44,276 INFO L272 TraceCheckUtils]: 36: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:10:44,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,277 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-08 11:10:44,284 INFO L272 TraceCheckUtils]: 41: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:10:44,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:44,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-08 11:10:44,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-08 11:10:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 11:10:44,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:10:44,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-08 11:10:44,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-08 11:10:44,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:44,493 INFO L272 TraceCheckUtils]: 41: Hoare triple {2598#(= (+ (* 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)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:10:44,493 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:10:44,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,494 INFO L272 TraceCheckUtils]: 36: Hoare triple {2598#(= (+ (* 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)); {2448#true} is VALID [2022-04-08 11:10:44,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 100);havoc #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:10:44,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:10:44,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:10:44,508 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #67#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:10:44,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,508 INFO L272 TraceCheckUtils]: 28: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2448#true} is VALID [2022-04-08 11:10:44,509 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #65#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:10:44,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,509 INFO L272 TraceCheckUtils]: 23: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:10:44,510 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #63#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:10:44,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,510 INFO L272 TraceCheckUtils]: 18: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:10:44,511 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #61#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:10:44,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,511 INFO L272 TraceCheckUtils]: 13: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2448#true} is VALID [2022-04-08 11:10:44,512 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #59#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:10:44,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-08 11:10:44,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-08 11:10:44,512 INFO L272 TraceCheckUtils]: 8: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-08 11:10:44,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:10:44,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:10:44,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#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; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-08 11:10:44,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-08 11:10:44,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-08 11:10:44,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-08 11:10:44,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#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);~counter~0 := 0; {2448#true} is VALID [2022-04-08 11:10:44,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-08 11:10:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 11:10:44,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:44,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958064971] [2022-04-08 11:10:44,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:44,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701898283] [2022-04-08 11:10:44,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701898283] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:10:44,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:10:44,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 11:10:44,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:44,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1742575937] [2022-04-08 11:10:44,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1742575937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:44,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:44,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:10:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025186556] [2022-04-08 11:10:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:44,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-08 11:10:44,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:44,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:10:44,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:44,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:10:44,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:44,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:10:44,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:10:44,565 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:10:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:44,984 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-08 11:10:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:10:44,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-08 11:10:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:10:44,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-08 11:10:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:10:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-08 11:10:44,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-08 11:10:45,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:45,071 INFO L225 Difference]: With dead ends: 78 [2022-04-08 11:10:45,071 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 11:10:45,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:10:45,072 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:45,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:10:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 11:10:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-04-08 11:10:45,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:45,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:10:45,123 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:10:45,123 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:10:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:45,127 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-08 11:10:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-08 11:10:45,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:45,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:45,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-08 11:10:45,128 INFO L87 Difference]: Start difference. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-08 11:10:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:45,131 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-08 11:10:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-08 11:10:45,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:45,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:45,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:45,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:10:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-04-08 11:10:45,135 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 45 [2022-04-08 11:10:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:45,136 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-04-08 11:10:45,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 11:10:45,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 77 transitions. [2022-04-08 11:10:45,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-08 11:10:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:10:45,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:45,219 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:10:45,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 11:10:45,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:45,428 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 3 times [2022-04-08 11:10:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:45,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1208342242] [2022-04-08 11:10:45,742 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:10:45,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:10:45,742 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 4 times [2022-04-08 11:10:45,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:45,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117566792] [2022-04-08 11:10:45,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:45,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:45,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:45,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319798120] [2022-04-08 11:10:45,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:10:45,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:45,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:45,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:10:45,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 11:10:45,826 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:10:45,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:45,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 11:10:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:45,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:46,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-08 11:10:46,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#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);~counter~0 := 0; {3167#true} is VALID [2022-04-08 11:10:46,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:46,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-08 11:10:46,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-08 11:10:46,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#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; {3167#true} is VALID [2022-04-08 11:10:46,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-08 11:10:46,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 100);havoc #t~post5; {3167#true} is VALID [2022-04-08 11:10:46,137 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:46,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:46,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:46,138 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-08 11:10:46,138 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:46,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,139 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #61#return; {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-08 11:10:46,140 INFO L272 TraceCheckUtils]: 18: Hoare triple {3225#(= (+ (* 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)); {3167#true} is VALID [2022-04-08 11:10:46,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:46,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,141 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,141 INFO L272 TraceCheckUtils]: 23: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:46,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:46,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:46,143 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3167#true} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,143 INFO L272 TraceCheckUtils]: 28: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:46,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:46,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:46,144 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-08 11:10:46,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-08 11:10:46,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(#t~post5 < 100);havoc #t~post5; {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-08 11:10:46,152 INFO L272 TraceCheckUtils]: 36: Hoare triple {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:46,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,159 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3275#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #59#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,159 INFO L272 TraceCheckUtils]: 41: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:46,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,161 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-08 11:10:46,162 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:10:46,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:46,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-08 11:10:46,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-08 11:10:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 11:10:46,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:10:46,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-08 11:10:46,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-08 11:10:46,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:46,729 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:10:46,730 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-08 11:10:46,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:10:46,731 INFO L272 TraceCheckUtils]: 41: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,732 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:10:46,733 INFO L272 TraceCheckUtils]: 36: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 100);havoc #t~post5; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,741 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:46,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:46,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:46,742 INFO L272 TraceCheckUtils]: 28: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,742 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3167#true} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:46,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:46,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:46,743 INFO L272 TraceCheckUtils]: 23: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,744 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #63#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-08 11:10:46,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:46,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:10:46,748 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,752 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3167#true} {3167#true} #61#return; {3167#true} is VALID [2022-04-08 11:10:46,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:46,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:46,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:46,753 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,753 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-08 11:10:46,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:46,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-08 11:10:46,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-08 11:10:46,754 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-08 11:10:46,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 100);havoc #t~post5; {3167#true} is VALID [2022-04-08 11:10:46,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-08 11:10:46,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#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; {3167#true} is VALID [2022-04-08 11:10:46,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-08 11:10:46,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-08 11:10:46,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-08 11:10:46,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#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);~counter~0 := 0; {3167#true} is VALID [2022-04-08 11:10:46,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-08 11:10:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 46 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 11:10:46,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:46,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117566792] [2022-04-08 11:10:46,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:46,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319798120] [2022-04-08 11:10:46,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319798120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:10:46,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:10:46,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-08 11:10:46,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:46,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1208342242] [2022-04-08 11:10:46,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1208342242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:46,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:46,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:10:46,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140411718] [2022-04-08 11:10:46,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:46,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-08 11:10:46,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:46,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 11:10:46,797 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 11:10:46,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:10:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:46,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:10:46,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:10:46,798 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 11:10:49,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:10:55,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:10:58,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:10:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:59,192 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-08 11:10:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:10:59,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-08 11:10:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 11:10:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-08 11:10:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 11:10:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-08 11:10:59,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-08 11:11:01,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:01,272 INFO L225 Difference]: With dead ends: 74 [2022-04-08 11:11:01,272 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 11:11:01,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-08 11:11:01,273 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-08 11:11:01,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 91 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 156 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-04-08 11:11:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 11:11:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 11:11:01,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:01,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 11:11:01,338 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 11:11:01,338 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 11:11:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:01,340 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-08 11:11:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-08 11:11:01,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:01,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:01,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-04-08 11:11:01,341 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-04-08 11:11:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:01,344 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-08 11:11:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-08 11:11:01,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:01,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:01,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:01,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 11:11:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-08 11:11:01,347 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 50 [2022-04-08 11:11:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:01,348 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-08 11:11:01,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 11:11:01,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 74 transitions. [2022-04-08 11:11:02,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-08 11:11:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 11:11:02,823 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:02,823 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:02,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 11:11:03,024 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:03,024 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:03,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-08 11:11:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:03,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1883685223] [2022-04-08 11:11:03,337 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:11:03,337 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:11:03,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 2 times [2022-04-08 11:11:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:03,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920750926] [2022-04-08 11:11:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:03,348 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:03,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638339691] [2022-04-08 11:11:03,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:11:03,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:03,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:03,350 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:11:03,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 11:11:03,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:11:03,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:03,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 11:11:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:03,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:04,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {3902#true} call ULTIMATE.init(); {3902#true} is VALID [2022-04-08 11:11:04,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {3902#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);~counter~0 := 0; {3902#true} is VALID [2022-04-08 11:11:04,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3902#true} {3902#true} #81#return; {3902#true} is VALID [2022-04-08 11:11:04,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {3902#true} call #t~ret6 := main(); {3902#true} is VALID [2022-04-08 11:11:04,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {3902#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; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:04,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:04,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:04,032 INFO L272 TraceCheckUtils]: 8: Hoare triple {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3902#true} is VALID [2022-04-08 11:11:04,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,033 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3902#true} {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:04,033 INFO L272 TraceCheckUtils]: 13: Hoare triple {3922#(and (= main_~x~0 0) (= main_~n~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)); {3902#true} is VALID [2022-04-08 11:11:04,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,034 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3902#true} {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:04,034 INFO L272 TraceCheckUtils]: 18: Hoare triple {3922#(and (= main_~x~0 0) (= main_~n~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)); {3902#true} is VALID [2022-04-08 11:11:04,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,035 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3902#true} {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:04,035 INFO L272 TraceCheckUtils]: 23: Hoare triple {3922#(and (= main_~x~0 0) (= main_~n~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)); {3902#true} is VALID [2022-04-08 11:11:04,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,036 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3902#true} {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:04,036 INFO L272 TraceCheckUtils]: 28: Hoare triple {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3902#true} is VALID [2022-04-08 11:11:04,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,036 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3902#true} {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:04,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {3922#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:04,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:04,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:04,038 INFO L272 TraceCheckUtils]: 36: Hoare triple {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3902#true} is VALID [2022-04-08 11:11:04,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,038 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3902#true} {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #59#return; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:04,039 INFO L272 TraceCheckUtils]: 41: Hoare triple {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3902#true} is VALID [2022-04-08 11:11:04,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,039 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3902#true} {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #61#return; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:04,039 INFO L272 TraceCheckUtils]: 46: Hoare triple {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3902#true} is VALID [2022-04-08 11:11:04,039 INFO L290 TraceCheckUtils]: 47: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,040 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3902#true} {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #63#return; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:04,040 INFO L272 TraceCheckUtils]: 51: Hoare triple {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3902#true} is VALID [2022-04-08 11:11:04,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,041 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3902#true} {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #65#return; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:04,041 INFO L272 TraceCheckUtils]: 56: Hoare triple {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3902#true} is VALID [2022-04-08 11:11:04,041 INFO L290 TraceCheckUtils]: 57: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,041 INFO L290 TraceCheckUtils]: 58: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,041 INFO L290 TraceCheckUtils]: 59: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,042 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3902#true} {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #67#return; {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:04,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {4007#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4092#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-08 11:11:04,044 INFO L272 TraceCheckUtils]: 62: Hoare triple {4092#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3902#true} is VALID [2022-04-08 11:11:04,044 INFO L290 TraceCheckUtils]: 63: Hoare triple {3902#true} ~cond := #in~cond; {3902#true} is VALID [2022-04-08 11:11:04,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {3902#true} assume !(0 == ~cond); {3902#true} is VALID [2022-04-08 11:11:04,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {3902#true} assume true; {3902#true} is VALID [2022-04-08 11:11:04,045 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3902#true} {4092#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {4092#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-08 11:11:04,046 INFO L272 TraceCheckUtils]: 67: Hoare triple {4092#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4111#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:11:04,046 INFO L290 TraceCheckUtils]: 68: Hoare triple {4111#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4115#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:04,046 INFO L290 TraceCheckUtils]: 69: Hoare triple {4115#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3903#false} is VALID [2022-04-08 11:11:04,047 INFO L290 TraceCheckUtils]: 70: Hoare triple {3903#false} assume !false; {3903#false} is VALID [2022-04-08 11:11:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 11:11:04,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:11:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:04,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920750926] [2022-04-08 11:11:04,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:11:04,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638339691] [2022-04-08 11:11:04,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638339691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:11:04,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:11:04,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 11:11:04,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:04,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1883685223] [2022-04-08 11:11:04,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1883685223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:04,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:04,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:11:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576076042] [2022-04-08 11:11:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:04,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-08 11:11:04,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:04,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:11:04,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:04,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:11:04,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:04,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:11:04,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:11:04,476 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:11:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:04,993 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-04-08 11:11:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:11:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-08 11:11:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:11:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:11:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:11:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:11:04,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-08 11:11:05,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:05,079 INFO L225 Difference]: With dead ends: 84 [2022-04-08 11:11:05,079 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 11:11:05,080 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:11:05,080 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:11:05,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 11:11:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 11:11:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-04-08 11:11:05,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:05,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:11:05,161 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:11:05,161 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:11:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:05,164 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-08 11:11:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-08 11:11:05,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:05,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:05,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 82 states. [2022-04-08 11:11:05,165 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 82 states. [2022-04-08 11:11:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:05,167 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-08 11:11:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-08 11:11:05,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:05,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:05,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:05,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 22 states have call successors, (22), 13 states have call predecessors, (22), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:11:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-04-08 11:11:05,170 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 71 [2022-04-08 11:11:05,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:05,171 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-04-08 11:11:05,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:11:05,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 92 transitions. [2022-04-08 11:11:05,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-08 11:11:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 11:11:05,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:05,313 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:05,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 11:11:05,513 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:05,513 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:05,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 3 times [2022-04-08 11:11:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:05,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1817348467] [2022-04-08 11:11:05,839 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:11:05,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:11:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 4 times [2022-04-08 11:11:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:05,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385245369] [2022-04-08 11:11:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:05,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:05,861 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:05,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499719709] [2022-04-08 11:11:05,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:11:05,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:05,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:05,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:11:05,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 11:11:05,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:11:05,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:05,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:11:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:05,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:06,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {4739#true} call ULTIMATE.init(); {4739#true} is VALID [2022-04-08 11:11:06,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {4739#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);~counter~0 := 0; {4747#(<= ~counter~0 0)} is VALID [2022-04-08 11:11:06,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {4747#(<= ~counter~0 0)} assume true; {4747#(<= ~counter~0 0)} is VALID [2022-04-08 11:11:06,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4747#(<= ~counter~0 0)} {4739#true} #81#return; {4747#(<= ~counter~0 0)} is VALID [2022-04-08 11:11:06,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {4747#(<= ~counter~0 0)} call #t~ret6 := main(); {4747#(<= ~counter~0 0)} is VALID [2022-04-08 11:11:06,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {4747#(<= ~counter~0 0)} 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; {4747#(<= ~counter~0 0)} is VALID [2022-04-08 11:11:06,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {4747#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {4763#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,281 INFO L272 TraceCheckUtils]: 8: Hoare triple {4763#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {4763#(<= ~counter~0 1)} ~cond := #in~cond; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {4763#(<= ~counter~0 1)} assume !(0 == ~cond); {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {4763#(<= ~counter~0 1)} assume true; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,282 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4763#(<= ~counter~0 1)} {4763#(<= ~counter~0 1)} #59#return; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,283 INFO L272 TraceCheckUtils]: 13: Hoare triple {4763#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {4763#(<= ~counter~0 1)} ~cond := #in~cond; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {4763#(<= ~counter~0 1)} assume !(0 == ~cond); {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {4763#(<= ~counter~0 1)} assume true; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,284 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4763#(<= ~counter~0 1)} {4763#(<= ~counter~0 1)} #61#return; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,285 INFO L272 TraceCheckUtils]: 18: Hoare triple {4763#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {4763#(<= ~counter~0 1)} ~cond := #in~cond; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {4763#(<= ~counter~0 1)} assume !(0 == ~cond); {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {4763#(<= ~counter~0 1)} assume true; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,286 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4763#(<= ~counter~0 1)} {4763#(<= ~counter~0 1)} #63#return; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,287 INFO L272 TraceCheckUtils]: 23: Hoare triple {4763#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {4763#(<= ~counter~0 1)} ~cond := #in~cond; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {4763#(<= ~counter~0 1)} assume !(0 == ~cond); {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {4763#(<= ~counter~0 1)} assume true; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,288 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4763#(<= ~counter~0 1)} {4763#(<= ~counter~0 1)} #65#return; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,289 INFO L272 TraceCheckUtils]: 28: Hoare triple {4763#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {4763#(<= ~counter~0 1)} ~cond := #in~cond; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {4763#(<= ~counter~0 1)} assume !(0 == ~cond); {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {4763#(<= ~counter~0 1)} assume true; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,290 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4763#(<= ~counter~0 1)} {4763#(<= ~counter~0 1)} #67#return; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {4763#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4763#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:06,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {4763#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {4848#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,292 INFO L272 TraceCheckUtils]: 36: Hoare triple {4848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {4848#(<= ~counter~0 2)} ~cond := #in~cond; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {4848#(<= ~counter~0 2)} assume !(0 == ~cond); {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {4848#(<= ~counter~0 2)} assume true; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,293 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4848#(<= ~counter~0 2)} {4848#(<= ~counter~0 2)} #59#return; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,293 INFO L272 TraceCheckUtils]: 41: Hoare triple {4848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {4848#(<= ~counter~0 2)} ~cond := #in~cond; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {4848#(<= ~counter~0 2)} assume !(0 == ~cond); {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {4848#(<= ~counter~0 2)} assume true; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,295 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4848#(<= ~counter~0 2)} {4848#(<= ~counter~0 2)} #61#return; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,295 INFO L272 TraceCheckUtils]: 46: Hoare triple {4848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {4848#(<= ~counter~0 2)} ~cond := #in~cond; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {4848#(<= ~counter~0 2)} assume !(0 == ~cond); {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {4848#(<= ~counter~0 2)} assume true; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,297 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4848#(<= ~counter~0 2)} {4848#(<= ~counter~0 2)} #63#return; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,297 INFO L272 TraceCheckUtils]: 51: Hoare triple {4848#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {4848#(<= ~counter~0 2)} ~cond := #in~cond; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {4848#(<= ~counter~0 2)} assume !(0 == ~cond); {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,298 INFO L290 TraceCheckUtils]: 54: Hoare triple {4848#(<= ~counter~0 2)} assume true; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,299 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4848#(<= ~counter~0 2)} {4848#(<= ~counter~0 2)} #65#return; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,299 INFO L272 TraceCheckUtils]: 56: Hoare triple {4848#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,300 INFO L290 TraceCheckUtils]: 57: Hoare triple {4848#(<= ~counter~0 2)} ~cond := #in~cond; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,300 INFO L290 TraceCheckUtils]: 58: Hoare triple {4848#(<= ~counter~0 2)} assume !(0 == ~cond); {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,300 INFO L290 TraceCheckUtils]: 59: Hoare triple {4848#(<= ~counter~0 2)} assume true; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,301 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4848#(<= ~counter~0 2)} {4848#(<= ~counter~0 2)} #67#return; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,301 INFO L290 TraceCheckUtils]: 61: Hoare triple {4848#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4848#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:06,302 INFO L290 TraceCheckUtils]: 62: Hoare triple {4848#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4933#(<= |main_#t~post5| 2)} is VALID [2022-04-08 11:11:06,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {4933#(<= |main_#t~post5| 2)} assume !(#t~post5 < 100);havoc #t~post5; {4740#false} is VALID [2022-04-08 11:11:06,302 INFO L272 TraceCheckUtils]: 64: Hoare triple {4740#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4740#false} is VALID [2022-04-08 11:11:06,302 INFO L290 TraceCheckUtils]: 65: Hoare triple {4740#false} ~cond := #in~cond; {4740#false} is VALID [2022-04-08 11:11:06,302 INFO L290 TraceCheckUtils]: 66: Hoare triple {4740#false} assume !(0 == ~cond); {4740#false} is VALID [2022-04-08 11:11:06,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {4740#false} assume true; {4740#false} is VALID [2022-04-08 11:11:06,302 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4740#false} {4740#false} #69#return; {4740#false} is VALID [2022-04-08 11:11:06,303 INFO L272 TraceCheckUtils]: 69: Hoare triple {4740#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4740#false} is VALID [2022-04-08 11:11:06,303 INFO L290 TraceCheckUtils]: 70: Hoare triple {4740#false} ~cond := #in~cond; {4740#false} is VALID [2022-04-08 11:11:06,303 INFO L290 TraceCheckUtils]: 71: Hoare triple {4740#false} assume 0 == ~cond; {4740#false} is VALID [2022-04-08 11:11:06,303 INFO L290 TraceCheckUtils]: 72: Hoare triple {4740#false} assume !false; {4740#false} is VALID [2022-04-08 11:11:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 60 proven. 112 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-08 11:11:06,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:11:06,573 INFO L290 TraceCheckUtils]: 72: Hoare triple {4740#false} assume !false; {4740#false} is VALID [2022-04-08 11:11:06,573 INFO L290 TraceCheckUtils]: 71: Hoare triple {4740#false} assume 0 == ~cond; {4740#false} is VALID [2022-04-08 11:11:06,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {4740#false} ~cond := #in~cond; {4740#false} is VALID [2022-04-08 11:11:06,574 INFO L272 TraceCheckUtils]: 69: Hoare triple {4740#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4740#false} is VALID [2022-04-08 11:11:06,574 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4739#true} {4740#false} #69#return; {4740#false} is VALID [2022-04-08 11:11:06,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,574 INFO L272 TraceCheckUtils]: 64: Hoare triple {4740#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,574 INFO L290 TraceCheckUtils]: 63: Hoare triple {4991#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {4740#false} is VALID [2022-04-08 11:11:06,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {4995#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4991#(< |main_#t~post5| 100)} is VALID [2022-04-08 11:11:06,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {4995#(< ~counter~0 100)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4995#(< ~counter~0 100)} is VALID [2022-04-08 11:11:06,576 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4739#true} {4995#(< ~counter~0 100)} #67#return; {4995#(< ~counter~0 100)} is VALID [2022-04-08 11:11:06,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,576 INFO L272 TraceCheckUtils]: 56: Hoare triple {4995#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,577 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4739#true} {4995#(< ~counter~0 100)} #65#return; {4995#(< ~counter~0 100)} is VALID [2022-04-08 11:11:06,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,577 INFO L272 TraceCheckUtils]: 51: Hoare triple {4995#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,578 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4739#true} {4995#(< ~counter~0 100)} #63#return; {4995#(< ~counter~0 100)} is VALID [2022-04-08 11:11:06,578 INFO L290 TraceCheckUtils]: 49: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,578 INFO L272 TraceCheckUtils]: 46: Hoare triple {4995#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,578 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4739#true} {4995#(< ~counter~0 100)} #61#return; {4995#(< ~counter~0 100)} is VALID [2022-04-08 11:11:06,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,579 INFO L272 TraceCheckUtils]: 41: Hoare triple {4995#(< ~counter~0 100)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,579 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4739#true} {4995#(< ~counter~0 100)} #59#return; {4995#(< ~counter~0 100)} is VALID [2022-04-08 11:11:06,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,580 INFO L272 TraceCheckUtils]: 36: Hoare triple {4995#(< ~counter~0 100)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {4995#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {4995#(< ~counter~0 100)} is VALID [2022-04-08 11:11:06,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {5080#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4995#(< ~counter~0 100)} is VALID [2022-04-08 11:11:06,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {5080#(< ~counter~0 99)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5080#(< ~counter~0 99)} is VALID [2022-04-08 11:11:06,581 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4739#true} {5080#(< ~counter~0 99)} #67#return; {5080#(< ~counter~0 99)} is VALID [2022-04-08 11:11:06,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,582 INFO L272 TraceCheckUtils]: 28: Hoare triple {5080#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,582 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4739#true} {5080#(< ~counter~0 99)} #65#return; {5080#(< ~counter~0 99)} is VALID [2022-04-08 11:11:06,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,583 INFO L272 TraceCheckUtils]: 23: Hoare triple {5080#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,583 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4739#true} {5080#(< ~counter~0 99)} #63#return; {5080#(< ~counter~0 99)} is VALID [2022-04-08 11:11:06,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,584 INFO L272 TraceCheckUtils]: 18: Hoare triple {5080#(< ~counter~0 99)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,584 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4739#true} {5080#(< ~counter~0 99)} #61#return; {5080#(< ~counter~0 99)} is VALID [2022-04-08 11:11:06,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,585 INFO L272 TraceCheckUtils]: 13: Hoare triple {5080#(< ~counter~0 99)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,585 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4739#true} {5080#(< ~counter~0 99)} #59#return; {5080#(< ~counter~0 99)} is VALID [2022-04-08 11:11:06,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-08 11:11:06,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-08 11:11:06,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-08 11:11:06,585 INFO L272 TraceCheckUtils]: 8: Hoare triple {5080#(< ~counter~0 99)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4739#true} is VALID [2022-04-08 11:11:06,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {5080#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {5080#(< ~counter~0 99)} is VALID [2022-04-08 11:11:06,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {5165#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5080#(< ~counter~0 99)} is VALID [2022-04-08 11:11:06,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {5165#(< ~counter~0 98)} 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; {5165#(< ~counter~0 98)} is VALID [2022-04-08 11:11:06,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {5165#(< ~counter~0 98)} call #t~ret6 := main(); {5165#(< ~counter~0 98)} is VALID [2022-04-08 11:11:06,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5165#(< ~counter~0 98)} {4739#true} #81#return; {5165#(< ~counter~0 98)} is VALID [2022-04-08 11:11:06,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {5165#(< ~counter~0 98)} assume true; {5165#(< ~counter~0 98)} is VALID [2022-04-08 11:11:06,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {4739#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);~counter~0 := 0; {5165#(< ~counter~0 98)} is VALID [2022-04-08 11:11:06,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {4739#true} call ULTIMATE.init(); {4739#true} is VALID [2022-04-08 11:11:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 11:11:06,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:06,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385245369] [2022-04-08 11:11:06,590 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:11:06,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499719709] [2022-04-08 11:11:06,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499719709] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:11:06,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:11:06,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:11:06,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:06,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1817348467] [2022-04-08 11:11:06,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1817348467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:06,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:06,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:11:06,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921505073] [2022-04-08 11:11:06,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:06,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-08 11:11:06,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:06,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:11:06,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:06,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:11:06,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:06,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:11:06,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:11:06,633 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:11:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:07,190 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-04-08 11:11:07,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:11:07,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-08 11:11:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:11:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 11:11:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:11:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 11:11:07,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-08 11:11:07,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:07,275 INFO L225 Difference]: With dead ends: 111 [2022-04-08 11:11:07,276 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 11:11:07,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:11:07,277 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:11:07,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 128 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:11:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 11:11:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-04-08 11:11:07,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:07,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:11:07,366 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:11:07,366 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:11:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:07,368 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:11:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 11:11:07,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:07,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:07,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 96 states. [2022-04-08 11:11:07,369 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 96 states. [2022-04-08 11:11:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:07,371 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:11:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 11:11:07,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:07,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:07,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:07,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 states have internal predecessors, (60), 23 states have call successors, (23), 16 states have call predecessors, (23), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:11:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-04-08 11:11:07,374 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 73 [2022-04-08 11:11:07,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:07,375 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-04-08 11:11:07,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 11:11:07,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 103 transitions. [2022-04-08 11:11:09,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 102 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-04-08 11:11:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 11:11:09,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:09,528 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:09,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 11:11:09,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 11:11:09,735 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:09,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-08 11:11:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:09,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1317156650] [2022-04-08 11:11:10,054 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:11:10,054 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:11:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 2 times [2022-04-08 11:11:10,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:10,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696420328] [2022-04-08 11:11:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:10,064 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:10,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30709126] [2022-04-08 11:11:10,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:11:10,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:10,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:10,076 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:11:10,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 11:11:10,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:11:10,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:10,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:11:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:10,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:10,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {5792#true} call ULTIMATE.init(); {5792#true} is VALID [2022-04-08 11:11:10,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {5792#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);~counter~0 := 0; {5792#true} is VALID [2022-04-08 11:11:10,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5792#true} {5792#true} #81#return; {5792#true} is VALID [2022-04-08 11:11:10,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {5792#true} call #t~ret6 := main(); {5792#true} is VALID [2022-04-08 11:11:10,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {5792#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; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:11:10,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:11:10,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 100);havoc #t~post5; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:11:10,788 INFO L272 TraceCheckUtils]: 8: Hoare triple {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,789 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5792#true} {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:11:10,789 INFO L272 TraceCheckUtils]: 13: Hoare triple {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,789 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5792#true} {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:11:10,789 INFO L272 TraceCheckUtils]: 18: Hoare triple {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,790 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5792#true} {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:11:10,790 INFO L272 TraceCheckUtils]: 23: Hoare triple {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,791 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5792#true} {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:11:10,791 INFO L272 TraceCheckUtils]: 28: Hoare triple {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,792 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5792#true} {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-08 11:11:10,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {5812#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:10,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:10,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:10,793 INFO L272 TraceCheckUtils]: 36: Hoare triple {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,794 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5792#true} {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:10,794 INFO L272 TraceCheckUtils]: 41: Hoare triple {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,795 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5792#true} {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:10,795 INFO L272 TraceCheckUtils]: 46: Hoare triple {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,796 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5792#true} {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:10,796 INFO L272 TraceCheckUtils]: 51: Hoare triple {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,796 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5792#true} {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:10,796 INFO L272 TraceCheckUtils]: 56: Hoare triple {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,797 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5792#true} {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-08 11:11:10,798 INFO L290 TraceCheckUtils]: 61: Hoare triple {5897#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {5982#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-08 11:11:10,798 INFO L272 TraceCheckUtils]: 62: Hoare triple {5982#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,798 INFO L290 TraceCheckUtils]: 63: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,798 INFO L290 TraceCheckUtils]: 64: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,798 INFO L290 TraceCheckUtils]: 65: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,799 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5792#true} {5982#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {5982#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-08 11:11:10,800 INFO L272 TraceCheckUtils]: 67: Hoare triple {5982#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5792#true} is VALID [2022-04-08 11:11:10,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {5792#true} ~cond := #in~cond; {5792#true} is VALID [2022-04-08 11:11:10,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {5792#true} assume !(0 == ~cond); {5792#true} is VALID [2022-04-08 11:11:10,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {5792#true} assume true; {5792#true} is VALID [2022-04-08 11:11:10,801 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5792#true} {5982#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {5982#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-08 11:11:10,802 INFO L272 TraceCheckUtils]: 72: Hoare triple {5982#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:11:10,803 INFO L290 TraceCheckUtils]: 73: Hoare triple {6016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:10,803 INFO L290 TraceCheckUtils]: 74: Hoare triple {6020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5793#false} is VALID [2022-04-08 11:11:10,803 INFO L290 TraceCheckUtils]: 75: Hoare triple {5793#false} assume !false; {5793#false} is VALID [2022-04-08 11:11:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 11:11:10,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:11:11,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:11,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696420328] [2022-04-08 11:11:11,915 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:11:11,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30709126] [2022-04-08 11:11:11,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30709126] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:11:11,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:11:11,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 11:11:11,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:11,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1317156650] [2022-04-08 11:11:11,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1317156650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:11,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:11,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:11:11,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028369742] [2022-04-08 11:11:11,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:11,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-08 11:11:11,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:11,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:11:11,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:11,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:11:11,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:11,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:11:11,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:11:11,958 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:11:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:12,444 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:11:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:11:12,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-08 11:11:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:11:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:11:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:11:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 11:11:12,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-08 11:11:12,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:12,509 INFO L225 Difference]: With dead ends: 96 [2022-04-08 11:11:12,509 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 11:11:12,510 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:11:12,510 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:11:12,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:11:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 11:11:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-08 11:11:12,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:12,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:11:12,588 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:11:12,588 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:11:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:12,590 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-08 11:11:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-08 11:11:12,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:12,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:12,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 85 states. [2022-04-08 11:11:12,591 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 85 states. [2022-04-08 11:11:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:12,593 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-04-08 11:11:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-08 11:11:12,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:12,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:12,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:12,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:11:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-04-08 11:11:12,595 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 76 [2022-04-08 11:11:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:12,595 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-04-08 11:11:12,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 11:11:12,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 92 transitions. [2022-04-08 11:11:12,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-04-08 11:11:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 11:11:12,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:12,726 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:12,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 11:11:12,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:12,932 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:12,932 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 3 times [2022-04-08 11:11:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:12,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864477448] [2022-04-08 11:11:13,258 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:11:13,259 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:11:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 4 times [2022-04-08 11:11:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:13,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221467232] [2022-04-08 11:11:13,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:13,269 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:13,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747210699] [2022-04-08 11:11:13,270 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:11:13,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:13,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:13,284 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:11:13,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 11:11:13,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:11:13,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:13,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 11:11:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:13,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:14,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {6697#true} call ULTIMATE.init(); {6697#true} is VALID [2022-04-08 11:11:14,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {6697#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);~counter~0 := 0; {6697#true} is VALID [2022-04-08 11:11:14,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6697#true} {6697#true} #81#return; {6697#true} is VALID [2022-04-08 11:11:14,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {6697#true} call #t~ret6 := main(); {6697#true} is VALID [2022-04-08 11:11:14,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {6697#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; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:14,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:14,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:14,065 INFO L272 TraceCheckUtils]: 8: Hoare triple {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,066 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6697#true} {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:14,066 INFO L272 TraceCheckUtils]: 13: Hoare triple {6717#(and (= main_~x~0 0) (= main_~n~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)); {6697#true} is VALID [2022-04-08 11:11:14,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,067 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6697#true} {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:14,067 INFO L272 TraceCheckUtils]: 18: Hoare triple {6717#(and (= main_~x~0 0) (= main_~n~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)); {6697#true} is VALID [2022-04-08 11:11:14,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,069 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6697#true} {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:14,069 INFO L272 TraceCheckUtils]: 23: Hoare triple {6717#(and (= main_~x~0 0) (= main_~n~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)); {6697#true} is VALID [2022-04-08 11:11:14,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,070 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6697#true} {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:14,070 INFO L272 TraceCheckUtils]: 28: Hoare triple {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,073 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6697#true} {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-08 11:11:14,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {6717#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:11:14,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:11:14,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:11:14,078 INFO L272 TraceCheckUtils]: 36: Hoare triple {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,082 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6697#true} {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #59#return; {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:11:14,083 INFO L272 TraceCheckUtils]: 41: Hoare triple {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,083 INFO L290 TraceCheckUtils]: 43: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,083 INFO L290 TraceCheckUtils]: 44: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,083 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6697#true} {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #61#return; {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:11:14,083 INFO L272 TraceCheckUtils]: 46: Hoare triple {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,084 INFO L290 TraceCheckUtils]: 49: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,084 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6697#true} {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #63#return; {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:11:14,084 INFO L272 TraceCheckUtils]: 51: Hoare triple {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {6697#true} ~cond := #in~cond; {6860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:14,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {6860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:11:14,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {6864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:11:14,085 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6864#(not (= |__VERIFIER_assert_#in~cond| 0))} {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #65#return; {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:11:14,086 INFO L272 TraceCheckUtils]: 56: Hoare triple {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,086 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6697#true} {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #67#return; {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-08 11:11:14,087 INFO L290 TraceCheckUtils]: 61: Hoare triple {6802#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:11:14,087 INFO L290 TraceCheckUtils]: 62: Hoare triple {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:11:14,088 INFO L290 TraceCheckUtils]: 63: Hoare triple {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:11:14,088 INFO L272 TraceCheckUtils]: 64: Hoare triple {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,088 INFO L290 TraceCheckUtils]: 67: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,089 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6697#true} {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #59#return; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:11:14,089 INFO L272 TraceCheckUtils]: 69: Hoare triple {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,089 INFO L290 TraceCheckUtils]: 70: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,089 INFO L290 TraceCheckUtils]: 71: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,089 INFO L290 TraceCheckUtils]: 72: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,089 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6697#true} {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #61#return; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:11:14,090 INFO L272 TraceCheckUtils]: 74: Hoare triple {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,090 INFO L290 TraceCheckUtils]: 75: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,090 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6697#true} {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #63#return; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:11:14,090 INFO L272 TraceCheckUtils]: 79: Hoare triple {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,090 INFO L290 TraceCheckUtils]: 80: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,090 INFO L290 TraceCheckUtils]: 81: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,091 INFO L290 TraceCheckUtils]: 82: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,091 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6697#true} {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #65#return; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:11:14,091 INFO L272 TraceCheckUtils]: 84: Hoare triple {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,091 INFO L290 TraceCheckUtils]: 85: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,091 INFO L290 TraceCheckUtils]: 86: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,091 INFO L290 TraceCheckUtils]: 87: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,092 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6697#true} {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} #67#return; {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} is VALID [2022-04-08 11:11:14,092 INFO L290 TraceCheckUtils]: 89: Hoare triple {6889#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1))} assume !(~n~0 <= ~a~0); {6974#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-08 11:11:14,092 INFO L272 TraceCheckUtils]: 90: Hoare triple {6974#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6697#true} is VALID [2022-04-08 11:11:14,092 INFO L290 TraceCheckUtils]: 91: Hoare triple {6697#true} ~cond := #in~cond; {6697#true} is VALID [2022-04-08 11:11:14,093 INFO L290 TraceCheckUtils]: 92: Hoare triple {6697#true} assume !(0 == ~cond); {6697#true} is VALID [2022-04-08 11:11:14,093 INFO L290 TraceCheckUtils]: 93: Hoare triple {6697#true} assume true; {6697#true} is VALID [2022-04-08 11:11:14,093 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6697#true} {6974#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} #69#return; {6974#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} is VALID [2022-04-08 11:11:14,094 INFO L272 TraceCheckUtils]: 95: Hoare triple {6974#(and (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~x~0 (- 7)) 1) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6993#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:11:14,094 INFO L290 TraceCheckUtils]: 96: Hoare triple {6993#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6997#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:14,094 INFO L290 TraceCheckUtils]: 97: Hoare triple {6997#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6698#false} is VALID [2022-04-08 11:11:14,094 INFO L290 TraceCheckUtils]: 98: Hoare triple {6698#false} assume !false; {6698#false} is VALID [2022-04-08 11:11:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 55 proven. 46 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-08 11:11:14,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:11:14,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:14,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221467232] [2022-04-08 11:11:14,496 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:11:14,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747210699] [2022-04-08 11:11:14,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747210699] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:11:14,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:11:14,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 11:11:14,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:14,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864477448] [2022-04-08 11:11:14,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864477448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:14,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:14,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:11:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136383589] [2022-04-08 11:11:14,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:14,497 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-08 11:11:14,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:14,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:11:14,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:14,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:11:14,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:14,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:11:14,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:11:14,550 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:11:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:15,572 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-04-08 11:11:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:11:15,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-08 11:11:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:11:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-08 11:11:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:11:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-08 11:11:15,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-08 11:11:15,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:15,662 INFO L225 Difference]: With dead ends: 100 [2022-04-08 11:11:15,662 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 11:11:15,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-08 11:11:15,663 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:11:15,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 11:11:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 11:11:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-08 11:11:15,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:15,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:11:15,762 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:11:15,762 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:11:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:15,764 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-08 11:11:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-08 11:11:15,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:15,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:15,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 98 states. [2022-04-08 11:11:15,765 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 98 states. [2022-04-08 11:11:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:15,767 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-04-08 11:11:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-04-08 11:11:15,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:15,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:15,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:15,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:11:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2022-04-08 11:11:15,770 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 99 [2022-04-08 11:11:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:15,770 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2022-04-08 11:11:15,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:11:15,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 111 transitions. [2022-04-08 11:11:15,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-04-08 11:11:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 11:11:15,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:15,926 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:15,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 11:11:16,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 11:11:16,127 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:16,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 5 times [2022-04-08 11:11:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:16,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1579979706] [2022-04-08 11:11:16,371 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:11:16,372 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:11:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 6 times [2022-04-08 11:11:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:16,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267940691] [2022-04-08 11:11:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:16,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:16,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097232256] [2022-04-08 11:11:16,386 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:11:16,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:16,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:16,391 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:11:16,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 11:11:16,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 11:11:16,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:16,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:11:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:16,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:17,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {7719#true} call ULTIMATE.init(); {7719#true} is VALID [2022-04-08 11:11:17,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {7719#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);~counter~0 := 0; {7727#(<= ~counter~0 0)} is VALID [2022-04-08 11:11:17,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {7727#(<= ~counter~0 0)} assume true; {7727#(<= ~counter~0 0)} is VALID [2022-04-08 11:11:17,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7727#(<= ~counter~0 0)} {7719#true} #81#return; {7727#(<= ~counter~0 0)} is VALID [2022-04-08 11:11:17,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {7727#(<= ~counter~0 0)} call #t~ret6 := main(); {7727#(<= ~counter~0 0)} is VALID [2022-04-08 11:11:17,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {7727#(<= ~counter~0 0)} 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; {7727#(<= ~counter~0 0)} is VALID [2022-04-08 11:11:17,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {7727#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {7743#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,054 INFO L272 TraceCheckUtils]: 8: Hoare triple {7743#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {7743#(<= ~counter~0 1)} ~cond := #in~cond; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {7743#(<= ~counter~0 1)} assume !(0 == ~cond); {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {7743#(<= ~counter~0 1)} assume true; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,055 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7743#(<= ~counter~0 1)} {7743#(<= ~counter~0 1)} #59#return; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,056 INFO L272 TraceCheckUtils]: 13: Hoare triple {7743#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {7743#(<= ~counter~0 1)} ~cond := #in~cond; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {7743#(<= ~counter~0 1)} assume !(0 == ~cond); {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {7743#(<= ~counter~0 1)} assume true; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,057 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7743#(<= ~counter~0 1)} {7743#(<= ~counter~0 1)} #61#return; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,057 INFO L272 TraceCheckUtils]: 18: Hoare triple {7743#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {7743#(<= ~counter~0 1)} ~cond := #in~cond; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {7743#(<= ~counter~0 1)} assume !(0 == ~cond); {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {7743#(<= ~counter~0 1)} assume true; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,059 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7743#(<= ~counter~0 1)} {7743#(<= ~counter~0 1)} #63#return; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,059 INFO L272 TraceCheckUtils]: 23: Hoare triple {7743#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {7743#(<= ~counter~0 1)} ~cond := #in~cond; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {7743#(<= ~counter~0 1)} assume !(0 == ~cond); {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {7743#(<= ~counter~0 1)} assume true; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,060 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7743#(<= ~counter~0 1)} {7743#(<= ~counter~0 1)} #65#return; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,061 INFO L272 TraceCheckUtils]: 28: Hoare triple {7743#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {7743#(<= ~counter~0 1)} ~cond := #in~cond; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {7743#(<= ~counter~0 1)} assume !(0 == ~cond); {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {7743#(<= ~counter~0 1)} assume true; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,062 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7743#(<= ~counter~0 1)} {7743#(<= ~counter~0 1)} #67#return; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {7743#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7743#(<= ~counter~0 1)} is VALID [2022-04-08 11:11:17,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {7743#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {7828#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,064 INFO L272 TraceCheckUtils]: 36: Hoare triple {7828#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {7828#(<= ~counter~0 2)} ~cond := #in~cond; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {7828#(<= ~counter~0 2)} assume !(0 == ~cond); {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {7828#(<= ~counter~0 2)} assume true; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,065 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7828#(<= ~counter~0 2)} {7828#(<= ~counter~0 2)} #59#return; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,065 INFO L272 TraceCheckUtils]: 41: Hoare triple {7828#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {7828#(<= ~counter~0 2)} ~cond := #in~cond; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {7828#(<= ~counter~0 2)} assume !(0 == ~cond); {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {7828#(<= ~counter~0 2)} assume true; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,067 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7828#(<= ~counter~0 2)} {7828#(<= ~counter~0 2)} #61#return; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,067 INFO L272 TraceCheckUtils]: 46: Hoare triple {7828#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {7828#(<= ~counter~0 2)} ~cond := #in~cond; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {7828#(<= ~counter~0 2)} assume !(0 == ~cond); {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {7828#(<= ~counter~0 2)} assume true; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,076 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7828#(<= ~counter~0 2)} {7828#(<= ~counter~0 2)} #63#return; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,077 INFO L272 TraceCheckUtils]: 51: Hoare triple {7828#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {7828#(<= ~counter~0 2)} ~cond := #in~cond; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,078 INFO L290 TraceCheckUtils]: 53: Hoare triple {7828#(<= ~counter~0 2)} assume !(0 == ~cond); {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,078 INFO L290 TraceCheckUtils]: 54: Hoare triple {7828#(<= ~counter~0 2)} assume true; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,079 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7828#(<= ~counter~0 2)} {7828#(<= ~counter~0 2)} #65#return; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,079 INFO L272 TraceCheckUtils]: 56: Hoare triple {7828#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,080 INFO L290 TraceCheckUtils]: 57: Hoare triple {7828#(<= ~counter~0 2)} ~cond := #in~cond; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,080 INFO L290 TraceCheckUtils]: 58: Hoare triple {7828#(<= ~counter~0 2)} assume !(0 == ~cond); {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,081 INFO L290 TraceCheckUtils]: 59: Hoare triple {7828#(<= ~counter~0 2)} assume true; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,081 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7828#(<= ~counter~0 2)} {7828#(<= ~counter~0 2)} #67#return; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,082 INFO L290 TraceCheckUtils]: 61: Hoare triple {7828#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7828#(<= ~counter~0 2)} is VALID [2022-04-08 11:11:17,082 INFO L290 TraceCheckUtils]: 62: Hoare triple {7828#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,083 INFO L290 TraceCheckUtils]: 63: Hoare triple {7913#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,083 INFO L272 TraceCheckUtils]: 64: Hoare triple {7913#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,084 INFO L290 TraceCheckUtils]: 65: Hoare triple {7913#(<= ~counter~0 3)} ~cond := #in~cond; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,084 INFO L290 TraceCheckUtils]: 66: Hoare triple {7913#(<= ~counter~0 3)} assume !(0 == ~cond); {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,085 INFO L290 TraceCheckUtils]: 67: Hoare triple {7913#(<= ~counter~0 3)} assume true; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,085 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7913#(<= ~counter~0 3)} {7913#(<= ~counter~0 3)} #59#return; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,086 INFO L272 TraceCheckUtils]: 69: Hoare triple {7913#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,086 INFO L290 TraceCheckUtils]: 70: Hoare triple {7913#(<= ~counter~0 3)} ~cond := #in~cond; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,087 INFO L290 TraceCheckUtils]: 71: Hoare triple {7913#(<= ~counter~0 3)} assume !(0 == ~cond); {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,087 INFO L290 TraceCheckUtils]: 72: Hoare triple {7913#(<= ~counter~0 3)} assume true; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,088 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7913#(<= ~counter~0 3)} {7913#(<= ~counter~0 3)} #61#return; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,088 INFO L272 TraceCheckUtils]: 74: Hoare triple {7913#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,089 INFO L290 TraceCheckUtils]: 75: Hoare triple {7913#(<= ~counter~0 3)} ~cond := #in~cond; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,089 INFO L290 TraceCheckUtils]: 76: Hoare triple {7913#(<= ~counter~0 3)} assume !(0 == ~cond); {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {7913#(<= ~counter~0 3)} assume true; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,090 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7913#(<= ~counter~0 3)} {7913#(<= ~counter~0 3)} #63#return; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,091 INFO L272 TraceCheckUtils]: 79: Hoare triple {7913#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,091 INFO L290 TraceCheckUtils]: 80: Hoare triple {7913#(<= ~counter~0 3)} ~cond := #in~cond; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,092 INFO L290 TraceCheckUtils]: 81: Hoare triple {7913#(<= ~counter~0 3)} assume !(0 == ~cond); {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,092 INFO L290 TraceCheckUtils]: 82: Hoare triple {7913#(<= ~counter~0 3)} assume true; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,093 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7913#(<= ~counter~0 3)} {7913#(<= ~counter~0 3)} #65#return; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,093 INFO L272 TraceCheckUtils]: 84: Hoare triple {7913#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,094 INFO L290 TraceCheckUtils]: 85: Hoare triple {7913#(<= ~counter~0 3)} ~cond := #in~cond; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,094 INFO L290 TraceCheckUtils]: 86: Hoare triple {7913#(<= ~counter~0 3)} assume !(0 == ~cond); {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,094 INFO L290 TraceCheckUtils]: 87: Hoare triple {7913#(<= ~counter~0 3)} assume true; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,095 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7913#(<= ~counter~0 3)} {7913#(<= ~counter~0 3)} #67#return; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,095 INFO L290 TraceCheckUtils]: 89: Hoare triple {7913#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7913#(<= ~counter~0 3)} is VALID [2022-04-08 11:11:17,096 INFO L290 TraceCheckUtils]: 90: Hoare triple {7913#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7998#(<= |main_#t~post5| 3)} is VALID [2022-04-08 11:11:17,096 INFO L290 TraceCheckUtils]: 91: Hoare triple {7998#(<= |main_#t~post5| 3)} assume !(#t~post5 < 100);havoc #t~post5; {7720#false} is VALID [2022-04-08 11:11:17,096 INFO L272 TraceCheckUtils]: 92: Hoare triple {7720#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7720#false} is VALID [2022-04-08 11:11:17,096 INFO L290 TraceCheckUtils]: 93: Hoare triple {7720#false} ~cond := #in~cond; {7720#false} is VALID [2022-04-08 11:11:17,097 INFO L290 TraceCheckUtils]: 94: Hoare triple {7720#false} assume !(0 == ~cond); {7720#false} is VALID [2022-04-08 11:11:17,097 INFO L290 TraceCheckUtils]: 95: Hoare triple {7720#false} assume true; {7720#false} is VALID [2022-04-08 11:11:17,097 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7720#false} {7720#false} #69#return; {7720#false} is VALID [2022-04-08 11:11:17,097 INFO L272 TraceCheckUtils]: 97: Hoare triple {7720#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7720#false} is VALID [2022-04-08 11:11:17,097 INFO L290 TraceCheckUtils]: 98: Hoare triple {7720#false} ~cond := #in~cond; {7720#false} is VALID [2022-04-08 11:11:17,097 INFO L290 TraceCheckUtils]: 99: Hoare triple {7720#false} assume 0 == ~cond; {7720#false} is VALID [2022-04-08 11:11:17,097 INFO L290 TraceCheckUtils]: 100: Hoare triple {7720#false} assume !false; {7720#false} is VALID [2022-04-08 11:11:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 90 proven. 330 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-04-08 11:11:17,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:11:17,496 INFO L290 TraceCheckUtils]: 100: Hoare triple {7720#false} assume !false; {7720#false} is VALID [2022-04-08 11:11:17,496 INFO L290 TraceCheckUtils]: 99: Hoare triple {7720#false} assume 0 == ~cond; {7720#false} is VALID [2022-04-08 11:11:17,496 INFO L290 TraceCheckUtils]: 98: Hoare triple {7720#false} ~cond := #in~cond; {7720#false} is VALID [2022-04-08 11:11:17,496 INFO L272 TraceCheckUtils]: 97: Hoare triple {7720#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {7720#false} is VALID [2022-04-08 11:11:17,496 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {7719#true} {7720#false} #69#return; {7720#false} is VALID [2022-04-08 11:11:17,497 INFO L290 TraceCheckUtils]: 95: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,497 INFO L290 TraceCheckUtils]: 94: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,497 INFO L290 TraceCheckUtils]: 93: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,497 INFO L272 TraceCheckUtils]: 92: Hoare triple {7720#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,497 INFO L290 TraceCheckUtils]: 91: Hoare triple {8056#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {7720#false} is VALID [2022-04-08 11:11:17,497 INFO L290 TraceCheckUtils]: 90: Hoare triple {8060#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8056#(< |main_#t~post5| 100)} is VALID [2022-04-08 11:11:17,498 INFO L290 TraceCheckUtils]: 89: Hoare triple {8060#(< ~counter~0 100)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8060#(< ~counter~0 100)} is VALID [2022-04-08 11:11:17,498 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7719#true} {8060#(< ~counter~0 100)} #67#return; {8060#(< ~counter~0 100)} is VALID [2022-04-08 11:11:17,498 INFO L290 TraceCheckUtils]: 87: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,498 INFO L290 TraceCheckUtils]: 86: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,498 INFO L290 TraceCheckUtils]: 85: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,498 INFO L272 TraceCheckUtils]: 84: Hoare triple {8060#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,499 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7719#true} {8060#(< ~counter~0 100)} #65#return; {8060#(< ~counter~0 100)} is VALID [2022-04-08 11:11:17,499 INFO L290 TraceCheckUtils]: 82: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,499 INFO L290 TraceCheckUtils]: 81: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,499 INFO L290 TraceCheckUtils]: 80: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,499 INFO L272 TraceCheckUtils]: 79: Hoare triple {8060#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,500 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7719#true} {8060#(< ~counter~0 100)} #63#return; {8060#(< ~counter~0 100)} is VALID [2022-04-08 11:11:17,500 INFO L290 TraceCheckUtils]: 77: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,500 INFO L290 TraceCheckUtils]: 76: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,500 INFO L290 TraceCheckUtils]: 75: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,500 INFO L272 TraceCheckUtils]: 74: Hoare triple {8060#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,500 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7719#true} {8060#(< ~counter~0 100)} #61#return; {8060#(< ~counter~0 100)} is VALID [2022-04-08 11:11:17,500 INFO L290 TraceCheckUtils]: 72: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,501 INFO L290 TraceCheckUtils]: 70: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,501 INFO L272 TraceCheckUtils]: 69: Hoare triple {8060#(< ~counter~0 100)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,501 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7719#true} {8060#(< ~counter~0 100)} #59#return; {8060#(< ~counter~0 100)} is VALID [2022-04-08 11:11:17,501 INFO L290 TraceCheckUtils]: 67: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,501 INFO L272 TraceCheckUtils]: 64: Hoare triple {8060#(< ~counter~0 100)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {8060#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {8060#(< ~counter~0 100)} is VALID [2022-04-08 11:11:17,502 INFO L290 TraceCheckUtils]: 62: Hoare triple {8145#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8060#(< ~counter~0 100)} is VALID [2022-04-08 11:11:17,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {8145#(< ~counter~0 99)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8145#(< ~counter~0 99)} is VALID [2022-04-08 11:11:17,503 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7719#true} {8145#(< ~counter~0 99)} #67#return; {8145#(< ~counter~0 99)} is VALID [2022-04-08 11:11:17,503 INFO L290 TraceCheckUtils]: 59: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,503 INFO L290 TraceCheckUtils]: 58: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,503 INFO L290 TraceCheckUtils]: 57: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,503 INFO L272 TraceCheckUtils]: 56: Hoare triple {8145#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,504 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7719#true} {8145#(< ~counter~0 99)} #65#return; {8145#(< ~counter~0 99)} is VALID [2022-04-08 11:11:17,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,504 INFO L272 TraceCheckUtils]: 51: Hoare triple {8145#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,505 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7719#true} {8145#(< ~counter~0 99)} #63#return; {8145#(< ~counter~0 99)} is VALID [2022-04-08 11:11:17,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,505 INFO L272 TraceCheckUtils]: 46: Hoare triple {8145#(< ~counter~0 99)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,506 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7719#true} {8145#(< ~counter~0 99)} #61#return; {8145#(< ~counter~0 99)} is VALID [2022-04-08 11:11:17,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,506 INFO L290 TraceCheckUtils]: 43: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,506 INFO L272 TraceCheckUtils]: 41: Hoare triple {8145#(< ~counter~0 99)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,507 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7719#true} {8145#(< ~counter~0 99)} #59#return; {8145#(< ~counter~0 99)} is VALID [2022-04-08 11:11:17,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,507 INFO L272 TraceCheckUtils]: 36: Hoare triple {8145#(< ~counter~0 99)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {8145#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {8145#(< ~counter~0 99)} is VALID [2022-04-08 11:11:17,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {8230#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8145#(< ~counter~0 99)} is VALID [2022-04-08 11:11:17,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {8230#(< ~counter~0 98)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8230#(< ~counter~0 98)} is VALID [2022-04-08 11:11:17,509 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7719#true} {8230#(< ~counter~0 98)} #67#return; {8230#(< ~counter~0 98)} is VALID [2022-04-08 11:11:17,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,509 INFO L272 TraceCheckUtils]: 28: Hoare triple {8230#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,509 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7719#true} {8230#(< ~counter~0 98)} #65#return; {8230#(< ~counter~0 98)} is VALID [2022-04-08 11:11:17,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,510 INFO L272 TraceCheckUtils]: 23: Hoare triple {8230#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,510 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7719#true} {8230#(< ~counter~0 98)} #63#return; {8230#(< ~counter~0 98)} is VALID [2022-04-08 11:11:17,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,511 INFO L272 TraceCheckUtils]: 18: Hoare triple {8230#(< ~counter~0 98)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,511 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7719#true} {8230#(< ~counter~0 98)} #61#return; {8230#(< ~counter~0 98)} is VALID [2022-04-08 11:11:17,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,511 INFO L272 TraceCheckUtils]: 13: Hoare triple {8230#(< ~counter~0 98)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,512 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7719#true} {8230#(< ~counter~0 98)} #59#return; {8230#(< ~counter~0 98)} is VALID [2022-04-08 11:11:17,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {7719#true} assume true; {7719#true} is VALID [2022-04-08 11:11:17,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {7719#true} assume !(0 == ~cond); {7719#true} is VALID [2022-04-08 11:11:17,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {7719#true} ~cond := #in~cond; {7719#true} is VALID [2022-04-08 11:11:17,512 INFO L272 TraceCheckUtils]: 8: Hoare triple {8230#(< ~counter~0 98)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7719#true} is VALID [2022-04-08 11:11:17,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {8230#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {8230#(< ~counter~0 98)} is VALID [2022-04-08 11:11:17,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {8315#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8230#(< ~counter~0 98)} is VALID [2022-04-08 11:11:17,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {8315#(< ~counter~0 97)} 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; {8315#(< ~counter~0 97)} is VALID [2022-04-08 11:11:17,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {8315#(< ~counter~0 97)} call #t~ret6 := main(); {8315#(< ~counter~0 97)} is VALID [2022-04-08 11:11:17,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8315#(< ~counter~0 97)} {7719#true} #81#return; {8315#(< ~counter~0 97)} is VALID [2022-04-08 11:11:17,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {8315#(< ~counter~0 97)} assume true; {8315#(< ~counter~0 97)} is VALID [2022-04-08 11:11:17,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {7719#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);~counter~0 := 0; {8315#(< ~counter~0 97)} is VALID [2022-04-08 11:11:17,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {7719#true} call ULTIMATE.init(); {7719#true} is VALID [2022-04-08 11:11:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 11:11:17,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:17,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267940691] [2022-04-08 11:11:17,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:11:17,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097232256] [2022-04-08 11:11:17,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097232256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:11:17,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:11:17,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:11:17,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:17,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1579979706] [2022-04-08 11:11:17,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1579979706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:17,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:17,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:11:17,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333325578] [2022-04-08 11:11:17,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-08 11:11:17,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:17,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:11:17,573 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 11:11:17,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:11:17,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:11:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:11:17,574 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:11:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:17,961 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-04-08 11:11:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:11:17,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-08 11:11:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:11:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-08 11:11:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:11:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-08 11:11:17,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-08 11:11:18,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:18,042 INFO L225 Difference]: With dead ends: 127 [2022-04-08 11:11:18,042 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 11:11:18,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-08 11:11:18,043 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:11:18,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 151 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:11:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 11:11:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-04-08 11:11:18,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:18,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:11:18,155 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:11:18,156 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:11:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:18,158 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-08 11:11:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-08 11:11:18,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:18,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:18,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 112 states. [2022-04-08 11:11:18,159 INFO L87 Difference]: Start difference. First operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 112 states. [2022-04-08 11:11:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:18,162 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-04-08 11:11:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-04-08 11:11:18,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:18,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:18,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:18,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 28 states have call successors, (28), 18 states have call predecessors, (28), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 11:11:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-04-08 11:11:18,166 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 101 [2022-04-08 11:11:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:18,166 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-04-08 11:11:18,166 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 11:11:18,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 122 transitions. [2022-04-08 11:11:18,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-04-08 11:11:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-08 11:11:18,341 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:18,341 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:18,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 11:11:18,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 11:11:18,543 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 3 times [2022-04-08 11:11:18,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:18,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [909369531] [2022-04-08 11:11:18,789 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:11:18,789 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:11:18,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 4 times [2022-04-08 11:11:18,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:18,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310261346] [2022-04-08 11:11:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:18,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:18,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2146119423] [2022-04-08 11:11:18,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:11:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:18,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:18,809 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:11:18,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process