/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:13:20,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:13:20,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:13:20,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:13:20,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:13:20,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:13:20,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:13:20,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:13:20,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:13:20,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:13:20,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:13:20,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:13:20,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:13:20,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:13:20,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:13:20,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:13:20,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:13:20,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:13:20,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:13:20,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:13:20,325 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:13:20,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:13:20,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:13:20,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:13:20,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:13:20,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:13:20,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:13:20,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:13:20,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:13:20,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:13:20,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:13:20,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:13:20,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:13:20,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:13:20,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:13:20,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:13:20,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:13:20,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:13:20,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:13:20,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:13:20,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:13:20,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:13:20,348 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 11:13:20,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:13:20,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:13:20,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:13:20,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:13:20,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:13:20,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:13:20,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:13:20,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:13:20,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:13:20,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:13:20,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:13:20,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:13:20,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:13:20,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:13:20,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:13:20,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:13:20,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:13:20,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:13:20,364 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:13:20,364 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:13:20,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:13:20,364 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:13:20,364 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 11:13:20,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:13:20,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:13:20,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:13:20,570 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:13:20,571 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:13:20,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-04-28 11:13:20,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af63ffb/bda02983d100484680a8abaf31252aaf/FLAG1857ed45d [2022-04-28 11:13:21,017 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:13:21,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-04-28 11:13:21,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af63ffb/bda02983d100484680a8abaf31252aaf/FLAG1857ed45d [2022-04-28 11:13:21,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af63ffb/bda02983d100484680a8abaf31252aaf [2022-04-28 11:13:21,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:13:21,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:13:21,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:13:21,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:13:21,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:13:21,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:13:21" (1/1) ... [2022-04-28 11:13:21,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ba79ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21, skipping insertion in model container [2022-04-28 11:13:21,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:13:21" (1/1) ... [2022-04-28 11:13:21,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:13:21,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:13:21,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c[588,601] [2022-04-28 11:13:21,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:13:21,600 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:13:21,610 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c[588,601] [2022-04-28 11:13:21,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:13:21,637 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:13:21,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21 WrapperNode [2022-04-28 11:13:21,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:13:21,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:13:21,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:13:21,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:13:21,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21" (1/1) ... [2022-04-28 11:13:21,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21" (1/1) ... [2022-04-28 11:13:21,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21" (1/1) ... [2022-04-28 11:13:21,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21" (1/1) ... [2022-04-28 11:13:21,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21" (1/1) ... [2022-04-28 11:13:21,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21" (1/1) ... [2022-04-28 11:13:21,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21" (1/1) ... [2022-04-28 11:13:21,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:13:21,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:13:21,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:13:21,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:13:21,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21" (1/1) ... [2022-04-28 11:13:21,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:13:21,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:21,715 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 11:13:21,733 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 11:13:21,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:13:21,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:13:21,752 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:13:21,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:13:21,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:13:21,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:13:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:13:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:13:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:13:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:13:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:13:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:13:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:13:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:13:21,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:13:21,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:13:21,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:13:21,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:13:21,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:13:21,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:13:21,809 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:13:21,811 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:13:21,984 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:13:21,990 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:13:21,990 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:13:21,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:13:21 BoogieIcfgContainer [2022-04-28 11:13:21,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:13:21,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:13:21,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:13:21,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:13:21,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:13:21" (1/3) ... [2022-04-28 11:13:21,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fe17de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:13:21, skipping insertion in model container [2022-04-28 11:13:21,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:21" (2/3) ... [2022-04-28 11:13:21,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fe17de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:13:21, skipping insertion in model container [2022-04-28 11:13:21,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:13:21" (3/3) ... [2022-04-28 11:13:21,998 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.c [2022-04-28 11:13:22,009 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:13:22,009 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:13:22,077 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:13:22,099 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@6e59a394, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53efc599 [2022-04-28 11:13:22,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:13:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 11:13:22,128 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:22,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:22,129 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-28 11:13:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:22,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1177364607] [2022-04-28 11:13:22,175 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:22,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-28 11:13:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:22,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809125832] [2022-04-28 11:13:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:22,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:13:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:22,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 11:13:22,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:13:22,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:13:22,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:13:22,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 11:13:22,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:13:22,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:13:22,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-28 11:13:22,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-28 11:13:22,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 11:13:22,416 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-28 11:13:22,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 11:13:22,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 11:13:22,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 11:13:22,417 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 11:13:22,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:22,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809125832] [2022-04-28 11:13:22,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809125832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:22,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:22,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:13:22,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:22,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1177364607] [2022-04-28 11:13:22,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1177364607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:22,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:22,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:13:22,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204266778] [2022-04-28 11:13:22,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:22,429 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 11:13:22,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:22,433 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 11:13:22,453 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 11:13:22,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:13:22,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:22,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:13:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:13:22,479 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:22,723 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-28 11:13:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:13:22,723 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 11:13:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:22,725 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 11:13:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:13:22,741 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 11:13:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:13:22,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-28 11:13:22,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:22,877 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:13:22,878 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 11:13:22,881 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 11:13:22,884 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:22,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:22,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 11:13:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 11:13:22,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:22,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:22,922 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:22,923 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:22,930 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:13:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:13:22,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:22,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:22,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-28 11:13:22,932 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-28 11:13:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:22,944 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:13:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:13:22,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:22,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:22,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:22,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-28 11:13:22,952 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-28 11:13:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:22,952 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-28 11:13:22,953 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 11:13:22,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-28 11:13:22,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-28 11:13:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:13:23,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:23,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:23,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:13:23,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:23,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-28 11:13:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:23,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1529178289] [2022-04-28 11:13:23,014 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-28 11:13:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:23,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466342335] [2022-04-28 11:13:23,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:13:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:23,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:23,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:23,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:23,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:13:23,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:23,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:23,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:23,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:23,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:23,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {268#(= |main_#t~post5| 0)} is VALID [2022-04-28 11:13:23,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {263#false} is VALID [2022-04-28 11:13:23,139 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {263#false} is VALID [2022-04-28 11:13:23,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 11:13:23,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 11:13:23,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 11:13:23,140 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 11:13:23,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:23,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466342335] [2022-04-28 11:13:23,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466342335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:23,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:23,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:13:23,142 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:23,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1529178289] [2022-04-28 11:13:23,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1529178289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:23,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:23,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:13:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689212551] [2022-04-28 11:13:23,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:23,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:23,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:23,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:23,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:23,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:23,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:23,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:23,157 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:23,380 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-28 11:13:23,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:23,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:13:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:13:23,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-28 11:13:23,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:23,442 INFO L225 Difference]: With dead ends: 40 [2022-04-28 11:13:23,442 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 11:13:23,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:23,444 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:23,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 11:13:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 11:13:23,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:23,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:23,451 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:23,451 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:23,454 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:13:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:13:23,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:23,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:23,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-28 11:13:23,456 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-28 11:13:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:23,458 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:13:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:13:23,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:23,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:23,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:23,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-28 11:13:23,462 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-28 11:13:23,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:23,462 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-28 11:13:23,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:23,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-28 11:13:23,518 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 11:13:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:13:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:13:23,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:23,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:23,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:13:23,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:23,523 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-28 11:13:23,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:23,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683704451] [2022-04-28 11:13:23,525 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:23,525 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-28 11:13:23,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:23,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305749719] [2022-04-28 11:13:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:23,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:23,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:13:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:23,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-28 11:13:23,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:13:23,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:13:23,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:13:23,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-28 11:13:23,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:13:23,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:13:23,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-28 11:13:23,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:13:23,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:13:23,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 2);havoc #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:13:23,683 INFO L272 TraceCheckUtils]: 8: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:23,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:23,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-28 11:13:23,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-28 11:13:23,685 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 11:13:23,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:23,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305749719] [2022-04-28 11:13:23,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305749719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:23,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:23,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:23,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:23,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683704451] [2022-04-28 11:13:23,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683704451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:23,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:23,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89219945] [2022-04-28 11:13:23,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:23,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:23,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:23,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:23,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:23,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:13:23,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:23,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:13:23,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:23,708 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:24,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:24,125 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-28 11:13:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:13:24,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:13:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:13:24,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 11:13:24,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:24,180 INFO L225 Difference]: With dead ends: 34 [2022-04-28 11:13:24,180 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 11:13:24,181 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 11:13:24,182 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:24,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 11:13:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 11:13:24,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:24,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:24,189 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:24,189 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:24,192 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:13:24,192 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:24,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:24,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:24,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-28 11:13:24,193 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-28 11:13:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:24,195 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:13:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:24,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:24,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:24,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:24,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 11:13:24,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 11:13:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:24,198 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 11:13:24,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:24,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 11:13:24,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:13:24,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:24,246 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:24,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 11:13:24,246 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:24,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-28 11:13:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:24,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1538771291] [2022-04-28 11:13:24,247 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-28 11:13:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:24,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298221384] [2022-04-28 11:13:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:24,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:24,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:24,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062563951] [2022-04-28 11:13:24,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:24,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:24,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:24,263 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 11:13:24,267 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 11:13:24,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:24,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:24,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:24,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:24,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-28 11:13:24,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {681#true} is VALID [2022-04-28 11:13:24,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:13:24,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-28 11:13:24,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-28 11:13:24,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:24,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:24,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:24,437 INFO L272 TraceCheckUtils]: 8: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {681#true} is VALID [2022-04-28 11:13:24,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-28 11:13:24,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-28 11:13:24,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:13:24,438 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {681#true} {701#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:24,439 INFO L272 TraceCheckUtils]: 13: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:24,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:24,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-28 11:13:24,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-28 11:13:24,440 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 11:13:24,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:24,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:24,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298221384] [2022-04-28 11:13:24,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:24,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062563951] [2022-04-28 11:13:24,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062563951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:24,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:24,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:24,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:24,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1538771291] [2022-04-28 11:13:24,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1538771291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:24,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:24,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:24,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660186148] [2022-04-28 11:13:24,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:24,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 11:13:24,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:24,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:24,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:24,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:24,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:24,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:24,459 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:24,721 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-28 11:13:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 11:13:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:24,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:24,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:24,798 INFO L225 Difference]: With dead ends: 50 [2022-04-28 11:13:24,799 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 11:13:24,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:24,800 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:24,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 11:13:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-28 11:13:24,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:24,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:24,814 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:24,815 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:24,818 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:13:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:13:24,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:24,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:24,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 11:13:24,820 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 11:13:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:24,823 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:13:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:13:24,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:24,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:24,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:24,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-28 11:13:24,827 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-28 11:13:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:24,827 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-28 11:13:24,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:24,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-28 11:13:24,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-28 11:13:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:13:24,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:24,888 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:24,914 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 11:13:25,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:25,107 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:25,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:25,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-28 11:13:25,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:25,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [987809079] [2022-04-28 11:13:25,108 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-28 11:13:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:25,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100843222] [2022-04-28 11:13:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:25,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:25,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:25,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048240018] [2022-04-28 11:13:25,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:25,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:25,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:25,130 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 11:13:25,132 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 11:13:25,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:25,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:25,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:25,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:25,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-28 11:13:25,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1010#true} is VALID [2022-04-28 11:13:25,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:25,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-28 11:13:25,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-28 11:13:25,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:25,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:25,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:25,348 INFO L272 TraceCheckUtils]: 8: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1010#true} is VALID [2022-04-28 11:13:25,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:13:25,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:13:25,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:25,349 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:25,351 INFO L272 TraceCheckUtils]: 13: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1010#true} is VALID [2022-04-28 11:13:25,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:13:25,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:13:25,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:25,353 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:25,353 INFO L272 TraceCheckUtils]: 18: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:25,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:25,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-28 11:13:25,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-28 11:13:25,355 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 11:13:25,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:25,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:25,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100843222] [2022-04-28 11:13:25,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:25,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048240018] [2022-04-28 11:13:25,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048240018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:25,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:25,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:25,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:25,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [987809079] [2022-04-28 11:13:25,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [987809079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:25,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:25,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:25,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15989818] [2022-04-28 11:13:25,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:25,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:13:25,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:25,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:25,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:25,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:25,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:25,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:25,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:25,373 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:25,599 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:13:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:25,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:13:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:25,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:25,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:25,667 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:13:25,668 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:13:25,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:25,673 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:25,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:13:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:13:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-28 11:13:25,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:25,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:25,698 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:25,700 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:25,705 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:13:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:13:25,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:25,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:25,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-28 11:13:25,707 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-28 11:13:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:25,711 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:13:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:13:25,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:25,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:25,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:25,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-28 11:13:25,716 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-28 11:13:25,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:25,717 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-28 11:13:25,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:25,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-28 11:13:25,795 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 11:13:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-28 11:13:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:13:25,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:25,796 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:25,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 11:13:26,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:26,009 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-28 11:13:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:26,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1066028011] [2022-04-28 11:13:26,010 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-28 11:13:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:26,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526037386] [2022-04-28 11:13:26,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:26,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:26,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:26,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679421453] [2022-04-28 11:13:26,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:26,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:26,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:26,032 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 11:13:26,032 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 11:13:26,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:26,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:26,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:13:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:26,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:26,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-28 11:13:26,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1390#true} is VALID [2022-04-28 11:13:26,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:26,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-28 11:13:26,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-28 11:13:26,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:26,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:26,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 2);havoc #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:26,219 INFO L272 TraceCheckUtils]: 8: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-28 11:13:26,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:26,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:26,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:26,220 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:26,221 INFO L272 TraceCheckUtils]: 13: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1390#true} is VALID [2022-04-28 11:13:26,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:26,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:26,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:26,222 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:26,222 INFO L272 TraceCheckUtils]: 18: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-28 11:13:26,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:26,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:26,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:26,225 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:26,226 INFO L272 TraceCheckUtils]: 23: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:26,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:26,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-28 11:13:26,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-28 11:13:26,228 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 11:13:26,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:26,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:26,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526037386] [2022-04-28 11:13:26,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:26,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679421453] [2022-04-28 11:13:26,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679421453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:26,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:26,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:26,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:26,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1066028011] [2022-04-28 11:13:26,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1066028011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:26,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:26,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:26,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146081846] [2022-04-28 11:13:26,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:26,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:13:26,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:26,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:26,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:26,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:26,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:26,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:26,250 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:26,611 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-28 11:13:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:26,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:13:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:26,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:26,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:26,683 INFO L225 Difference]: With dead ends: 62 [2022-04-28 11:13:26,683 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 11:13:26,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:26,684 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:26,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 11:13:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 11:13:26,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:26,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:26,707 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:26,710 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:26,712 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:13:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:26,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:26,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:26,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-28 11:13:26,713 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-28 11:13:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:26,715 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:13:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:26,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:26,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:26,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:26,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-28 11:13:26,720 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-28 11:13:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:26,720 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-28 11:13:26,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:26,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-28 11:13:26,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:13:26,797 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:26,797 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:26,821 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 11:13:26,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:26,998 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:26,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-28 11:13:26,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:26,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [660226304] [2022-04-28 11:13:27,423 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:27,423 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:27,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 2 times [2022-04-28 11:13:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:27,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488270108] [2022-04-28 11:13:27,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:27,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:27,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:27,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590511827] [2022-04-28 11:13:27,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:27,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:27,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:27,440 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 11:13:27,468 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 11:13:27,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:27,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:27,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:27,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:27,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:13:27,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:27,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:27,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#(<= ~counter~0 0)} {1801#true} #81#return; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:27,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(<= ~counter~0 0)} call #t~ret6 := main(); {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:27,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {1809#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:27,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {1809#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,717 INFO L272 TraceCheckUtils]: 8: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,727 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #59#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,728 INFO L272 TraceCheckUtils]: 13: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,730 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #61#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,731 INFO L272 TraceCheckUtils]: 18: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,732 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #63#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,733 INFO L272 TraceCheckUtils]: 23: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,736 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #65#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,736 INFO L272 TraceCheckUtils]: 28: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,738 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #67#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {1825#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {1825#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1910#(<= |main_#t~post5| 1)} is VALID [2022-04-28 11:13:27,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:13:27,739 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:13:27,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:27,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {1802#false} assume !(0 == ~cond); {1802#false} is VALID [2022-04-28 11:13:27,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {1802#false} assume true; {1802#false} is VALID [2022-04-28 11:13:27,740 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1802#false} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:13:27,740 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:13:27,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:27,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:13:27,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:13:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 11:13:27,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:27,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:13:27,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:13:27,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:27,940 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:13:27,940 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1801#true} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:13:27,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:27,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:27,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:27,940 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:27,941 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:13:27,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {1825#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1910#(<= |main_#t~post5| 1)} is VALID [2022-04-28 11:13:27,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {1825#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,942 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1801#true} {1825#(<= ~counter~0 1)} #67#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:27,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:27,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:27,943 INFO L272 TraceCheckUtils]: 28: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:27,943 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1801#true} {1825#(<= ~counter~0 1)} #65#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:27,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:27,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:27,944 INFO L272 TraceCheckUtils]: 23: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:27,944 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1801#true} {1825#(<= ~counter~0 1)} #63#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:27,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:27,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:27,945 INFO L272 TraceCheckUtils]: 18: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:27,945 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1801#true} {1825#(<= ~counter~0 1)} #61#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:27,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:27,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:27,946 INFO L272 TraceCheckUtils]: 13: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:27,946 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1801#true} {1825#(<= ~counter~0 1)} #59#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:27,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:27,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:27,947 INFO L272 TraceCheckUtils]: 8: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:27,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {1809#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:27,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {1809#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:27,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(<= ~counter~0 0)} call #t~ret6 := main(); {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:27,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#(<= ~counter~0 0)} {1801#true} #81#return; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:27,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:27,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:27,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:13:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:13:27,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488270108] [2022-04-28 11:13:27,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:27,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590511827] [2022-04-28 11:13:27,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590511827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:27,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:27,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-28 11:13:27,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:27,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [660226304] [2022-04-28 11:13:27,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [660226304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:27,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:27,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948963872] [2022-04-28 11:13:27,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:27,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:27,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:27,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:27,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:27,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:27,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:27,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:27,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:27,984 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:28,237 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-28 11:13:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:28,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:13:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:13:28,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-28 11:13:28,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:28,301 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:13:28,301 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:13:28,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:28,303 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:28,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:13:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:13:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 11:13:28,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:28,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:28,344 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:28,345 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:28,347 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:13:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:28,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:28,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:28,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-28 11:13:28,348 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-28 11:13:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:28,350 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:13:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:28,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:28,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:28,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:28,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 11:13:28,352 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-28 11:13:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:28,353 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 11:13:28,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:28,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 11:13:28,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:13:28,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:28,439 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:28,454 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 11:13:28,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:28,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-28 11:13:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:28,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [356187689] [2022-04-28 11:13:29,044 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:29,045 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 2 times [2022-04-28 11:13:29,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:29,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597962956] [2022-04-28 11:13:29,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:29,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:29,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:29,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [74729579] [2022-04-28 11:13:29,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:29,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:29,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:29,057 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 11:13:29,069 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 11:13:29,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:29,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:29,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:13:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:29,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:29,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2022-04-28 11:13:29,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2445#true} is VALID [2022-04-28 11:13:29,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #81#return; {2445#true} is VALID [2022-04-28 11:13:29,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret6 := main(); {2445#true} is VALID [2022-04-28 11:13:29,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {2445#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; {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:29,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:29,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 2);havoc #t~post5; {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:29,323 INFO L272 TraceCheckUtils]: 8: Hoare triple {2465#(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)); {2445#true} is VALID [2022-04-28 11:13:29,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,324 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2445#true} {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:29,324 INFO L272 TraceCheckUtils]: 13: Hoare triple {2465#(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)); {2445#true} is VALID [2022-04-28 11:13:29,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,325 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2445#true} {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:29,325 INFO L272 TraceCheckUtils]: 18: Hoare triple {2465#(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)); {2445#true} is VALID [2022-04-28 11:13:29,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,326 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2445#true} {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:29,326 INFO L272 TraceCheckUtils]: 23: Hoare triple {2465#(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)); {2445#true} is VALID [2022-04-28 11:13:29,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,327 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2445#true} {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:29,327 INFO L272 TraceCheckUtils]: 28: Hoare triple {2465#(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)); {2445#true} is VALID [2022-04-28 11:13:29,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,328 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2445#true} {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2465#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:29,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {2465#(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; {2550#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:29,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {2550#(and (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2550#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:29,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {2550#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:29,329 INFO L272 TraceCheckUtils]: 36: Hoare triple {2550#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2445#true} is VALID [2022-04-28 11:13:29,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,330 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2445#true} {2550#(and (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {2550#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:29,331 INFO L272 TraceCheckUtils]: 41: Hoare triple {2550#(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)); {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:29,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:29,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {2579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2446#false} is VALID [2022-04-28 11:13:29,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2022-04-28 11:13:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:13:29,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:29,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2022-04-28 11:13:29,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {2579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2446#false} is VALID [2022-04-28 11:13:29,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:29,522 INFO L272 TraceCheckUtils]: 41: Hoare triple {2595#(= (+ (* 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)); {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:29,523 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2445#true} {2595#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2595#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:29,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,524 INFO L272 TraceCheckUtils]: 36: Hoare triple {2595#(= (+ (* 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)); {2445#true} is VALID [2022-04-28 11:13:29,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {2595#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 2);havoc #t~post5; {2595#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:29,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {2595#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2595#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:29,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {2620#(= (+ (* 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; {2595#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:29,533 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2445#true} {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #67#return; {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:29,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,533 INFO L272 TraceCheckUtils]: 28: Hoare triple {2620#(= (+ (* 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)); {2445#true} is VALID [2022-04-28 11:13:29,534 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2445#true} {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #65#return; {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:29,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,534 INFO L272 TraceCheckUtils]: 23: Hoare triple {2620#(= (+ (* 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)); {2445#true} is VALID [2022-04-28 11:13:29,535 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2445#true} {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #63#return; {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:29,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,535 INFO L272 TraceCheckUtils]: 18: Hoare triple {2620#(= (+ (* 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)); {2445#true} is VALID [2022-04-28 11:13:29,536 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2445#true} {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #61#return; {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:29,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,536 INFO L272 TraceCheckUtils]: 13: Hoare triple {2620#(= (+ (* 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)); {2445#true} is VALID [2022-04-28 11:13:29,537 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2445#true} {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #59#return; {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:29,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 11:13:29,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 11:13:29,537 INFO L272 TraceCheckUtils]: 8: Hoare triple {2620#(= (+ (* 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)); {2445#true} is VALID [2022-04-28 11:13:29,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 2);havoc #t~post5; {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:29,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:29,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {2445#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; {2620#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:29,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret6 := main(); {2445#true} is VALID [2022-04-28 11:13:29,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #81#return; {2445#true} is VALID [2022-04-28 11:13:29,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 11:13:29,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2445#true} is VALID [2022-04-28 11:13:29,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2022-04-28 11:13:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:13:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:29,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597962956] [2022-04-28 11:13:29,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:29,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74729579] [2022-04-28 11:13:29,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74729579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:29,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:29,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:13:29,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:29,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [356187689] [2022-04-28 11:13:29,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [356187689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:29,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:29,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56888783] [2022-04-28 11:13:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:29,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:29,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:29,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:29,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:29,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:13:29,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:29,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:13:29,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:13:29,572 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:29,985 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-28 11:13:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:29,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:13:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:13:29,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-28 11:13:30,057 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 11:13:30,059 INFO L225 Difference]: With dead ends: 78 [2022-04-28 11:13:30,059 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 11:13:30,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:13:30,060 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:30,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 11:13:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-04-28 11:13:30,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:30,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:30,107 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:30,107 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:30,110 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:13:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:13:30,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:30,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:30,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-28 11:13:30,111 INFO L87 Difference]: Start difference. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-28 11:13:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:30,114 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:13:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:13:30,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:30,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:30,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:30,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-04-28 11:13:30,118 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 45 [2022-04-28 11:13:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:30,118 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-04-28 11:13:30,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:30,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 77 transitions. [2022-04-28 11:13:30,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 11:13:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:13:30,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:30,207 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:30,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:13:30,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:30,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:30,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 3 times [2022-04-28 11:13:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:30,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1728305530] [2022-04-28 11:13:30,797 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:30,797 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 4 times [2022-04-28 11:13:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:30,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560486416] [2022-04-28 11:13:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:30,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:30,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [907143197] [2022-04-28 11:13:30,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:13:30,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:30,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:30,824 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 11:13:30,825 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 11:13:30,899 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:13:30,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:30,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 11:13:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:30,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:31,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {3164#true} call ULTIMATE.init(); {3164#true} is VALID [2022-04-28 11:13:31,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {3164#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3164#true} is VALID [2022-04-28 11:13:31,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {3164#true} assume true; {3164#true} is VALID [2022-04-28 11:13:31,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3164#true} {3164#true} #81#return; {3164#true} is VALID [2022-04-28 11:13:31,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {3164#true} call #t~ret6 := main(); {3164#true} is VALID [2022-04-28 11:13:31,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {3164#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; {3164#true} is VALID [2022-04-28 11:13:31,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {3164#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3164#true} is VALID [2022-04-28 11:13:31,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {3164#true} assume !!(#t~post5 < 2);havoc #t~post5; {3164#true} is VALID [2022-04-28 11:13:31,564 INFO L272 TraceCheckUtils]: 8: Hoare triple {3164#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3164#true} is VALID [2022-04-28 11:13:31,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {3164#true} ~cond := #in~cond; {3164#true} is VALID [2022-04-28 11:13:31,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {3164#true} assume !(0 == ~cond); {3164#true} is VALID [2022-04-28 11:13:31,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {3164#true} assume true; {3164#true} is VALID [2022-04-28 11:13:31,564 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3164#true} {3164#true} #59#return; {3164#true} is VALID [2022-04-28 11:13:31,564 INFO L272 TraceCheckUtils]: 13: Hoare triple {3164#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3164#true} is VALID [2022-04-28 11:13:31,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {3164#true} ~cond := #in~cond; {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:31,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:31,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:31,566 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} {3164#true} #61#return; {3222#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:31,566 INFO L272 TraceCheckUtils]: 18: Hoare triple {3222#(= (+ (* 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)); {3164#true} is VALID [2022-04-28 11:13:31,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {3164#true} ~cond := #in~cond; {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:31,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:31,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:31,568 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} {3222#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {3238#(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 11:13:31,568 INFO L272 TraceCheckUtils]: 23: Hoare triple {3238#(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)); {3164#true} is VALID [2022-04-28 11:13:31,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {3164#true} ~cond := #in~cond; {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:31,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:31,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:31,570 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} {3238#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 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 11:13:31,570 INFO L272 TraceCheckUtils]: 28: Hoare triple {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 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)); {3164#true} is VALID [2022-04-28 11:13:31,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {3164#true} ~cond := #in~cond; {3164#true} is VALID [2022-04-28 11:13:31,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {3164#true} assume !(0 == ~cond); {3164#true} is VALID [2022-04-28 11:13:31,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {3164#true} assume true; {3164#true} is VALID [2022-04-28 11:13:31,571 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3164#true} {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 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 11:13:33,573 WARN L290 TraceCheckUtils]: 33: Hoare triple {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 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; {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 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 UNKNOWN [2022-04-28 11:13:33,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 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 11:13:33,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 2);havoc #t~post5; {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 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 11:13:33,574 INFO L272 TraceCheckUtils]: 36: Hoare triple {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 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)); {3164#true} is VALID [2022-04-28 11:13:33,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {3164#true} ~cond := #in~cond; {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:33,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:33,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:33,576 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} {3254#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {3238#(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 11:13:33,576 INFO L272 TraceCheckUtils]: 41: Hoare triple {3238#(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)); {3164#true} is VALID [2022-04-28 11:13:33,576 INFO L290 TraceCheckUtils]: 42: Hoare triple {3164#true} ~cond := #in~cond; {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:33,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {3211#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:33,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:33,578 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} {3238#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3309#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:13:33,578 INFO L272 TraceCheckUtils]: 46: Hoare triple {3309#(= (* 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)); {3313#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:33,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {3313#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3317#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:33,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {3317#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3165#false} is VALID [2022-04-28 11:13:33,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {3165#false} assume !false; {3165#false} is VALID [2022-04-28 11:13:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-04-28 11:13:33,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:34,665 INFO L290 TraceCheckUtils]: 49: Hoare triple {3165#false} assume !false; {3165#false} is VALID [2022-04-28 11:13:34,665 INFO L290 TraceCheckUtils]: 48: Hoare triple {3317#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3165#false} is VALID [2022-04-28 11:13:34,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {3313#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3317#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:34,667 INFO L272 TraceCheckUtils]: 46: Hoare triple {3309#(= (* 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)); {3313#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:34,667 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} {3336#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3309#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:13:34,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:34,668 INFO L290 TraceCheckUtils]: 43: Hoare triple {3346#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:34,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {3164#true} ~cond := #in~cond; {3346#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:34,669 INFO L272 TraceCheckUtils]: 41: Hoare triple {3336#(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)); {3164#true} is VALID [2022-04-28 11:13:34,669 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} {3353#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {3336#(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 11:13:34,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:34,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {3346#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:34,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {3164#true} ~cond := #in~cond; {3346#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:34,671 INFO L272 TraceCheckUtils]: 36: Hoare triple {3353#(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)); {3164#true} is VALID [2022-04-28 11:13:34,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 2);havoc #t~post5; {3353#(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 11:13:34,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3353#(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 11:13:34,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {3353#(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 !!(~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; {3353#(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 11:13:34,679 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3164#true} {3353#(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))} #67#return; {3353#(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 11:13:34,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {3164#true} assume true; {3164#true} is VALID [2022-04-28 11:13:34,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {3164#true} assume !(0 == ~cond); {3164#true} is VALID [2022-04-28 11:13:34,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {3164#true} ~cond := #in~cond; {3164#true} is VALID [2022-04-28 11:13:34,679 INFO L272 TraceCheckUtils]: 28: Hoare triple {3353#(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 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3164#true} is VALID [2022-04-28 11:13:34,684 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} {3164#true} #65#return; {3353#(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 11:13:34,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:34,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {3346#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:34,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {3164#true} ~cond := #in~cond; {3346#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:34,685 INFO L272 TraceCheckUtils]: 23: Hoare triple {3164#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3164#true} is VALID [2022-04-28 11:13:34,685 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3164#true} {3164#true} #63#return; {3164#true} is VALID [2022-04-28 11:13:34,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {3164#true} assume true; {3164#true} is VALID [2022-04-28 11:13:34,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {3164#true} assume !(0 == ~cond); {3164#true} is VALID [2022-04-28 11:13:34,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {3164#true} ~cond := #in~cond; {3164#true} is VALID [2022-04-28 11:13:34,685 INFO L272 TraceCheckUtils]: 18: Hoare triple {3164#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3164#true} is VALID [2022-04-28 11:13:34,686 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3164#true} {3164#true} #61#return; {3164#true} is VALID [2022-04-28 11:13:34,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {3164#true} assume true; {3164#true} is VALID [2022-04-28 11:13:34,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {3164#true} assume !(0 == ~cond); {3164#true} is VALID [2022-04-28 11:13:34,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {3164#true} ~cond := #in~cond; {3164#true} is VALID [2022-04-28 11:13:34,686 INFO L272 TraceCheckUtils]: 13: Hoare triple {3164#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3164#true} is VALID [2022-04-28 11:13:34,686 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3164#true} {3164#true} #59#return; {3164#true} is VALID [2022-04-28 11:13:34,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {3164#true} assume true; {3164#true} is VALID [2022-04-28 11:13:34,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {3164#true} assume !(0 == ~cond); {3164#true} is VALID [2022-04-28 11:13:34,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {3164#true} ~cond := #in~cond; {3164#true} is VALID [2022-04-28 11:13:34,686 INFO L272 TraceCheckUtils]: 8: Hoare triple {3164#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3164#true} is VALID [2022-04-28 11:13:34,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {3164#true} assume !!(#t~post5 < 2);havoc #t~post5; {3164#true} is VALID [2022-04-28 11:13:34,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {3164#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3164#true} is VALID [2022-04-28 11:13:34,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {3164#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; {3164#true} is VALID [2022-04-28 11:13:34,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {3164#true} call #t~ret6 := main(); {3164#true} is VALID [2022-04-28 11:13:34,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3164#true} {3164#true} #81#return; {3164#true} is VALID [2022-04-28 11:13:34,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {3164#true} assume true; {3164#true} is VALID [2022-04-28 11:13:34,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {3164#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3164#true} is VALID [2022-04-28 11:13:34,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {3164#true} call ULTIMATE.init(); {3164#true} is VALID [2022-04-28 11:13:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 11:13:34,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:34,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560486416] [2022-04-28 11:13:34,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:34,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907143197] [2022-04-28 11:13:34,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907143197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:34,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:34,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-28 11:13:34,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:34,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1728305530] [2022-04-28 11:13:34,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1728305530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:34,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:34,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:13:34,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495957915] [2022-04-28 11:13:34,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:34,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-28 11:13:34,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:34,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:36,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:36,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:13:36,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:36,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:13:36,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:13:36,732 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:43,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:13:46,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:13:48,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:13:50,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:13:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:50,204 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-04-28 11:13:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:13:50,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-28 11:13:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 11:13:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 11:13:50,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 11:13:52,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 41 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:52,271 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:13:52,271 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 11:13:52,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:13:52,272 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 37 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:52,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 8.9s Time] [2022-04-28 11:13:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 11:13:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 11:13:52,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:52,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:52,342 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:52,342 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:52,345 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-28 11:13:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 11:13:52,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:52,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:52,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 68 states. [2022-04-28 11:13:52,345 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 68 states. [2022-04-28 11:13:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:52,348 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-28 11:13:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 11:13:52,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:52,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:52,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:52,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-04-28 11:13:52,351 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 50 [2022-04-28 11:13:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:52,351 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-04-28 11:13:52,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:13:52,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 76 transitions. [2022-04-28 11:13:54,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 11:13:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 11:13:54,475 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:54,475 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:54,502 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 11:13:54,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:54,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-28 11:13:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:54,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795832888] [2022-04-28 11:13:55,004 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:55,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 2 times [2022-04-28 11:13:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:55,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368590264] [2022-04-28 11:13:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:55,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:55,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:55,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985212128] [2022-04-28 11:13:55,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:55,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:55,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:55,019 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 11:13:55,024 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 11:13:55,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:55,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:55,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:13:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:55,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:55,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {3896#true} call ULTIMATE.init(); {3896#true} is VALID [2022-04-28 11:13:55,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {3896#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3896#true} is VALID [2022-04-28 11:13:55,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3896#true} {3896#true} #81#return; {3896#true} is VALID [2022-04-28 11:13:55,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {3896#true} call #t~ret6 := main(); {3896#true} is VALID [2022-04-28 11:13:55,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {3896#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; {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:55,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:55,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 2);havoc #t~post5; {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:55,633 INFO L272 TraceCheckUtils]: 8: Hoare triple {3916#(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)); {3896#true} is VALID [2022-04-28 11:13:55,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,634 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3896#true} {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:55,634 INFO L272 TraceCheckUtils]: 13: Hoare triple {3916#(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)); {3896#true} is VALID [2022-04-28 11:13:55,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,635 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3896#true} {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:55,635 INFO L272 TraceCheckUtils]: 18: Hoare triple {3916#(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)); {3896#true} is VALID [2022-04-28 11:13:55,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,636 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3896#true} {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:55,636 INFO L272 TraceCheckUtils]: 23: Hoare triple {3916#(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)); {3896#true} is VALID [2022-04-28 11:13:55,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,637 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3896#true} {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:55,637 INFO L272 TraceCheckUtils]: 28: Hoare triple {3916#(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)); {3896#true} is VALID [2022-04-28 11:13:55,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,638 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3896#true} {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {3916#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:55,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {3916#(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; {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:55,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:55,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:55,640 INFO L272 TraceCheckUtils]: 36: Hoare triple {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3896#true} is VALID [2022-04-28 11:13:55,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,641 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3896#true} {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #59#return; {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:55,641 INFO L272 TraceCheckUtils]: 41: Hoare triple {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3896#true} is VALID [2022-04-28 11:13:55,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,642 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3896#true} {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #61#return; {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:55,642 INFO L272 TraceCheckUtils]: 46: Hoare triple {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3896#true} is VALID [2022-04-28 11:13:55,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,643 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3896#true} {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #63#return; {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:55,643 INFO L272 TraceCheckUtils]: 51: Hoare triple {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3896#true} is VALID [2022-04-28 11:13:55,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,644 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3896#true} {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #65#return; {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:55,644 INFO L272 TraceCheckUtils]: 56: Hoare triple {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3896#true} is VALID [2022-04-28 11:13:55,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,644 INFO L290 TraceCheckUtils]: 58: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,644 INFO L290 TraceCheckUtils]: 59: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,645 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3896#true} {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #67#return; {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:13:55,646 INFO L290 TraceCheckUtils]: 61: Hoare triple {4001#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4086#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:13:55,646 INFO L272 TraceCheckUtils]: 62: Hoare triple {4086#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3896#true} is VALID [2022-04-28 11:13:55,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {3896#true} ~cond := #in~cond; {3896#true} is VALID [2022-04-28 11:13:55,646 INFO L290 TraceCheckUtils]: 64: Hoare triple {3896#true} assume !(0 == ~cond); {3896#true} is VALID [2022-04-28 11:13:55,646 INFO L290 TraceCheckUtils]: 65: Hoare triple {3896#true} assume true; {3896#true} is VALID [2022-04-28 11:13:55,647 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3896#true} {4086#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {4086#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:13:55,648 INFO L272 TraceCheckUtils]: 67: Hoare triple {4086#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:55,648 INFO L290 TraceCheckUtils]: 68: Hoare triple {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4109#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:55,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {4109#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3897#false} is VALID [2022-04-28 11:13:55,649 INFO L290 TraceCheckUtils]: 70: Hoare triple {3897#false} assume !false; {3897#false} is VALID [2022-04-28 11:13:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:13:55,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:56,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368590264] [2022-04-28 11:13:56,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:56,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985212128] [2022-04-28 11:13:56,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985212128] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:13:56,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:13:56,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:13:56,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:56,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795832888] [2022-04-28 11:13:56,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795832888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:56,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:56,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:13:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746482962] [2022-04-28 11:13:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-28 11:13:56,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:56,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:56,097 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 11:13:56,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:13:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:56,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:13:56,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:13:56,098 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:56,611 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-28 11:13:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:13:56,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-28 11:13:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 11:13:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 11:13:56,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-28 11:13:56,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:56,688 INFO L225 Difference]: With dead ends: 86 [2022-04-28 11:13:56,688 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:13:56,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:13:56,689 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:56,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 157 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:13:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:13:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-28 11:13:56,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:56,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:13:56,792 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:13:56,793 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:13:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:56,796 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-28 11:13:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-28 11:13:56,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:56,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:56,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 84 states. [2022-04-28 11:13:56,797 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 84 states. [2022-04-28 11:13:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:56,800 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-28 11:13:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-28 11:13:56,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:56,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:56,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:56,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:13:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-04-28 11:13:56,804 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 71 [2022-04-28 11:13:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:56,804 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-04-28 11:13:56,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:13:56,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 94 transitions. [2022-04-28 11:13:58,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-04-28 11:13:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 11:13:58,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:58,927 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:58,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 11:13:59,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:59,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 3 times [2022-04-28 11:13:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:59,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1017676303] [2022-04-28 11:13:59,460 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:59,460 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:59,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 4 times [2022-04-28 11:13:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:59,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259304146] [2022-04-28 11:13:59,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:59,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:59,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:59,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659347753] [2022-04-28 11:13:59,473 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:13:59,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:59,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:59,484 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 11:13:59,516 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 11:13:59,553 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:13:59,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 11:13:59,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 11:13:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 11:13:59,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 11:13:59,627 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 11:13:59,628 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 11:13:59,630 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:13:59,656 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 11:13:59,831 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,SelfDestructingSolverStorable10 [2022-04-28 11:13:59,834 INFO L356 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 11:13:59,837 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:13:59,850 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:13:59,850 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 11:13:59,850 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 11:13:59,850 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 11:13:59,850 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 11:13:59,850 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 11:13:59,850 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 11:13:59,850 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:13:59,850 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 11:13:59,851 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 11:13:59,852 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 11:13:59,853 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 11:13:59,853 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:13:59,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:13:59 BoogieIcfgContainer [2022-04-28 11:13:59,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:13:59,855 INFO L158 Benchmark]: Toolchain (without parser) took 38436.50ms. Allocated memory was 184.5MB in the beginning and 276.8MB in the end (delta: 92.3MB). Free memory was 130.4MB in the beginning and 173.3MB in the end (delta: -42.9MB). Peak memory consumption was 50.5MB. Max. memory is 8.0GB. [2022-04-28 11:13:59,855 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:13:59,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.59ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 154.9MB in the end (delta: -24.7MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-04-28 11:13:59,855 INFO L158 Benchmark]: Boogie Preprocessor took 38.37ms. Allocated memory is still 184.5MB. Free memory was 154.9MB in the beginning and 153.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 11:13:59,856 INFO L158 Benchmark]: RCFGBuilder took 314.71ms. Allocated memory is still 184.5MB. Free memory was 153.4MB in the beginning and 140.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 11:13:59,856 INFO L158 Benchmark]: TraceAbstraction took 37861.10ms. Allocated memory was 184.5MB in the beginning and 276.8MB in the end (delta: 92.3MB). Free memory was 140.3MB in the beginning and 173.3MB in the end (delta: -33.1MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-04-28 11:13:59,860 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.59ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 154.9MB in the end (delta: -24.7MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.37ms. Allocated memory is still 184.5MB. Free memory was 154.9MB in the beginning and 153.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 314.71ms. Allocated memory is still 184.5MB. Free memory was 153.4MB in the beginning and 140.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 37861.10ms. Allocated memory was 184.5MB in the beginning and 276.8MB in the end (delta: 92.3MB). Free memory was 140.3MB in the beginning and 173.3MB in the end (delta: -33.1MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 [L33] EXPR counter++ [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND FALSE !(counter++<2) [L48] CALL __VERIFIER_assert(z == 6*n + 6) [L15] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(z == 6*n + 6) [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) [L15] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.8s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 1095 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 694 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 723 IncrementalHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 401 mSDtfsCounter, 723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 414 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=10, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 11:13:59,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...