/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/cohencu-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:43:44,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:43:44,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:43:44,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:43:44,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:43:44,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:43:44,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:43:44,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:43:44,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:43:44,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:43:44,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:43:44,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:43:44,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:43:44,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:43:44,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:43:44,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:43:44,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:43:44,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:43:44,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:43:44,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:43:44,241 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:43:44,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:43:44,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:43:44,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:43:44,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:43:44,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:43:44,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:43:44,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:43:44,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:43:44,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:43:44,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:43:44,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:43:44,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:43:44,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:43:44,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:43:44,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:43:44,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:43:44,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:43:44,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:43:44,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:43:44,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:43:44,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:43:44,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:43:44,279 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:43:44,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:43:44,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:43:44,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:43:44,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:43:44,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:43:44,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:43:44,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:43:44,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:43:44,282 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:43:44,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:43:44,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:43:44,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:43:44,283 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:43:44,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:43:44,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:43:44,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:43:44,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:43:44,283 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:43:44,283 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:43:44,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:43:44,284 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:43:44,284 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-28 10:43:44,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:43:44,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:43:44,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:43:44,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:43:44,524 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:43:44,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohencu-ll.c [2022-04-28 10:43:44,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55cef360/798bc4a3b0c3444895f21ebf3a2ccf59/FLAGbbe49a56b [2022-04-28 10:43:44,928 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:43:44,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohencu-ll.c [2022-04-28 10:43:44,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55cef360/798bc4a3b0c3444895f21ebf3a2ccf59/FLAGbbe49a56b [2022-04-28 10:43:45,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55cef360/798bc4a3b0c3444895f21ebf3a2ccf59 [2022-04-28 10:43:45,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:43:45,353 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:43:45,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:43:45,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:43:45,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:43:45,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:43:45" (1/1) ... [2022-04-28 10:43:45,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7701e1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45, skipping insertion in model container [2022-04-28 10:43:45,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:43:45" (1/1) ... [2022-04-28 10:43:45,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:43:45,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:43:45,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohencu-ll.c[588,601] [2022-04-28 10:43:45,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:43:45,560 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:43:45,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohencu-ll.c[588,601] [2022-04-28 10:43:45,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:43:45,591 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:43:45,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45 WrapperNode [2022-04-28 10:43:45,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:43:45,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:43:45,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:43:45,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:43:45,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45" (1/1) ... [2022-04-28 10:43:45,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45" (1/1) ... [2022-04-28 10:43:45,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45" (1/1) ... [2022-04-28 10:43:45,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45" (1/1) ... [2022-04-28 10:43:45,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45" (1/1) ... [2022-04-28 10:43:45,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45" (1/1) ... [2022-04-28 10:43:45,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45" (1/1) ... [2022-04-28 10:43:45,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:43:45,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:43:45,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:43:45,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:43:45,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45" (1/1) ... [2022-04-28 10:43:45,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:43:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:45,677 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-28 10:43:45,681 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-28 10:43:45,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:43:45,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:43:45,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:43:45,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:43:45,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:43:45,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:43:45,709 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:43:45,709 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:43:45,709 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:43:45,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:43:45,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 10:43:45,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:43:45,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:43:45,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:43:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:43:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:43:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:43:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:43:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:43:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:43:45,764 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:43:45,766 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:43:45,888 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:43:45,895 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:43:45,895 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:43:45,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:43:45 BoogieIcfgContainer [2022-04-28 10:43:45,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:43:45,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:43:45,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:43:45,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:43:45,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:43:45" (1/3) ... [2022-04-28 10:43:45,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709b8cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:43:45, skipping insertion in model container [2022-04-28 10:43:45,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:45" (2/3) ... [2022-04-28 10:43:45,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709b8cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:43:45, skipping insertion in model container [2022-04-28 10:43:45,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:43:45" (3/3) ... [2022-04-28 10:43:45,905 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll.c [2022-04-28 10:43:45,914 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:43:45,915 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:43:45,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:43:45,958 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@208ad1f0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31d9046c [2022-04-28 10:43:45,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:43:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:43:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:43:45,971 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:45,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:45,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:45,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:45,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1298655804, now seen corresponding path program 1 times [2022-04-28 10:43:45,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:45,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [925057541] [2022-04-28 10:43:45,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1298655804, now seen corresponding path program 2 times [2022-04-28 10:43:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:45,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709787038] [2022-04-28 10:43:45,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:45,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:46,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:46,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-28 10:43:46,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 10:43:46,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #80#return; {33#true} is VALID [2022-04-28 10:43:46,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:43:46,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-28 10:43:46,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 10:43:46,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #80#return; {33#true} is VALID [2022-04-28 10:43:46,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret5 := main(); {33#true} is VALID [2022-04-28 10:43:46,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {33#true} is VALID [2022-04-28 10:43:46,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume false; {34#false} is VALID [2022-04-28 10:43:46,186 INFO L272 TraceCheckUtils]: 7: Hoare triple {34#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34#false} is VALID [2022-04-28 10:43:46,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-28 10:43:46,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-28 10:43:46,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 10:43:46,187 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-28 10:43:46,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:46,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709787038] [2022-04-28 10:43:46,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709787038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:46,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:46,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:43:46,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:46,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [925057541] [2022-04-28 10:43:46,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [925057541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:46,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:46,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:43:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685889843] [2022-04-28 10:43:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:46,197 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-28 10:43:46,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:46,201 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-28 10:43:46,217 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-28 10:43:46,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:43:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:46,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:43:46,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:43:46,243 INFO L87 Difference]: Start difference. First operand has 30 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:46,451 INFO L93 Difference]: Finished difference Result 54 states and 91 transitions. [2022-04-28 10:43:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:43:46,452 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-28 10:43:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:46,453 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-28 10:43:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 10:43:46,466 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-28 10:43:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 10:43:46,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-28 10:43:46,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:46,624 INFO L225 Difference]: With dead ends: 54 [2022-04-28 10:43:46,624 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 10:43:46,629 INFO L412 NwaCegarLoop]: 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-28 10:43:46,634 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:46,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:43:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 10:43:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 10:43:46,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:46,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:43:46,668 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:43:46,668 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:43:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:46,675 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-04-28 10:43:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-28 10:43:46,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:46,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:46,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 25 states. [2022-04-28 10:43:46,677 INFO L87 Difference]: Start difference. First operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 25 states. [2022-04-28 10:43:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:46,681 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2022-04-28 10:43:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-28 10:43:46,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:46,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:46,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:46,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:43:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-04-28 10:43:46,688 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 11 [2022-04-28 10:43:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:46,688 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-04-28 10:43:46,688 INFO L496 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-28 10:43:46,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 35 transitions. [2022-04-28 10:43:46,749 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-28 10:43:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-04-28 10:43:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:43:46,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:46,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:46,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:43:46,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:46,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1297106672, now seen corresponding path program 1 times [2022-04-28 10:43:46,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:46,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1892470287] [2022-04-28 10:43:46,761 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1297106672, now seen corresponding path program 2 times [2022-04-28 10:43:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:46,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984222485] [2022-04-28 10:43:46,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:46,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:46,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-04-28 10:43:46,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2022-04-28 10:43:46,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #80#return; {249#true} is VALID [2022-04-28 10:43:46,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:43:46,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-04-28 10:43:46,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} assume true; {249#true} is VALID [2022-04-28 10:43:46,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {249#true} {249#true} #80#return; {249#true} is VALID [2022-04-28 10:43:46,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {249#true} call #t~ret5 := main(); {249#true} is VALID [2022-04-28 10:43:46,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 10:43:46,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 10:43:46,956 INFO L272 TraceCheckUtils]: 7: Hoare triple {254#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:46,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {256#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:43:46,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {250#false} is VALID [2022-04-28 10:43:46,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {250#false} assume !false; {250#false} is VALID [2022-04-28 10:43:46,959 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-28 10:43:46,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:46,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984222485] [2022-04-28 10:43:46,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984222485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:46,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:46,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:43:46,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:46,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1892470287] [2022-04-28 10:43:46,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1892470287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:46,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:46,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:43:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012191131] [2022-04-28 10:43:46,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:46,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:43:46,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:46,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:46,973 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-28 10:43:46,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:43:46,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:46,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:43:46,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:43:46,974 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:47,394 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-28 10:43:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:43:47,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:43:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 10:43:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 10:43:47,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-28 10:43:47,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:47,468 INFO L225 Difference]: With dead ends: 31 [2022-04-28 10:43:47,468 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:43:47,469 INFO L412 NwaCegarLoop]: 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-28 10:43:47,470 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:47,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:43:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:43:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 10:43:47,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:47,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:43:47,478 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:43:47,478 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:43:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:47,481 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-28 10:43:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-28 10:43:47,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:47,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:47,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 29 states. [2022-04-28 10:43:47,483 INFO L87 Difference]: Start difference. First operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 29 states. [2022-04-28 10:43:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:47,485 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-28 10:43:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-28 10:43:47,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:47,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:47,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:47,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:43:47,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-04-28 10:43:47,489 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2022-04-28 10:43:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:47,489 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-04-28 10:43:47,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:47,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 38 transitions. [2022-04-28 10:43:47,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-28 10:43:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:43:47,539 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:47,539 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:47,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:43:47,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:47,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:47,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2099401665, now seen corresponding path program 1 times [2022-04-28 10:43:47,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:47,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719723054] [2022-04-28 10:43:47,549 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2099401665, now seen corresponding path program 2 times [2022-04-28 10:43:47,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:47,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029514447] [2022-04-28 10:43:47,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:47,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:47,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:47,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141572806] [2022-04-28 10:43:47,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:47,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:47,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:47,591 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-28 10:43:47,604 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-28 10:43:47,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:47,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:47,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:43:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:47,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:47,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {446#true} call ULTIMATE.init(); {446#true} is VALID [2022-04-28 10:43:47,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {446#true} is VALID [2022-04-28 10:43:47,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {446#true} assume true; {446#true} is VALID [2022-04-28 10:43:47,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {446#true} {446#true} #80#return; {446#true} is VALID [2022-04-28 10:43:47,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {446#true} call #t~ret5 := main(); {446#true} is VALID [2022-04-28 10:43:47,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {446#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 10:43:47,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 10:43:47,839 INFO L272 TraceCheckUtils]: 7: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {446#true} is VALID [2022-04-28 10:43:47,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {446#true} ~cond := #in~cond; {446#true} is VALID [2022-04-28 10:43:47,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {446#true} assume !(0 == ~cond); {446#true} is VALID [2022-04-28 10:43:47,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {446#true} assume true; {446#true} is VALID [2022-04-28 10:43:47,841 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {446#true} {466#(and (= main_~n~0 0) (= main_~y~0 1))} #58#return; {466#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 10:43:47,841 INFO L272 TraceCheckUtils]: 12: Hoare triple {466#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:47,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:47,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {447#false} is VALID [2022-04-28 10:43:47,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {447#false} assume !false; {447#false} is VALID [2022-04-28 10:43:47,843 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-28 10:43:47,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:43:47,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:47,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029514447] [2022-04-28 10:43:47,843 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:43:47,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141572806] [2022-04-28 10:43:47,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141572806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:47,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:47,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:43:47,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:47,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719723054] [2022-04-28 10:43:47,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719723054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:47,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:47,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:43:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770453411] [2022-04-28 10:43:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-28 10:43:47,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:47,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:43:47,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:47,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:43:47,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:47,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:43:47,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:43:47,859 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:43:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:48,068 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-28 10:43:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:43:48,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-28 10:43:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:43:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 10:43:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:43:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 10:43:48,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 10:43:48,142 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-28 10:43:48,147 INFO L225 Difference]: With dead ends: 48 [2022-04-28 10:43:48,147 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:43:48,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:43:48,149 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:48,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 125 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:43:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:43:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-04-28 10:43:48,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:48,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:43:48,168 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:43:48,168 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:43:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:48,173 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-04-28 10:43:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-04-28 10:43:48,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:48,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:48,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 46 states. [2022-04-28 10:43:48,175 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 46 states. [2022-04-28 10:43:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:48,178 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-04-28 10:43:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-04-28 10:43:48,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:48,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:48,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:48,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:43:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-04-28 10:43:48,182 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 16 [2022-04-28 10:43:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:48,182 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-04-28 10:43:48,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:43:48,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 46 transitions. [2022-04-28 10:43:48,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 10:43:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:43:48,234 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:48,234 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:48,261 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-28 10:43:48,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:48,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1061128656, now seen corresponding path program 1 times [2022-04-28 10:43:48,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:48,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [440978058] [2022-04-28 10:43:48,449 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:48,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1061128656, now seen corresponding path program 2 times [2022-04-28 10:43:48,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:48,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336645619] [2022-04-28 10:43:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:48,460 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:48,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414816140] [2022-04-28 10:43:48,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:48,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:48,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:48,461 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-28 10:43:48,462 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-28 10:43:48,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:48,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:48,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:43:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:48,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:48,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2022-04-28 10:43:48,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {760#true} is VALID [2022-04-28 10:43:48,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-28 10:43:48,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #80#return; {760#true} is VALID [2022-04-28 10:43:48,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret5 := main(); {760#true} is VALID [2022-04-28 10:43:48,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 10:43:48,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 10:43:48,632 INFO L272 TraceCheckUtils]: 7: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {760#true} is VALID [2022-04-28 10:43:48,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-28 10:43:48,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-28 10:43:48,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-28 10:43:48,635 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {760#true} {780#(and (= main_~x~0 0) (= main_~n~0 0))} #58#return; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 10:43:48,635 INFO L272 TraceCheckUtils]: 12: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {760#true} is VALID [2022-04-28 10:43:48,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-28 10:43:48,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-28 10:43:48,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-28 10:43:48,636 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {760#true} {780#(and (= main_~x~0 0) (= main_~n~0 0))} #60#return; {780#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 10:43:48,637 INFO L272 TraceCheckUtils]: 17: Hoare triple {780#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:48,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:48,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {761#false} is VALID [2022-04-28 10:43:48,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-04-28 10:43:48,638 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-28 10:43:48,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:43:48,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:48,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336645619] [2022-04-28 10:43:48,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:43:48,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414816140] [2022-04-28 10:43:48,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414816140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:48,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:48,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:43:48,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:48,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [440978058] [2022-04-28 10:43:48,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [440978058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:48,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:48,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:43:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622645239] [2022-04-28 10:43:48,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:48,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-28 10:43:48,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:48,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:43:48,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:48,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:43:48,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:48,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:43:48,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:43:48,657 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:43:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:48,891 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2022-04-28 10:43:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:43:48,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-28 10:43:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:43:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 10:43:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:43:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 10:43:48,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 10:43:48,964 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-28 10:43:48,966 INFO L225 Difference]: With dead ends: 52 [2022-04-28 10:43:48,966 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 10:43:48,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:43:48,967 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:48,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 126 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:43:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 10:43:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-04-28 10:43:48,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:48,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:43:48,991 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:43:48,992 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:43:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:48,997 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-28 10:43:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-28 10:43:48,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:48,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:48,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 50 states. [2022-04-28 10:43:48,999 INFO L87 Difference]: Start difference. First operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 50 states. [2022-04-28 10:43:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:49,003 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-28 10:43:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-28 10:43:49,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:49,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:49,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:49,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:43:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-04-28 10:43:49,007 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 21 [2022-04-28 10:43:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:49,008 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-04-28 10:43:49,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:43:49,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 61 transitions. [2022-04-28 10:43:49,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-04-28 10:43:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:43:49,083 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:49,083 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:49,110 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-28 10:43:49,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 10:43:49,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2039501471, now seen corresponding path program 1 times [2022-04-28 10:43:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:49,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1259339112] [2022-04-28 10:43:49,301 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:49,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2039501471, now seen corresponding path program 2 times [2022-04-28 10:43:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:49,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718970530] [2022-04-28 10:43:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:49,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:49,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582980501] [2022-04-28 10:43:49,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:49,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:49,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:49,312 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-28 10:43:49,336 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-28 10:43:49,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:49,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:49,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:43:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:49,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:49,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-28 10:43:49,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1125#true} is VALID [2022-04-28 10:43:49,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 10:43:49,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #80#return; {1125#true} is VALID [2022-04-28 10:43:49,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret5 := main(); {1125#true} is VALID [2022-04-28 10:43:49,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {1125#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:49,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:49,521 INFO L272 TraceCheckUtils]: 7: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 10:43:49,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 10:43:49,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 10:43:49,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 10:43:49,522 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #58#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:49,523 INFO L272 TraceCheckUtils]: 12: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1125#true} is VALID [2022-04-28 10:43:49,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 10:43:49,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 10:43:49,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 10:43:49,524 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #60#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:49,524 INFO L272 TraceCheckUtils]: 17: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 10:43:49,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 10:43:49,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 10:43:49,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 10:43:49,525 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1125#true} {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:49,526 INFO L272 TraceCheckUtils]: 22: Hoare triple {1145#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:49,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {1197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:49,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {1201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-28 10:43:49,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-28 10:43:49,527 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-28 10:43:49,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:43:49,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:49,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718970530] [2022-04-28 10:43:49,527 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:43:49,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582980501] [2022-04-28 10:43:49,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582980501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:49,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:49,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:43:49,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:49,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1259339112] [2022-04-28 10:43:49,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1259339112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:49,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:49,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:43:49,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527375152] [2022-04-28 10:43:49,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:49,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-04-28 10:43:49,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:49,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:43:49,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:49,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:43:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:43:49,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:43:49,547 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:43:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:49,846 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-04-28 10:43:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:43:49,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-04-28 10:43:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:43:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 10:43:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:43:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 10:43:49,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 10:43:49,921 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-28 10:43:49,923 INFO L225 Difference]: With dead ends: 60 [2022-04-28 10:43:49,923 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 10:43:49,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:43:49,924 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:49,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 112 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:43:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 10:43:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 10:43:49,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:49,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:43:49,946 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:43:49,947 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:43:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:49,949 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-28 10:43:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-28 10:43:49,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:49,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:49,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 48 states. [2022-04-28 10:43:49,950 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 48 states. [2022-04-28 10:43:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:49,952 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-28 10:43:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-28 10:43:49,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:49,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:49,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:49,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:43:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-04-28 10:43:49,955 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 26 [2022-04-28 10:43:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:49,956 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-04-28 10:43:49,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:43:49,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 59 transitions. [2022-04-28 10:43:50,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-28 10:43:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:43:50,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:50,036 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:50,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:43:50,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:50,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:50,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash 542006608, now seen corresponding path program 1 times [2022-04-28 10:43:50,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:50,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [15690757] [2022-04-28 10:43:50,650 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:43:50,650 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:43:50,650 INFO L85 PathProgramCache]: Analyzing trace with hash 542006608, now seen corresponding path program 2 times [2022-04-28 10:43:50,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:50,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196941196] [2022-04-28 10:43:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:50,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:50,664 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:50,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568107957] [2022-04-28 10:43:50,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:50,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:50,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:50,665 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-28 10:43:50,666 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-28 10:43:50,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:50,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:50,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:43:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:50,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:50,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-28 10:43:50,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1521#true} is VALID [2022-04-28 10:43:50,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:50,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #80#return; {1521#true} is VALID [2022-04-28 10:43:50,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret5 := main(); {1521#true} is VALID [2022-04-28 10:43:50,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:50,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:50,912 INFO L272 TraceCheckUtils]: 7: Hoare triple {1541#(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)); {1521#true} is VALID [2022-04-28 10:43:50,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:50,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:50,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:50,915 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1521#true} {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #58#return; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:50,915 INFO L272 TraceCheckUtils]: 12: Hoare triple {1541#(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)); {1521#true} is VALID [2022-04-28 10:43:50,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:50,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:50,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:50,916 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1521#true} {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #60#return; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:50,916 INFO L272 TraceCheckUtils]: 17: Hoare triple {1541#(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)); {1521#true} is VALID [2022-04-28 10:43:50,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:50,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:50,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:50,917 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1521#true} {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:50,917 INFO L272 TraceCheckUtils]: 22: Hoare triple {1541#(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)); {1521#true} is VALID [2022-04-28 10:43:50,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:50,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:50,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:50,919 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1521#true} {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:50,919 INFO L272 TraceCheckUtils]: 27: Hoare triple {1541#(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)); {1521#true} is VALID [2022-04-28 10:43:50,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:50,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:50,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:50,921 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1521#true} {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1541#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:50,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {1541#(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; {1623#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 10:43:50,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {1623#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !false; {1623#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 10:43:50,922 INFO L272 TraceCheckUtils]: 34: Hoare triple {1623#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1521#true} is VALID [2022-04-28 10:43:50,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:50,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:50,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:50,930 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1521#true} {1623#(and (= 7 main_~y~0) (= main_~n~0 1))} #58#return; {1623#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 10:43:50,930 INFO L272 TraceCheckUtils]: 39: Hoare triple {1623#(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)); {1645#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:50,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {1645#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1649#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:50,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {1649#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1522#false} is VALID [2022-04-28 10:43:50,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-28 10:43:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 10:43:50,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:51,149 INFO L290 TraceCheckUtils]: 42: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-28 10:43:51,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {1649#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1522#false} is VALID [2022-04-28 10:43:51,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {1645#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1649#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:51,151 INFO L272 TraceCheckUtils]: 39: Hoare triple {1665#(= (+ (* 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)); {1645#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:51,151 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1521#true} {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #58#return; {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 10:43:51,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:51,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:51,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:51,152 INFO L272 TraceCheckUtils]: 34: Hoare triple {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1521#true} is VALID [2022-04-28 10:43:51,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 10:43:51,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {1687#(= (+ (* 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; {1665#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 10:43:51,156 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1521#true} {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 10:43:51,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:51,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:51,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:51,157 INFO L272 TraceCheckUtils]: 27: Hoare triple {1687#(= (+ (* 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)); {1521#true} is VALID [2022-04-28 10:43:51,157 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1521#true} {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 10:43:51,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:51,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:51,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:51,158 INFO L272 TraceCheckUtils]: 22: Hoare triple {1687#(= (+ (* 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)); {1521#true} is VALID [2022-04-28 10:43:51,158 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1521#true} {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 10:43:51,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:51,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:51,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:51,159 INFO L272 TraceCheckUtils]: 17: Hoare triple {1687#(= (+ (* 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)); {1521#true} is VALID [2022-04-28 10:43:51,159 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1521#true} {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #60#return; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 10:43:51,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:51,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:51,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:51,160 INFO L272 TraceCheckUtils]: 12: Hoare triple {1687#(= (+ (* 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)); {1521#true} is VALID [2022-04-28 10:43:51,160 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1521#true} {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #58#return; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 10:43:51,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:51,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {1521#true} assume !(0 == ~cond); {1521#true} is VALID [2022-04-28 10:43:51,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2022-04-28 10:43:51,161 INFO L272 TraceCheckUtils]: 7: Hoare triple {1687#(= (+ (* 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)); {1521#true} is VALID [2022-04-28 10:43:51,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 10:43:51,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1687#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 10:43:51,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret5 := main(); {1521#true} is VALID [2022-04-28 10:43:51,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #80#return; {1521#true} is VALID [2022-04-28 10:43:51,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-28 10:43:51,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1521#true} is VALID [2022-04-28 10:43:51,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-28 10:43:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 10:43:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:51,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196941196] [2022-04-28 10:43:51,164 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:43:51,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568107957] [2022-04-28 10:43:51,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568107957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:51,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:43:51,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 10:43:51,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:51,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [15690757] [2022-04-28 10:43:51,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [15690757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:51,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:51,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:43:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492037363] [2022-04-28 10:43:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:51,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 43 [2022-04-28 10:43:51,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:51,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-28 10:43:51,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:51,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:43:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:51,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:43:51,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:43:51,192 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-28 10:43:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:51,621 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-04-28 10:43:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:43:51,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 43 [2022-04-28 10:43:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-28 10:43:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-28 10:43:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-28 10:43:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-28 10:43:51,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-04-28 10:43:51,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:51,702 INFO L225 Difference]: With dead ends: 75 [2022-04-28 10:43:51,702 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 10:43:51,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 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-28 10:43:51,703 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:51,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 152 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:43:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 10:43:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-04-28 10:43:51,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:51,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 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-28 10:43:51,740 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 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-28 10:43:51,740 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 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-28 10:43:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:51,744 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-28 10:43:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-28 10:43:51,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:51,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:51,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 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 73 states. [2022-04-28 10:43:51,748 INFO L87 Difference]: Start difference. First operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 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 73 states. [2022-04-28 10:43:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:51,752 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-28 10:43:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-28 10:43:51,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:51,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:51,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:51,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 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-28 10:43:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2022-04-28 10:43:51,756 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 43 [2022-04-28 10:43:51,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:51,756 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2022-04-28 10:43:51,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-28 10:43:51,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 73 transitions. [2022-04-28 10:43:51,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 10:43:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 10:43:51,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:51,843 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:51,871 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-28 10:43:52,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:52,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash 806930367, now seen corresponding path program 3 times [2022-04-28 10:43:52,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:52,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1964420282] [2022-04-28 10:43:52,379 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:43:52,379 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:43:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash 806930367, now seen corresponding path program 4 times [2022-04-28 10:43:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:52,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208542106] [2022-04-28 10:43:52,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:52,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:52,393 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:52,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [207159641] [2022-04-28 10:43:52,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:43:52,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:52,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:52,395 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-28 10:43:52,409 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-28 10:43:52,508 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:43:52,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:52,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:43:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:52,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:52,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {2210#true} call ULTIMATE.init(); {2210#true} is VALID [2022-04-28 10:43:52,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {2210#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); {2210#true} is VALID [2022-04-28 10:43:52,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 10:43:52,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2210#true} {2210#true} #80#return; {2210#true} is VALID [2022-04-28 10:43:52,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {2210#true} call #t~ret5 := main(); {2210#true} is VALID [2022-04-28 10:43:52,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {2210#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; {2210#true} is VALID [2022-04-28 10:43:52,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {2210#true} assume !false; {2210#true} is VALID [2022-04-28 10:43:52,841 INFO L272 TraceCheckUtils]: 7: Hoare triple {2210#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2210#true} is VALID [2022-04-28 10:43:52,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {2210#true} ~cond := #in~cond; {2210#true} is VALID [2022-04-28 10:43:52,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {2210#true} assume !(0 == ~cond); {2210#true} is VALID [2022-04-28 10:43:52,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 10:43:52,841 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2210#true} {2210#true} #58#return; {2210#true} is VALID [2022-04-28 10:43:52,841 INFO L272 TraceCheckUtils]: 12: Hoare triple {2210#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2210#true} is VALID [2022-04-28 10:43:52,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {2210#true} ~cond := #in~cond; {2254#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:52,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {2254#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:52,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:52,848 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} {2210#true} #60#return; {2265#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 10:43:52,848 INFO L272 TraceCheckUtils]: 17: Hoare triple {2265#(= (+ (* 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)); {2210#true} is VALID [2022-04-28 10:43:52,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {2210#true} ~cond := #in~cond; {2254#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:52,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:52,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:52,854 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} {2265#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {2281#(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-28 10:43:52,854 INFO L272 TraceCheckUtils]: 22: Hoare triple {2281#(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)); {2210#true} is VALID [2022-04-28 10:43:52,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {2210#true} ~cond := #in~cond; {2210#true} is VALID [2022-04-28 10:43:52,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {2210#true} assume !(0 == ~cond); {2210#true} is VALID [2022-04-28 10:43:52,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 10:43:52,855 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2210#true} {2281#(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))} #64#return; {2281#(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-28 10:43:52,855 INFO L272 TraceCheckUtils]: 27: Hoare triple {2281#(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)); {2210#true} is VALID [2022-04-28 10:43:52,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {2210#true} ~cond := #in~cond; {2210#true} is VALID [2022-04-28 10:43:52,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {2210#true} assume !(0 == ~cond); {2210#true} is VALID [2022-04-28 10:43:52,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 10:43:52,856 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2210#true} {2281#(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))} #66#return; {2281#(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-28 10:43:52,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {2281#(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; {2315#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))))} is VALID [2022-04-28 10:43:52,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {2315#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))))} assume !false; {2315#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))))} is VALID [2022-04-28 10:43:52,864 INFO L272 TraceCheckUtils]: 34: Hoare triple {2315#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (* (+ (- 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)); {2210#true} is VALID [2022-04-28 10:43:52,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {2210#true} ~cond := #in~cond; {2254#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:52,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {2254#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:52,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:52,867 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} {2315#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))))} #58#return; {2281#(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-28 10:43:52,867 INFO L272 TraceCheckUtils]: 39: Hoare triple {2281#(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)); {2210#true} is VALID [2022-04-28 10:43:52,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {2210#true} ~cond := #in~cond; {2254#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:52,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {2254#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:52,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:52,869 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} {2281#(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))} #60#return; {2349#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 10:43:52,870 INFO L272 TraceCheckUtils]: 44: Hoare triple {2349#(= (* 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)); {2353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:52,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {2353#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:52,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {2357#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2211#false} is VALID [2022-04-28 10:43:52,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2022-04-28 10:43:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 37 proven. 17 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:43:52,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:53,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2022-04-28 10:43:53,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {2357#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2211#false} is VALID [2022-04-28 10:43:53,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {2353#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:53,484 INFO L272 TraceCheckUtils]: 44: Hoare triple {2349#(= (* 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)); {2353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:53,484 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} {2376#(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))} #60#return; {2349#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 10:43:53,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:53,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {2386#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:53,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {2210#true} ~cond := #in~cond; {2386#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:43:53,486 INFO L272 TraceCheckUtils]: 39: Hoare triple {2376#(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)); {2210#true} is VALID [2022-04-28 10:43:53,487 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} {2393#(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))} #58#return; {2376#(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-28 10:43:53,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:53,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {2386#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:53,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {2210#true} ~cond := #in~cond; {2386#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:43:53,488 INFO L272 TraceCheckUtils]: 34: Hoare triple {2393#(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)); {2210#true} is VALID [2022-04-28 10:43:53,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {2393#(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 !false; {2393#(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-28 10:43:53,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {2376#(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; {2393#(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-28 10:43:53,496 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2210#true} {2376#(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))} #66#return; {2376#(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-28 10:43:53,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 10:43:53,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {2210#true} assume !(0 == ~cond); {2210#true} is VALID [2022-04-28 10:43:53,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {2210#true} ~cond := #in~cond; {2210#true} is VALID [2022-04-28 10:43:53,496 INFO L272 TraceCheckUtils]: 27: Hoare triple {2376#(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)); {2210#true} is VALID [2022-04-28 10:43:53,497 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2210#true} {2376#(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))} #64#return; {2376#(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-28 10:43:53,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 10:43:53,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {2210#true} assume !(0 == ~cond); {2210#true} is VALID [2022-04-28 10:43:53,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {2210#true} ~cond := #in~cond; {2210#true} is VALID [2022-04-28 10:43:53,498 INFO L272 TraceCheckUtils]: 22: Hoare triple {2376#(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)); {2210#true} is VALID [2022-04-28 10:43:53,499 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} {2210#true} #62#return; {2376#(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-28 10:43:53,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:53,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {2386#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2258#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:53,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {2210#true} ~cond := #in~cond; {2386#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:43:53,501 INFO L272 TraceCheckUtils]: 17: Hoare triple {2210#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2210#true} is VALID [2022-04-28 10:43:53,501 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2210#true} {2210#true} #60#return; {2210#true} is VALID [2022-04-28 10:43:53,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 10:43:53,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {2210#true} assume !(0 == ~cond); {2210#true} is VALID [2022-04-28 10:43:53,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {2210#true} ~cond := #in~cond; {2210#true} is VALID [2022-04-28 10:43:53,501 INFO L272 TraceCheckUtils]: 12: Hoare triple {2210#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2210#true} is VALID [2022-04-28 10:43:53,501 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2210#true} {2210#true} #58#return; {2210#true} is VALID [2022-04-28 10:43:53,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 10:43:53,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {2210#true} assume !(0 == ~cond); {2210#true} is VALID [2022-04-28 10:43:53,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {2210#true} ~cond := #in~cond; {2210#true} is VALID [2022-04-28 10:43:53,502 INFO L272 TraceCheckUtils]: 7: Hoare triple {2210#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2210#true} is VALID [2022-04-28 10:43:53,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {2210#true} assume !false; {2210#true} is VALID [2022-04-28 10:43:53,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {2210#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; {2210#true} is VALID [2022-04-28 10:43:53,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {2210#true} call #t~ret5 := main(); {2210#true} is VALID [2022-04-28 10:43:53,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2210#true} {2210#true} #80#return; {2210#true} is VALID [2022-04-28 10:43:53,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 10:43:53,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {2210#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); {2210#true} is VALID [2022-04-28 10:43:53,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {2210#true} call ULTIMATE.init(); {2210#true} is VALID [2022-04-28 10:43:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:43:53,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:53,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208542106] [2022-04-28 10:43:53,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:43:53,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207159641] [2022-04-28 10:43:53,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207159641] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:53,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:43:53,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-28 10:43:53,504 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:53,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1964420282] [2022-04-28 10:43:53,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1964420282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:53,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:53,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:43:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262830045] [2022-04-28 10:43:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:53,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 48 [2022-04-28 10:43:53,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:53,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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-28 10:43:53,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:53,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:43:53,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:43:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:43:53,545 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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-28 10:43:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:56,699 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-04-28 10:43:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:43:56,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 48 [2022-04-28 10:43:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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-28 10:43:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 10:43:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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-28 10:43:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 10:43:56,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-28 10:43:56,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:56,797 INFO L225 Difference]: With dead ends: 69 [2022-04-28 10:43:56,797 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 10:43:56,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 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-28 10:43:56,798 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:56,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 59 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:43:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 10:43:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-28 10:43:56,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:56,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 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-28 10:43:56,832 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 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-28 10:43:56,832 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 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-28 10:43:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:56,834 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-28 10:43:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-28 10:43:56,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:56,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:56,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 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 64 states. [2022-04-28 10:43:56,835 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 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 64 states. [2022-04-28 10:43:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:56,837 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-28 10:43:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-28 10:43:56,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:56,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:56,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:56,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 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-28 10:43:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-04-28 10:43:56,840 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 48 [2022-04-28 10:43:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:56,840 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-04-28 10:43:56,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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-28 10:43:56,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 70 transitions. [2022-04-28 10:43:56,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-28 10:43:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 10:43:56,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:56,966 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 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-28 10:43:56,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 10:43:57,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:57,169 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash -950464918, now seen corresponding path program 1 times [2022-04-28 10:43:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:57,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774463134] [2022-04-28 10:43:57,506 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:43:57,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:43:57,506 INFO L85 PathProgramCache]: Analyzing trace with hash -950464918, now seen corresponding path program 2 times [2022-04-28 10:43:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:57,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301452492] [2022-04-28 10:43:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:57,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:57,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [697519430] [2022-04-28 10:43:57,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:57,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:57,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:57,520 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-28 10:43:57,521 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-28 10:43:57,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:57,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:57,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:43:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:57,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:58,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {2911#true} call ULTIMATE.init(); {2911#true} is VALID [2022-04-28 10:43:58,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {2911#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); {2911#true} is VALID [2022-04-28 10:43:58,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2911#true} {2911#true} #80#return; {2911#true} is VALID [2022-04-28 10:43:58,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {2911#true} call #t~ret5 := main(); {2911#true} is VALID [2022-04-28 10:43:58,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {2911#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; {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:58,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:58,143 INFO L272 TraceCheckUtils]: 7: Hoare triple {2931#(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)); {2911#true} is VALID [2022-04-28 10:43:58,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,144 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2911#true} {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #58#return; {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:58,144 INFO L272 TraceCheckUtils]: 12: Hoare triple {2931#(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)); {2911#true} is VALID [2022-04-28 10:43:58,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,145 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2911#true} {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #60#return; {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:58,145 INFO L272 TraceCheckUtils]: 17: Hoare triple {2931#(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)); {2911#true} is VALID [2022-04-28 10:43:58,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,146 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2911#true} {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:58,146 INFO L272 TraceCheckUtils]: 22: Hoare triple {2931#(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)); {2911#true} is VALID [2022-04-28 10:43:58,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,147 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2911#true} {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:58,147 INFO L272 TraceCheckUtils]: 27: Hoare triple {2931#(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)); {2911#true} is VALID [2022-04-28 10:43:58,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,149 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2911#true} {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {2931#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:43:58,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {2931#(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; {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:43:58,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:43:58,150 INFO L272 TraceCheckUtils]: 34: Hoare triple {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2911#true} is VALID [2022-04-28 10:43:58,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,151 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2911#true} {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #58#return; {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:43:58,151 INFO L272 TraceCheckUtils]: 39: Hoare triple {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 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)); {2911#true} is VALID [2022-04-28 10:43:58,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,152 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2911#true} {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #60#return; {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:43:58,152 INFO L272 TraceCheckUtils]: 44: Hoare triple {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2911#true} is VALID [2022-04-28 10:43:58,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,153 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2911#true} {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:43:58,153 INFO L272 TraceCheckUtils]: 49: Hoare triple {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 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)); {2911#true} is VALID [2022-04-28 10:43:58,153 INFO L290 TraceCheckUtils]: 50: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,153 INFO L290 TraceCheckUtils]: 51: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,154 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2911#true} {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:43:58,154 INFO L272 TraceCheckUtils]: 54: Hoare triple {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 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)); {2911#true} is VALID [2022-04-28 10:43:58,154 INFO L290 TraceCheckUtils]: 55: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,157 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2911#true} {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:43:58,158 INFO L290 TraceCheckUtils]: 59: Hoare triple {3013#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {3095#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 10:43:58,158 INFO L272 TraceCheckUtils]: 60: Hoare triple {3095#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2911#true} is VALID [2022-04-28 10:43:58,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-28 10:43:58,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-28 10:43:58,159 INFO L290 TraceCheckUtils]: 63: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-28 10:43:58,159 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {2911#true} {3095#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} #68#return; {3095#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 10:43:58,160 INFO L272 TraceCheckUtils]: 65: Hoare triple {3095#(and (= main_~z~0 12) (= (+ (- 1) main_~x~0) 0) (<= 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)); {3114#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:58,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {3114#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3118#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:58,161 INFO L290 TraceCheckUtils]: 67: Hoare triple {3118#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2912#false} is VALID [2022-04-28 10:43:58,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {2912#false} assume !false; {2912#false} is VALID [2022-04-28 10:43:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 10:43:58,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:58,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301452492] [2022-04-28 10:43:58,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:43:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697519430] [2022-04-28 10:43:58,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697519430] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:43:58,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:43:58,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 10:43:58,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1774463134] [2022-04-28 10:43:58,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1774463134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:58,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:58,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:43:58,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912694087] [2022-04-28 10:43:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:58,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 69 [2022-04-28 10:43:58,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:58,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-28 10:43:58,660 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-28 10:43:58,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:43:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:43:58,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:43:58,661 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-28 10:43:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:59,178 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-04-28 10:43:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:43:59,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 69 [2022-04-28 10:43:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-28 10:43:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-28 10:43:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-28 10:43:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-28 10:43:59,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-28 10:43:59,247 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-28 10:43:59,249 INFO L225 Difference]: With dead ends: 81 [2022-04-28 10:43:59,249 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 10:43:59,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:43:59,250 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:59,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 131 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:43:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 10:43:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-28 10:43:59,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:59,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 43 states have (on average 1.069767441860465) internal successors, (46), 45 states have internal predecessors, (46), 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-28 10:43:59,320 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 43 states have (on average 1.069767441860465) internal successors, (46), 45 states have internal predecessors, (46), 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-28 10:43:59,320 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 43 states have (on average 1.069767441860465) internal successors, (46), 45 states have internal predecessors, (46), 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-28 10:43:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:59,325 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-04-28 10:43:59,325 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-04-28 10:43:59,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:59,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:59,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 43 states have (on average 1.069767441860465) internal successors, (46), 45 states have internal predecessors, (46), 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 79 states. [2022-04-28 10:43:59,332 INFO L87 Difference]: Start difference. First operand has 78 states, 43 states have (on average 1.069767441860465) internal successors, (46), 45 states have internal predecessors, (46), 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 79 states. [2022-04-28 10:43:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:59,335 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-04-28 10:43:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-04-28 10:43:59,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:59,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:59,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:59,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.069767441860465) internal successors, (46), 45 states have internal predecessors, (46), 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-28 10:43:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-04-28 10:43:59,340 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 69 [2022-04-28 10:43:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:59,341 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-04-28 10:43:59,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-28 10:43:59,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 88 transitions. [2022-04-28 10:44:00,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-04-28 10:44:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 10:44:00,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:00,909 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 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-28 10:44:00,928 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-28 10:44:01,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:01,112 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1778111067, now seen corresponding path program 1 times [2022-04-28 10:44:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:01,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1634528978] [2022-04-28 10:44:01,430 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:01,430 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1778111067, now seen corresponding path program 2 times [2022-04-28 10:44:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:01,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643585697] [2022-04-28 10:44:01,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:01,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:01,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:44:01,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404533317] [2022-04-28 10:44:01,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:44:01,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:01,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:01,467 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-28 10:44:01,468 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-28 10:44:01,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:44:01,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:01,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:44:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:01,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:05,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {3721#true} call ULTIMATE.init(); {3721#true} is VALID [2022-04-28 10:44:05,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {3721#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); {3721#true} is VALID [2022-04-28 10:44:05,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3721#true} {3721#true} #80#return; {3721#true} is VALID [2022-04-28 10:44:05,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {3721#true} call #t~ret5 := main(); {3721#true} is VALID [2022-04-28 10:44:05,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {3721#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; {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} is VALID [2022-04-28 10:44:05,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} assume !false; {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} is VALID [2022-04-28 10:44:05,907 INFO L272 TraceCheckUtils]: 7: Hoare triple {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:05,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,908 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3721#true} {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} #58#return; {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} is VALID [2022-04-28 10:44:05,908 INFO L272 TraceCheckUtils]: 12: Hoare triple {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:05,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,909 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3721#true} {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} #60#return; {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} is VALID [2022-04-28 10:44:05,909 INFO L272 TraceCheckUtils]: 17: Hoare triple {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:05,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,909 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3721#true} {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} #62#return; {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} is VALID [2022-04-28 10:44:05,909 INFO L272 TraceCheckUtils]: 22: Hoare triple {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 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)); {3721#true} is VALID [2022-04-28 10:44:05,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,910 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3721#true} {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} #64#return; {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} is VALID [2022-04-28 10:44:05,910 INFO L272 TraceCheckUtils]: 27: Hoare triple {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:05,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,911 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3721#true} {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} #66#return; {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 6 main_~z~0))} is VALID [2022-04-28 10:44:05,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {3741#(and (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 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; {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:05,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !false; {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:05,914 INFO L272 TraceCheckUtils]: 34: Hoare triple {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:05,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,920 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3721#true} {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} #58#return; {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:05,921 INFO L272 TraceCheckUtils]: 39: Hoare triple {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 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)); {3721#true} is VALID [2022-04-28 10:44:05,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,923 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3721#true} {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} #60#return; {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:05,923 INFO L272 TraceCheckUtils]: 44: Hoare triple {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:05,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,923 INFO L290 TraceCheckUtils]: 46: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,923 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3721#true} {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} #62#return; {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:05,924 INFO L272 TraceCheckUtils]: 49: Hoare triple {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 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)); {3721#true} is VALID [2022-04-28 10:44:05,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,925 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3721#true} {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} #64#return; {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:05,925 INFO L272 TraceCheckUtils]: 54: Hoare triple {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 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)); {3721#true} is VALID [2022-04-28 10:44:05,925 INFO L290 TraceCheckUtils]: 55: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,925 INFO L290 TraceCheckUtils]: 56: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,925 INFO L290 TraceCheckUtils]: 57: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,926 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3721#true} {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} #66#return; {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:05,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {3823#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {3905#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 10:44:05,927 INFO L272 TraceCheckUtils]: 60: Hoare triple {3905#(and (= (+ 5 main_~y~0) main_~z~0) (<= 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)); {3721#true} is VALID [2022-04-28 10:44:05,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,927 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3721#true} {3905#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #68#return; {3905#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 10:44:05,928 INFO L272 TraceCheckUtils]: 65: Hoare triple {3905#(and (= (+ 5 main_~y~0) main_~z~0) (<= 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)); {3721#true} is VALID [2022-04-28 10:44:05,928 INFO L290 TraceCheckUtils]: 66: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:05,928 INFO L290 TraceCheckUtils]: 67: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:05,928 INFO L290 TraceCheckUtils]: 68: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:05,931 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {3721#true} {3905#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #70#return; {3905#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 10:44:05,933 INFO L272 TraceCheckUtils]: 70: Hoare triple {3905#(and (= (+ 5 main_~y~0) main_~z~0) (<= 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)); {3939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:05,933 INFO L290 TraceCheckUtils]: 71: Hoare triple {3939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:05,933 INFO L290 TraceCheckUtils]: 72: Hoare triple {3943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3722#false} is VALID [2022-04-28 10:44:05,933 INFO L290 TraceCheckUtils]: 73: Hoare triple {3722#false} assume !false; {3722#false} is VALID [2022-04-28 10:44:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 10:44:05,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:44:06,907 INFO L290 TraceCheckUtils]: 73: Hoare triple {3722#false} assume !false; {3722#false} is VALID [2022-04-28 10:44:06,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {3943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3722#false} is VALID [2022-04-28 10:44:06,908 INFO L290 TraceCheckUtils]: 71: Hoare triple {3939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:06,908 INFO L272 TraceCheckUtils]: 70: Hoare triple {3959#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {3939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:06,909 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {3721#true} {3959#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #70#return; {3959#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 10:44:06,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,909 INFO L290 TraceCheckUtils]: 67: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,910 INFO L272 TraceCheckUtils]: 65: Hoare triple {3959#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,910 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3721#true} {3959#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #68#return; {3959#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 10:44:06,910 INFO L290 TraceCheckUtils]: 63: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,911 INFO L272 TraceCheckUtils]: 60: Hoare triple {3959#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,911 INFO L290 TraceCheckUtils]: 59: Hoare triple {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {3959#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 10:44:06,912 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3721#true} {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #66#return; {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 10:44:06,912 INFO L290 TraceCheckUtils]: 57: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,912 INFO L290 TraceCheckUtils]: 56: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,912 INFO L290 TraceCheckUtils]: 55: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,912 INFO L272 TraceCheckUtils]: 54: Hoare triple {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,913 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3721#true} {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #64#return; {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 10:44:06,913 INFO L290 TraceCheckUtils]: 52: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,913 INFO L290 TraceCheckUtils]: 51: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,913 INFO L290 TraceCheckUtils]: 50: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,913 INFO L272 TraceCheckUtils]: 49: Hoare triple {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,914 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3721#true} {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #62#return; {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 10:44:06,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,914 INFO L272 TraceCheckUtils]: 44: Hoare triple {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,915 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3721#true} {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #60#return; {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 10:44:06,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,915 INFO L272 TraceCheckUtils]: 39: Hoare triple {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,916 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3721#true} {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #58#return; {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 10:44:06,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,916 INFO L272 TraceCheckUtils]: 34: Hoare triple {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !false; {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 10:44:06,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} 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; {3993#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 10:44:06,920 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3721#true} {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} #66#return; {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-28 10:44:06,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,920 INFO L272 TraceCheckUtils]: 27: Hoare triple {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,921 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3721#true} {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} #64#return; {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-28 10:44:06,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,921 INFO L272 TraceCheckUtils]: 22: Hoare triple {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,922 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3721#true} {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} #62#return; {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-28 10:44:06,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,922 INFO L272 TraceCheckUtils]: 17: Hoare triple {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,923 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3721#true} {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} #60#return; {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-28 10:44:06,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,923 INFO L272 TraceCheckUtils]: 12: Hoare triple {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,924 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3721#true} {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} #58#return; {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-28 10:44:06,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {3721#true} assume !(0 == ~cond); {3721#true} is VALID [2022-04-28 10:44:06,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {3721#true} ~cond := #in~cond; {3721#true} is VALID [2022-04-28 10:44:06,924 INFO L272 TraceCheckUtils]: 7: Hoare triple {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3721#true} is VALID [2022-04-28 10:44:06,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} assume !false; {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-28 10:44:06,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {3721#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; {4075#(or (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-28 10:44:06,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {3721#true} call #t~ret5 := main(); {3721#true} is VALID [2022-04-28 10:44:06,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3721#true} {3721#true} #80#return; {3721#true} is VALID [2022-04-28 10:44:06,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {3721#true} assume true; {3721#true} is VALID [2022-04-28 10:44:06,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {3721#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); {3721#true} is VALID [2022-04-28 10:44:06,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {3721#true} call ULTIMATE.init(); {3721#true} is VALID [2022-04-28 10:44:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 10:44:06,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:06,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643585697] [2022-04-28 10:44:06,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:44:06,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404533317] [2022-04-28 10:44:06,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404533317] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:44:06,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:44:06,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 10:44:06,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:06,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1634528978] [2022-04-28 10:44:06,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1634528978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:06,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:06,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:44:06,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604791783] [2022-04-28 10:44:06,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:06,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 74 [2022-04-28 10:44:06,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:06,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-28 10:44:06,979 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-28 10:44:06,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:44:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:06,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:44:06,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:44:06,979 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-28 10:44:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:07,681 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-04-28 10:44:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:44:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 74 [2022-04-28 10:44:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-28 10:44:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-28 10:44:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-28 10:44:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-28 10:44:07,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-28 10:44:07,757 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-28 10:44:07,759 INFO L225 Difference]: With dead ends: 85 [2022-04-28 10:44:07,759 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 10:44:07,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:44:07,760 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 161 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:07,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 161 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:44:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 10:44:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-04-28 10:44:07,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:07,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 72 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:44:07,845 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 72 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:44:07,846 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 72 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:44:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:07,848 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-04-28 10:44:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-04-28 10:44:07,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:07,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:07,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 72 states. [2022-04-28 10:44:07,849 INFO L87 Difference]: Start difference. First operand has 72 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 72 states. [2022-04-28 10:44:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:07,851 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-04-28 10:44:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-04-28 10:44:07,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:07,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:07,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:07,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:44:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-04-28 10:44:07,853 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 74 [2022-04-28 10:44:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:07,854 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-04-28 10:44:07,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-28 10:44:07,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 80 transitions. [2022-04-28 10:44:07,985 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-28 10:44:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-04-28 10:44:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 10:44:07,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:07,987 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 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-28 10:44:08,004 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-28 10:44:08,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:08,192 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1850238457, now seen corresponding path program 3 times [2022-04-28 10:44:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:08,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848470424] [2022-04-28 10:44:08,523 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:08,523 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:08,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1850238457, now seen corresponding path program 4 times [2022-04-28 10:44:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:08,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579091608] [2022-04-28 10:44:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:08,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:08,540 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:44:08,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508712604] [2022-04-28 10:44:08,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:44:08,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:08,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:08,549 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-28 10:44:08,550 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-28 10:44:08,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:44:08,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:08,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:44:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:08,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:09,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {4636#true} call ULTIMATE.init(); {4636#true} is VALID [2022-04-28 10:44:09,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {4636#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); {4636#true} is VALID [2022-04-28 10:44:09,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4636#true} {4636#true} #80#return; {4636#true} is VALID [2022-04-28 10:44:09,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {4636#true} call #t~ret5 := main(); {4636#true} is VALID [2022-04-28 10:44:09,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {4636#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; {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:44:09,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:44:09,270 INFO L272 TraceCheckUtils]: 7: Hoare triple {4656#(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)); {4636#true} is VALID [2022-04-28 10:44:09,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,270 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4636#true} {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #58#return; {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:44:09,270 INFO L272 TraceCheckUtils]: 12: Hoare triple {4656#(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)); {4636#true} is VALID [2022-04-28 10:44:09,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,275 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4636#true} {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #60#return; {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:44:09,275 INFO L272 TraceCheckUtils]: 17: Hoare triple {4656#(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)); {4636#true} is VALID [2022-04-28 10:44:09,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,276 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4636#true} {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:44:09,277 INFO L272 TraceCheckUtils]: 22: Hoare triple {4656#(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)); {4636#true} is VALID [2022-04-28 10:44:09,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,277 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4636#true} {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:44:09,277 INFO L272 TraceCheckUtils]: 27: Hoare triple {4656#(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)); {4636#true} is VALID [2022-04-28 10:44:09,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,278 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4636#true} {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {4656#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 10:44:09,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {4656#(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; {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:44:09,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !false; {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:44:09,279 INFO L272 TraceCheckUtils]: 34: Hoare triple {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4636#true} is VALID [2022-04-28 10:44:09,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,279 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4636#true} {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #58#return; {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:44:09,279 INFO L272 TraceCheckUtils]: 39: Hoare triple {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4636#true} is VALID [2022-04-28 10:44:09,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,283 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4636#true} {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #60#return; {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:44:09,283 INFO L272 TraceCheckUtils]: 44: Hoare triple {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4636#true} is VALID [2022-04-28 10:44:09,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,284 INFO L290 TraceCheckUtils]: 47: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,284 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4636#true} {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #62#return; {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:44:09,284 INFO L272 TraceCheckUtils]: 49: Hoare triple {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) 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)); {4636#true} is VALID [2022-04-28 10:44:09,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,287 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4636#true} {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #64#return; {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:44:09,287 INFO L272 TraceCheckUtils]: 54: Hoare triple {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4636#true} is VALID [2022-04-28 10:44:09,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,288 INFO L290 TraceCheckUtils]: 56: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,288 INFO L290 TraceCheckUtils]: 57: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,288 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4636#true} {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #66#return; {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:44:09,289 INFO L290 TraceCheckUtils]: 59: Hoare triple {4738#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1) (= 6 (+ (- 1) 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; {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} is VALID [2022-04-28 10:44:09,289 INFO L290 TraceCheckUtils]: 60: Hoare triple {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} assume !false; {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} is VALID [2022-04-28 10:44:09,289 INFO L272 TraceCheckUtils]: 61: Hoare triple {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4636#true} is VALID [2022-04-28 10:44:09,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,290 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {4636#true} {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} #58#return; {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} is VALID [2022-04-28 10:44:09,290 INFO L272 TraceCheckUtils]: 66: Hoare triple {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4636#true} is VALID [2022-04-28 10:44:09,290 INFO L290 TraceCheckUtils]: 67: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,290 INFO L290 TraceCheckUtils]: 68: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,290 INFO L290 TraceCheckUtils]: 69: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,290 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4636#true} {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} #60#return; {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} is VALID [2022-04-28 10:44:09,290 INFO L272 TraceCheckUtils]: 71: Hoare triple {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4636#true} is VALID [2022-04-28 10:44:09,290 INFO L290 TraceCheckUtils]: 72: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,291 INFO L290 TraceCheckUtils]: 73: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,291 INFO L290 TraceCheckUtils]: 74: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,291 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {4636#true} {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} #62#return; {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} is VALID [2022-04-28 10:44:09,291 INFO L272 TraceCheckUtils]: 76: Hoare triple {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4636#true} is VALID [2022-04-28 10:44:09,291 INFO L290 TraceCheckUtils]: 77: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,291 INFO L290 TraceCheckUtils]: 78: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,291 INFO L290 TraceCheckUtils]: 79: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,292 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4636#true} {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} #64#return; {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} is VALID [2022-04-28 10:44:09,292 INFO L272 TraceCheckUtils]: 81: Hoare triple {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4636#true} is VALID [2022-04-28 10:44:09,292 INFO L290 TraceCheckUtils]: 82: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,292 INFO L290 TraceCheckUtils]: 83: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,292 INFO L290 TraceCheckUtils]: 84: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,292 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {4636#true} {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} #66#return; {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} is VALID [2022-04-28 10:44:09,293 INFO L290 TraceCheckUtils]: 86: Hoare triple {4820#(and (<= main_~n~0 2) (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0))} assume !(~n~0 <= ~a~0); {4902#(and (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 10:44:09,293 INFO L272 TraceCheckUtils]: 87: Hoare triple {4902#(and (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4636#true} is VALID [2022-04-28 10:44:09,293 INFO L290 TraceCheckUtils]: 88: Hoare triple {4636#true} ~cond := #in~cond; {4636#true} is VALID [2022-04-28 10:44:09,293 INFO L290 TraceCheckUtils]: 89: Hoare triple {4636#true} assume !(0 == ~cond); {4636#true} is VALID [2022-04-28 10:44:09,293 INFO L290 TraceCheckUtils]: 90: Hoare triple {4636#true} assume true; {4636#true} is VALID [2022-04-28 10:44:09,294 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {4636#true} {4902#(and (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2))} #68#return; {4902#(and (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 10:44:09,294 INFO L272 TraceCheckUtils]: 92: Hoare triple {4902#(and (= (+ main_~x~0 (- 8)) 0) (= (+ main_~z~0 (- 6)) 12) (<= 1 main_~a~0) (< 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)); {4921#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:09,295 INFO L290 TraceCheckUtils]: 93: Hoare triple {4921#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4925#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:09,295 INFO L290 TraceCheckUtils]: 94: Hoare triple {4925#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4637#false} is VALID [2022-04-28 10:44:09,295 INFO L290 TraceCheckUtils]: 95: Hoare triple {4637#false} assume !false; {4637#false} is VALID [2022-04-28 10:44:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 10:44:09,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:44:09,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:09,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579091608] [2022-04-28 10:44:09,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:44:09,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508712604] [2022-04-28 10:44:09,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508712604] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:44:09,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:44:09,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 10:44:09,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:09,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848470424] [2022-04-28 10:44:09,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848470424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:09,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:09,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:44:09,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328198065] [2022-04-28 10:44:09,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 96 [2022-04-28 10:44:09,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:09,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 10:44:09,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:09,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:44:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:09,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:44:09,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:44:09,721 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 10:44:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:10,528 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-04-28 10:44:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:44:10,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 96 [2022-04-28 10:44:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 10:44:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-28 10:44:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 10:44:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-28 10:44:10,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2022-04-28 10:44:10,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:10,621 INFO L225 Difference]: With dead ends: 96 [2022-04-28 10:44:10,621 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 10:44:10,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:44:10,622 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:10,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 162 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:44:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 10:44:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-04-28 10:44:10,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:10,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 93 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 53 states have internal predecessors, (54), 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-28 10:44:10,729 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 93 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 53 states have internal predecessors, (54), 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-28 10:44:10,730 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 93 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 53 states have internal predecessors, (54), 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-28 10:44:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:10,733 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2022-04-28 10:44:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-04-28 10:44:10,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:10,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:10,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 53 states have internal predecessors, (54), 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 94 states. [2022-04-28 10:44:10,735 INFO L87 Difference]: Start difference. First operand has 93 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 53 states have internal predecessors, (54), 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 94 states. [2022-04-28 10:44:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:10,738 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2022-04-28 10:44:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-04-28 10:44:10,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:10,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:10,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:10,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 53 states have internal predecessors, (54), 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-28 10:44:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2022-04-28 10:44:10,741 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 96 [2022-04-28 10:44:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:10,742 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2022-04-28 10:44:10,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 10:44:10,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 106 transitions. [2022-04-28 10:44:10,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-04-28 10:44:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 10:44:10,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:10,931 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 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-28 10:44:10,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:44:11,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:44:11,140 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:11,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1444427638, now seen corresponding path program 3 times [2022-04-28 10:44:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:11,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873450611] [2022-04-28 10:44:11,392 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:11,392 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1444427638, now seen corresponding path program 4 times [2022-04-28 10:44:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:11,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551898595] [2022-04-28 10:44:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:11,400 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:44:11,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562667958] [2022-04-28 10:44:11,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:44:11,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:11,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:11,403 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-28 10:44:11,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process