/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:46:09,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:46:09,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:46:09,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:46:10,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:46:10,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:46:10,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:46:10,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:46:10,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:46:10,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:46:10,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:46:10,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:46:10,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:46:10,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:46:10,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:46:10,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:46:10,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:46:10,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:46:10,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:46:10,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:46:10,019 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:46:10,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:46:10,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:46:10,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:46:10,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:46:10,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:46:10,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:46:10,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:46:10,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:46:10,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:46:10,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:46:10,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:46:10,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:46:10,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:46:10,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:46:10,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:46:10,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:46:10,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:46:10,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:46:10,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:46:10,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:46:10,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:46:10,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:46:10,043 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:46:10,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:46:10,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:46:10,045 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:46:10,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:46:10,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:46:10,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:46:10,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:46:10,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:46:10,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:46:10,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:46:10,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:46:10,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:46:10,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:46:10,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:46:10,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:46:10,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:46:10,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:46:10,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:46:10,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:46:10,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:46:10,049 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:46:10,049 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:46:10,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:46:10,050 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:46:10,050 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:46:10,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:46:10,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:46:10,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:46:10,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:46:10,263 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:46:10,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound20.c [2022-04-15 07:46:10,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e9674dd/1d18bdb60cbd4dd9af2a00f0c573e55a/FLAG74ed6ade3 [2022-04-15 07:46:10,681 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:46:10,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound20.c [2022-04-15 07:46:10,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e9674dd/1d18bdb60cbd4dd9af2a00f0c573e55a/FLAG74ed6ade3 [2022-04-15 07:46:11,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e9674dd/1d18bdb60cbd4dd9af2a00f0c573e55a [2022-04-15 07:46:11,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:46:11,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:46:11,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:46:11,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:46:11,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:46:11,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:46:11" (1/1) ... [2022-04-15 07:46:11,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44cb6e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11, skipping insertion in model container [2022-04-15 07:46:11,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:46:11" (1/1) ... [2022-04-15 07:46:11,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:46:11,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:46:11,260 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_valuebound20.c[588,601] [2022-04-15 07:46:11,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:46:11,301 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:46:11,310 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_valuebound20.c[588,601] [2022-04-15 07:46:11,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:46:11,336 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:46:11,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11 WrapperNode [2022-04-15 07:46:11,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:46:11,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:46:11,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:46:11,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:46:11,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11" (1/1) ... [2022-04-15 07:46:11,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11" (1/1) ... [2022-04-15 07:46:11,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11" (1/1) ... [2022-04-15 07:46:11,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11" (1/1) ... [2022-04-15 07:46:11,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11" (1/1) ... [2022-04-15 07:46:11,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11" (1/1) ... [2022-04-15 07:46:11,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11" (1/1) ... [2022-04-15 07:46:11,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:46:11,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:46:11,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:46:11,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:46:11,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11" (1/1) ... [2022-04-15 07:46:11,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:46:11,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:46:11,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:46:11,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:46:11,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:46:11,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:46:11,433 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:46:11,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:46:11,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:46:11,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:46:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:46:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:46:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:46:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:46:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-15 07:46:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:46:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:46:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:46:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:46:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:46:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:46:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:46:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:46:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:46:11,481 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:46:11,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:46:11,598 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:46:11,604 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:46:11,605 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:46:11,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:46:11 BoogieIcfgContainer [2022-04-15 07:46:11,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:46:11,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:46:11,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:46:11,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:46:11,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:46:11" (1/3) ... [2022-04-15 07:46:11,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fcaea16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:46:11, skipping insertion in model container [2022-04-15 07:46:11,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:46:11" (2/3) ... [2022-04-15 07:46:11,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fcaea16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:46:11, skipping insertion in model container [2022-04-15 07:46:11,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:46:11" (3/3) ... [2022-04-15 07:46:11,618 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound20.c [2022-04-15 07:46:11,622 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:46:11,623 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:46:11,657 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:46:11,663 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:46:11,663 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:46:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:46:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:46:11,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:46:11,683 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:46:11,683 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:46:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:46:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-15 07:46:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:11,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1709787038] [2022-04-15 07:46:11,732 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:46:11,733 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-15 07:46:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:46:11,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798697270] [2022-04-15 07:46:11,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:46:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:46:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:11,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:46:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:11,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-15 07:46:11,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 07:46:11,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-15 07:46:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:46:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:11,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-15 07:46:11,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-15 07:46:11,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-15 07:46:11,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-15 07:46:11,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:46:11,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-15 07:46:11,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 07:46:11,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-15 07:46:11,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-15 07:46:11,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#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; {39#true} is VALID [2022-04-15 07:46:11,977 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {39#true} is VALID [2022-04-15 07:46:11,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-15 07:46:11,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-15 07:46:11,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-15 07:46:11,978 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-15 07:46:11,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {40#false} is VALID [2022-04-15 07:46:11,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-15 07:46:11,979 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {40#false} is VALID [2022-04-15 07:46:11,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-15 07:46:11,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-15 07:46:11,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-15 07:46:11,980 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-15 07:46:11,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:46:11,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798697270] [2022-04-15 07:46:11,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798697270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:11,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:11,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:46:11,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:46:11,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1709787038] [2022-04-15 07:46:11,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1709787038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:11,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:11,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:46:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883236261] [2022-04-15 07:46:11,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:46:11,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:46:11,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:46:11,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:46:12,031 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-15 07:46:12,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:46:12,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:12,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:46:12,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:46:12,063 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:46:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:12,301 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-15 07:46:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:46:12,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:46:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:46:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:46:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 07:46:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:46:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 07:46:12,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-15 07:46:12,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:12,462 INFO L225 Difference]: With dead ends: 63 [2022-04-15 07:46:12,462 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 07:46:12,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:46:12,471 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:46:12,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:46:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 07:46:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 07:46:12,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:46:12,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:46:12,498 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:46:12,498 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:46:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:12,503 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-15 07:46:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-15 07:46:12,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:12,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:12,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-15 07:46:12,505 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-15 07:46:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:12,509 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-15 07:46:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-15 07:46:12,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:12,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:12,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:46:12,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:46:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:46:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-15 07:46:12,515 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-15 07:46:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:46:12,515 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-15 07:46:12,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:46:12,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-15 07:46:12,563 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-15 07:46:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-15 07:46:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:46:12,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:46:12,564 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:46:12,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:46:12,565 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:46:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:46:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-15 07:46:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:12,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [53342520] [2022-04-15 07:46:12,567 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:46:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-15 07:46:12,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:46:12,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418118937] [2022-04-15 07:46:12,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:46:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:46:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:12,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:46:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:12,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-15 07:46:12,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:46:12,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-15 07:46:12,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:46:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:12,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-15 07:46:12,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-15 07:46:12,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:46:12,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-15 07:46:12,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:46:12,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-15 07:46:12,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:46:12,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-15 07:46:12,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-15 07:46:12,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#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; {301#true} is VALID [2022-04-15 07:46:12,702 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {301#true} is VALID [2022-04-15 07:46:12,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-15 07:46:12,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-15 07:46:12,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:46:12,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-15 07:46:12,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 07:46:12,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 07:46:12,705 INFO L272 TraceCheckUtils]: 13: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:12,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {312#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:46:12,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-15 07:46:12,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-15 07:46:12,707 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-15 07:46:12,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:46:12,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418118937] [2022-04-15 07:46:12,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418118937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:12,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:12,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:46:12,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:46:12,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [53342520] [2022-04-15 07:46:12,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [53342520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:12,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:12,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:46:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771492663] [2022-04-15 07:46:12,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:46:12,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:46:12,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:46:12,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:46:12,724 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-15 07:46:12,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:46:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:12,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:46:12,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:46:12,725 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:46:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:13,190 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-15 07:46:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:46:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:46:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:46:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:46:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 07:46:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:46:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 07:46:13,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-15 07:46:13,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:13,290 INFO L225 Difference]: With dead ends: 37 [2022-04-15 07:46:13,291 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:46:13,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-15 07:46:13,294 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:46:13,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:46:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:46:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 07:46:13,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:46:13,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:46:13,314 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:46:13,314 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:46:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:13,317 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 07:46:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:46:13,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:13,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:13,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-15 07:46:13,319 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-15 07:46:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:13,322 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 07:46:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:46:13,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:13,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:13,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:46:13,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:46:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:46:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-15 07:46:13,326 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-15 07:46:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:46:13,326 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-15 07:46:13,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:46:13,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-15 07:46:13,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:46:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 07:46:13,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:46:13,377 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:46:13,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:46:13,378 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:46:13,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:46:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-15 07:46:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:13,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1227771793] [2022-04-15 07:46:13,379 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:46:13,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-15 07:46:13,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:46:13,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200625402] [2022-04-15 07:46:13,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:46:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:46:13,394 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:46:13,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733231572] [2022-04-15 07:46:13,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:46:13,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:46:13,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:46:13,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:46:13,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 07:46:13,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:46:13,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:46:13,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:46:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:13,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:46:13,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-15 07:46:13,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#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); {538#true} is VALID [2022-04-15 07:46:13,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 07:46:13,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-15 07:46:13,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-15 07:46:13,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#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; {538#true} is VALID [2022-04-15 07:46:13,688 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {538#true} is VALID [2022-04-15 07:46:13,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-15 07:46:13,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-15 07:46:13,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 07:46:13,690 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-15 07:46:13,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 07:46:13,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 07:46:13,692 INFO L272 TraceCheckUtils]: 13: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {538#true} is VALID [2022-04-15 07:46:13,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-15 07:46:13,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-15 07:46:13,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 07:46:13,693 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {538#true} {576#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 07:46:13,694 INFO L272 TraceCheckUtils]: 18: Hoare triple {576#(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)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:46:13,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:13,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-15 07:46:13,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 07:46:13,696 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-15 07:46:13,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:46:13,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:46:13,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200625402] [2022-04-15 07:46:13,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:46:13,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733231572] [2022-04-15 07:46:13,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733231572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:13,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:13,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:46:13,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:46:13,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1227771793] [2022-04-15 07:46:13,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1227771793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:13,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:13,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:46:13,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91889360] [2022-04-15 07:46:13,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:46:13,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:13,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:46:13,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:13,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:13,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:46:13,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:13,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:46:13,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:46:13,718 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:14,042 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-15 07:46:14,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:46:14,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:46:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:46:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:46:14,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-15 07:46:14,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:14,137 INFO L225 Difference]: With dead ends: 54 [2022-04-15 07:46:14,137 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 07:46:14,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:46:14,143 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:46:14,149 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:46:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 07:46:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-15 07:46:14,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:46:14,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:46:14,170 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:46:14,172 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:46:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:14,183 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 07:46:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 07:46:14,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:14,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:14,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-15 07:46:14,193 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-15 07:46:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:14,197 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 07:46:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 07:46:14,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:14,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:14,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:46:14,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:46:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:46:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-15 07:46:14,206 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-15 07:46:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:46:14,206 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-15 07:46:14,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:14,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-15 07:46:14,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-15 07:46:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 07:46:14,271 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:46:14,272 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:46:14,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 07:46:14,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:46:14,495 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:46:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:46:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-15 07:46:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:14,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347174678] [2022-04-15 07:46:14,497 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:46:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-15 07:46:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:46:14,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293505057] [2022-04-15 07:46:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:46:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:46:14,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:46:14,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612870230] [2022-04-15 07:46:14,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:46:14,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:46:14,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:46:14,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:46:14,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 07:46:14,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:46:14,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:46:14,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:46:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:14,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:46:14,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-15 07:46:14,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#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); {906#true} is VALID [2022-04-15 07:46:14,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 07:46:14,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-15 07:46:14,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-15 07:46:14,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#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; {906#true} is VALID [2022-04-15 07:46:14,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {906#true} is VALID [2022-04-15 07:46:14,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-15 07:46:14,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-15 07:46:14,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 07:46:14,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-15 07:46:14,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {906#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 07:46:14,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 07:46:14,739 INFO L272 TraceCheckUtils]: 13: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {906#true} is VALID [2022-04-15 07:46:14,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-15 07:46:14,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-15 07:46:14,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 07:46:14,740 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #62#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 07:46:14,740 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#(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)); {906#true} is VALID [2022-04-15 07:46:14,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-15 07:46:14,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-15 07:46:14,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 07:46:14,741 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #64#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 07:46:14,742 INFO L272 TraceCheckUtils]: 23: Hoare triple {944#(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)); {981#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:46:14,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {985#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:14,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-15 07:46:14,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-15 07:46:14,743 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-15 07:46:14,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:46:14,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:46:14,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293505057] [2022-04-15 07:46:14,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:46:14,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612870230] [2022-04-15 07:46:14,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612870230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:14,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:14,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:46:14,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:46:14,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347174678] [2022-04-15 07:46:14,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347174678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:14,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:14,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:46:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035330263] [2022-04-15 07:46:14,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:46:14,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:14,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:46:14,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:14,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:14,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:46:14,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:14,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:46:14,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:46:14,765 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:15,144 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-15 07:46:15,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:46:15,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:46:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:46:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:46:15,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-15 07:46:15,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:15,222 INFO L225 Difference]: With dead ends: 58 [2022-04-15 07:46:15,223 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 07:46:15,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:46:15,224 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:46:15,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:46:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 07:46:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-15 07:46:15,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:46:15,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:46:15,247 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:46:15,248 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:46:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:15,253 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-15 07:46:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-15 07:46:15,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:15,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:15,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-15 07:46:15,256 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-15 07:46:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:15,262 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-15 07:46:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-15 07:46:15,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:15,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:15,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:46:15,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:46:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:46:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-15 07:46:15,266 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-15 07:46:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:46:15,267 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-15 07:46:15,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:46:15,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-15 07:46:15,353 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-15 07:46:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-15 07:46:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:46:15,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:46:15,354 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:46:15,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 07:46:15,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 07:46:15,576 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:46:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:46:15,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-15 07:46:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:15,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [64953502] [2022-04-15 07:46:15,577 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:46:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-15 07:46:15,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:46:15,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404739556] [2022-04-15 07:46:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:46:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:46:15,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:46:15,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294864996] [2022-04-15 07:46:15,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:46:15,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:46:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:46:15,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:46:15,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 07:46:15,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:46:15,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:46:15,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:46:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:15,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:46:15,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-15 07:46:15,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1325#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); {1325#true} is VALID [2022-04-15 07:46:15,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 07:46:15,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-15 07:46:15,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-15 07:46:15,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {1325#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; {1325#true} is VALID [2022-04-15 07:46:15,790 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1325#true} is VALID [2022-04-15 07:46:15,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 07:46:15,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 07:46:15,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 07:46:15,791 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-15 07:46:15,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {1325#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:46:15,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:46:15,794 INFO L272 TraceCheckUtils]: 13: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-15 07:46:15,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 07:46:15,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 07:46:15,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 07:46:15,808 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:46:15,808 INFO L272 TraceCheckUtils]: 18: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-15 07:46:15,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 07:46:15,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 07:46:15,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 07:46:15,812 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:46:15,812 INFO L272 TraceCheckUtils]: 23: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-15 07:46:15,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 07:46:15,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 07:46:15,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 07:46:15,814 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:46:15,815 INFO L272 TraceCheckUtils]: 28: Hoare triple {1363#(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)); {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:46:15,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:15,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-15 07:46:15,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-15 07:46:15,816 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-15 07:46:15,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:46:15,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:46:15,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404739556] [2022-04-15 07:46:15,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:46:15,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294864996] [2022-04-15 07:46:15,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294864996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:15,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:15,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:46:15,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:46:15,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [64953502] [2022-04-15 07:46:15,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [64953502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:15,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:15,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:46:15,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233158869] [2022-04-15 07:46:15,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:46:15,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-15 07:46:15,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:46:15,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:46:15,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:15,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:46:15,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:15,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:46:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:46:15,841 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:46:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:16,246 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-15 07:46:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:46:16,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-15 07:46:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:46:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:46:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:46:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:46:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:46:16,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-15 07:46:16,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:16,319 INFO L225 Difference]: With dead ends: 66 [2022-04-15 07:46:16,319 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 07:46:16,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:46:16,320 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:46:16,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:46:16,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 07:46:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 07:46:16,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:46:16,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:46:16,341 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:46:16,341 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:46:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:16,344 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-15 07:46:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-15 07:46:16,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:16,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:16,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-15 07:46:16,345 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-15 07:46:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:16,347 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-15 07:46:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-15 07:46:16,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:16,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:16,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:46:16,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:46:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:46:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-15 07:46:16,351 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-15 07:46:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:46:16,351 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-15 07:46:16,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:46:16,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-15 07:46:16,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-15 07:46:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 07:46:16,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:46:16,435 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:46:16,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 07:46:16,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:46:16,644 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:46:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:46:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-15 07:46:16,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:16,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1499636364] [2022-04-15 07:48:27,570 WARN L232 SmtUtils]: Spent 2.17m on a formula simplification. DAG size of input: 192 DAG size of output: 188 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 07:48:27,605 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 4=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:48:27,612 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:48:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1018400594, now seen corresponding path program 1 times [2022-04-15 07:48:27,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:48:27,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034485183] [2022-04-15 07:48:27,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:48:27,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:48:27,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:48:27,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513850512] [2022-04-15 07:48:27,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:48:27,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:48:27,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:48:27,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:48:27,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 07:48:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:48:27,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 07:48:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:48:27,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:48:31,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-15 07:48:31,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#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); {1775#true} is VALID [2022-04-15 07:48:31,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:48:31,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-15 07:48:31,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-15 07:48:31,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#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; {1775#true} is VALID [2022-04-15 07:48:31,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1775#true} is VALID [2022-04-15 07:48:31,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-15 07:48:31,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-15 07:48:31,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:48:31,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-15 07:48:31,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1813#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:48:31,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {1813#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [88] L33-2-->L34_primed: Formula: (let ((.cse27 (* v_main_~y~0_26 12))) (let ((.cse1 (* v_main_~z~0_29 11)) (.cse10 (= (+ .cse27 6 (* v_main_~x~0_20 18)) (+ (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 2)))) (.cse11 (* (- 1) v_main_~z~0_29)) (.cse26 (<= v_main_~n~0_21 v_main_~a~0_12)) (.cse9 (= v_main_~x~0_20 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (.cse12 (= v_main_~n~0_21 v_main_~n~0_20)) (.cse13 (= v_main_~y~0_26 v_main_~y~0_25)) (.cse14 (= v_main_~x~0_20 v_main_~x~0_19))) (or (let ((.cse0 (div (+ .cse11 v_main_~z~0_30) (- 12)))) (let ((.cse2 (* v_main_~z~0_30 .cse0)) (.cse3 (* (* .cse0 .cse0) 12))) (and (= v_main_~n~0_20 (+ v_main_~n~0_21 (* 2 .cse0))) (< 0 .cse0) (= 0 (mod (+ v_main_~z~0_30 .cse1) 12)) (= (+ (* 6 .cse0) v_main_~y~0_25) (+ v_main_~y~0_26 (* 2 .cse2) .cse3)) (forall ((v_itHalf_1 Int)) (or (let ((.cse5 (* v_main_~y~0_26 v_itHalf_1)) (.cse8 (* v_itHalf_1 v_itHalf_1)) (.cse6 (* (* v_main_~n~0_21 v_itHalf_1) 12)) (.cse7 (* 3 (* v_main_~n~0_21 v_main_~n~0_21))) (.cse4 (* v_main_~z~0_30 v_itHalf_1))) (and (= (+ .cse4 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse5 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) .cse6 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 3) .cse7 (* .cse8 8) (* v_itHalf_1 8) 1 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (= (+ (* v_main_~z~0_30 4) (* v_main_~y~0_26 24) (* .cse4 12) (* v_main_~x~0_20 18) (* .cse5 24) (* 72 .cse8)) (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) 6 (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 v_main_~z~0_30))) (= (+ .cse6 7 (* v_itHalf_1 12) .cse7 (* v_main_~n~0_21 9)) (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse4 2))) (<= (+ v_main_~n~0_21 (* v_itHalf_1 2) 1) v_main_~a~0_12))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30) (- 12)))))) (= (+ v_main_~x~0_19 .cse2 .cse3) (+ (* 2 (* v_main_~y~0_26 .cse0)) v_main_~x~0_20 (* 4 .cse0) (* 2 (* v_main_~z~0_30 .cse0 .cse0)) (* (* .cse0 .cse0 .cse0) 8))) .cse9 .cse10))) (and .cse12 (= v_main_~z~0_30 v_main_~z~0_29) (= v_main_~a~0_12 v_main_~a~0_12) .cse13 .cse14) (let ((.cse24 (div (+ .cse11 v_main_~z~0_30 6) (- 12)))) (let ((.cse20 (* .cse24 2)) (.cse25 (* .cse24 v_main_~z~0_30)) (.cse23 (* .cse24 .cse24))) (and (forall ((v_itHalf_1 Int)) (or (let ((.cse16 (* v_main_~y~0_26 v_itHalf_1)) (.cse19 (* v_itHalf_1 v_itHalf_1)) (.cse17 (* (* v_main_~n~0_21 v_itHalf_1) 12)) (.cse18 (* 3 (* v_main_~n~0_21 v_main_~n~0_21))) (.cse15 (* v_main_~z~0_30 v_itHalf_1))) (and (= (+ .cse15 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse16 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) .cse17 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 3) .cse18 (* .cse19 8) (* v_itHalf_1 8) 1 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (= (+ (* v_main_~z~0_30 4) (* v_main_~y~0_26 24) (* .cse15 12) (* v_main_~x~0_20 18) (* .cse16 24) (* 72 .cse19)) (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) 6 (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 v_main_~z~0_30))) (= (+ .cse17 7 (* v_itHalf_1 12) .cse18 (* v_main_~n~0_21 9)) (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse15 2))) (<= (+ v_main_~n~0_21 (* v_itHalf_1 2) 1) v_main_~a~0_12))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30 6) (- 12)))))) (= v_main_~n~0_20 (+ v_main_~n~0_21 .cse20 1)) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30 6) (- 12)))) (let ((.cse22 (* v_main_~y~0_26 v_itHalf_1)) (.cse21 (* v_main_~z~0_30 v_itHalf_1))) (and (<= (+ v_main_~n~0_21 (* v_itHalf_1 2)) v_main_~a~0_12) (= (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 2)) (+ (* v_main_~y~0_26 12) 6 (* .cse21 12) (* v_main_~x~0_20 18) (* .cse22 24))) (= (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) (* (* v_itHalf_1 v_itHalf_1) 12) .cse21 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21)) (+ v_main_~x~0_20 (* v_itHalf_1 4) (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse22 2))) (= (+ v_main_~y~0_26 (* .cse21 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1) 12) (* v_itHalf_1 12) (* v_main_~n~0_21 3) (* 3 (* v_main_~n~0_21 v_main_~n~0_21)) 1)))) (not (<= 1 v_itHalf_1)))) (= v_main_~y~0_25 (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse23 12) (* .cse24 6) (* .cse25 2))) (= (+ v_main_~x~0_19 .cse20) (+ .cse25 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* .cse24 .cse24 v_main_~z~0_30)) (* .cse23 4) (* 2 (* .cse24 v_main_~y~0_26)) (* 8 (* .cse24 .cse24 .cse24)))) .cse26 (= (+ 12 (* v_main_~z~0_30 v_main_~z~0_30)) (+ .cse27 (* v_main_~z~0_30 6))) (= (mod (+ v_main_~z~0_30 6 .cse1) 12) 0) (<= 0 .cse24) .cse9 .cse10))) (and (= v_main_~z~0_29 v_main_~z~0_30) (or (not .cse26) (not (= v_main_~z~0_30 (+ 6 (* v_main_~n~0_21 6)))) (not .cse9) (not (= v_main_~y~0_26 (+ (* v_main_~n~0_21 3) (* 3 (* v_main_~n~0_21 v_main_~n~0_21)) 1)))) .cse12 .cse13 .cse14)))) InVars {main_~y~0=v_main_~y~0_26, main_~n~0=v_main_~n~0_21, main_~x~0=v_main_~x~0_20, main_~z~0=v_main_~z~0_30, main_~a~0=v_main_~a~0_12} OutVars{main_~y~0=v_main_~y~0_25, main_~n~0=v_main_~n~0_20, main_~x~0=v_main_~x~0_19, main_~z~0=v_main_~z~0_29, main_~a~0=v_main_~a~0_12} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)))} is VALID [2022-04-15 07:48:31,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)))} [87] L34_primed-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)))} is VALID [2022-04-15 07:48:31,504 INFO L272 TraceCheckUtils]: 14: Hoare triple {1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-15 07:48:31,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} ~cond := #in~cond; {1827#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:48:31,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {1827#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:48:31,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:48:31,552 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} {1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)))} #62#return; {1838#(or (and (= (+ main_~y~0 (* 6 (div (* main_~n~0 (- 6)) (- 12)))) (+ (* (* (div (* main_~n~0 (- 6)) (- 12)) (div (* main_~n~0 (- 6)) (- 12))) 12) (* 12 (div (* main_~n~0 (- 6)) (- 12))) 1)) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* main_~n~0 (- 6)) (- 12)))) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (< 0 (div (* main_~n~0 (- 6)) (- 12))) (= (mod (* main_~n~0 6) 12) 0)) (and (= main_~n~0 0) (= main_~y~0 1)) (and (= (+ 7 (* 12 (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))) (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 18)) main_~y~0) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (<= 0 (div (+ 6 (* main_~n~0 (- 6))) (- 12))) (= main_~n~0 (+ (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 2) 1))))} is VALID [2022-04-15 07:48:31,563 INFO L272 TraceCheckUtils]: 19: Hoare triple {1838#(or (and (= (+ main_~y~0 (* 6 (div (* main_~n~0 (- 6)) (- 12)))) (+ (* (* (div (* main_~n~0 (- 6)) (- 12)) (div (* main_~n~0 (- 6)) (- 12))) 12) (* 12 (div (* main_~n~0 (- 6)) (- 12))) 1)) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* main_~n~0 (- 6)) (- 12)))) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (< 0 (div (* main_~n~0 (- 6)) (- 12))) (= (mod (* main_~n~0 6) 12) 0)) (and (= main_~n~0 0) (= main_~y~0 1)) (and (= (+ 7 (* 12 (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))) (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 18)) main_~y~0) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (<= 0 (div (+ 6 (* main_~n~0 (- 6))) (- 12))) (= main_~n~0 (+ (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 2) 1))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:48:31,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {1842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:48:31,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {1846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-15 07:48:31,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-15 07:48:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:48:31,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:48:59,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-15 07:48:59,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {1846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-15 07:48:59,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {1842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:48:59,178 INFO L272 TraceCheckUtils]: 19: Hoare triple {1862#(= (+ (* 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)); {1842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:48:59,178 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #62#return; {1862#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-15 07:48:59,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:48:59,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {1876#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:48:59,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} ~cond := #in~cond; {1876#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:48:59,180 INFO L272 TraceCheckUtils]: 14: Hoare triple {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-15 07:48:59,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} [87] L34_primed-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-15 07:49:01,395 WARN L290 TraceCheckUtils]: 12: Hoare triple {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} [88] L33-2-->L34_primed: Formula: (let ((.cse27 (* v_main_~y~0_26 12))) (let ((.cse1 (* v_main_~z~0_29 11)) (.cse10 (= (+ .cse27 6 (* v_main_~x~0_20 18)) (+ (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 2)))) (.cse11 (* (- 1) v_main_~z~0_29)) (.cse26 (<= v_main_~n~0_21 v_main_~a~0_12)) (.cse9 (= v_main_~x~0_20 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (.cse12 (= v_main_~n~0_21 v_main_~n~0_20)) (.cse13 (= v_main_~y~0_26 v_main_~y~0_25)) (.cse14 (= v_main_~x~0_20 v_main_~x~0_19))) (or (let ((.cse0 (div (+ .cse11 v_main_~z~0_30) (- 12)))) (let ((.cse2 (* v_main_~z~0_30 .cse0)) (.cse3 (* (* .cse0 .cse0) 12))) (and (= v_main_~n~0_20 (+ v_main_~n~0_21 (* 2 .cse0))) (< 0 .cse0) (= 0 (mod (+ v_main_~z~0_30 .cse1) 12)) (= (+ (* 6 .cse0) v_main_~y~0_25) (+ v_main_~y~0_26 (* 2 .cse2) .cse3)) (forall ((v_itHalf_1 Int)) (or (let ((.cse5 (* v_main_~y~0_26 v_itHalf_1)) (.cse8 (* v_itHalf_1 v_itHalf_1)) (.cse6 (* (* v_main_~n~0_21 v_itHalf_1) 12)) (.cse7 (* 3 (* v_main_~n~0_21 v_main_~n~0_21))) (.cse4 (* v_main_~z~0_30 v_itHalf_1))) (and (= (+ .cse4 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse5 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) .cse6 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 3) .cse7 (* .cse8 8) (* v_itHalf_1 8) 1 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (= (+ (* v_main_~z~0_30 4) (* v_main_~y~0_26 24) (* .cse4 12) (* v_main_~x~0_20 18) (* .cse5 24) (* 72 .cse8)) (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) 6 (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 v_main_~z~0_30))) (= (+ .cse6 7 (* v_itHalf_1 12) .cse7 (* v_main_~n~0_21 9)) (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse4 2))) (<= (+ v_main_~n~0_21 (* v_itHalf_1 2) 1) v_main_~a~0_12))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30) (- 12)))))) (= (+ v_main_~x~0_19 .cse2 .cse3) (+ (* 2 (* v_main_~y~0_26 .cse0)) v_main_~x~0_20 (* 4 .cse0) (* 2 (* v_main_~z~0_30 .cse0 .cse0)) (* (* .cse0 .cse0 .cse0) 8))) .cse9 .cse10))) (and .cse12 (= v_main_~z~0_30 v_main_~z~0_29) (= v_main_~a~0_12 v_main_~a~0_12) .cse13 .cse14) (let ((.cse24 (div (+ .cse11 v_main_~z~0_30 6) (- 12)))) (let ((.cse20 (* .cse24 2)) (.cse25 (* .cse24 v_main_~z~0_30)) (.cse23 (* .cse24 .cse24))) (and (forall ((v_itHalf_1 Int)) (or (let ((.cse16 (* v_main_~y~0_26 v_itHalf_1)) (.cse19 (* v_itHalf_1 v_itHalf_1)) (.cse17 (* (* v_main_~n~0_21 v_itHalf_1) 12)) (.cse18 (* 3 (* v_main_~n~0_21 v_main_~n~0_21))) (.cse15 (* v_main_~z~0_30 v_itHalf_1))) (and (= (+ .cse15 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse16 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) .cse17 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 3) .cse18 (* .cse19 8) (* v_itHalf_1 8) 1 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (= (+ (* v_main_~z~0_30 4) (* v_main_~y~0_26 24) (* .cse15 12) (* v_main_~x~0_20 18) (* .cse16 24) (* 72 .cse19)) (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) 6 (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 v_main_~z~0_30))) (= (+ .cse17 7 (* v_itHalf_1 12) .cse18 (* v_main_~n~0_21 9)) (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse15 2))) (<= (+ v_main_~n~0_21 (* v_itHalf_1 2) 1) v_main_~a~0_12))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30 6) (- 12)))))) (= v_main_~n~0_20 (+ v_main_~n~0_21 .cse20 1)) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30 6) (- 12)))) (let ((.cse22 (* v_main_~y~0_26 v_itHalf_1)) (.cse21 (* v_main_~z~0_30 v_itHalf_1))) (and (<= (+ v_main_~n~0_21 (* v_itHalf_1 2)) v_main_~a~0_12) (= (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 2)) (+ (* v_main_~y~0_26 12) 6 (* .cse21 12) (* v_main_~x~0_20 18) (* .cse22 24))) (= (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) (* (* v_itHalf_1 v_itHalf_1) 12) .cse21 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21)) (+ v_main_~x~0_20 (* v_itHalf_1 4) (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse22 2))) (= (+ v_main_~y~0_26 (* .cse21 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1) 12) (* v_itHalf_1 12) (* v_main_~n~0_21 3) (* 3 (* v_main_~n~0_21 v_main_~n~0_21)) 1)))) (not (<= 1 v_itHalf_1)))) (= v_main_~y~0_25 (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse23 12) (* .cse24 6) (* .cse25 2))) (= (+ v_main_~x~0_19 .cse20) (+ .cse25 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* .cse24 .cse24 v_main_~z~0_30)) (* .cse23 4) (* 2 (* .cse24 v_main_~y~0_26)) (* 8 (* .cse24 .cse24 .cse24)))) .cse26 (= (+ 12 (* v_main_~z~0_30 v_main_~z~0_30)) (+ .cse27 (* v_main_~z~0_30 6))) (= (mod (+ v_main_~z~0_30 6 .cse1) 12) 0) (<= 0 .cse24) .cse9 .cse10))) (and (= v_main_~z~0_29 v_main_~z~0_30) (or (not .cse26) (not (= v_main_~z~0_30 (+ 6 (* v_main_~n~0_21 6)))) (not .cse9) (not (= v_main_~y~0_26 (+ (* v_main_~n~0_21 3) (* 3 (* v_main_~n~0_21 v_main_~n~0_21)) 1)))) .cse12 .cse13 .cse14)))) InVars {main_~y~0=v_main_~y~0_26, main_~n~0=v_main_~n~0_21, main_~x~0=v_main_~x~0_20, main_~z~0=v_main_~z~0_30, main_~a~0=v_main_~a~0_12} OutVars{main_~y~0=v_main_~y~0_25, main_~n~0=v_main_~n~0_20, main_~x~0=v_main_~x~0_19, main_~z~0=v_main_~z~0_29, main_~a~0=v_main_~a~0_12} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is UNKNOWN [2022-04-15 07:49:01,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-15 07:49:01,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-15 07:49:01,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:49:01,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-15 07:49:01,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-15 07:49:01,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1775#true} is VALID [2022-04-15 07:49:01,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#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; {1775#true} is VALID [2022-04-15 07:49:01,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-15 07:49:01,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-15 07:49:01,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:49:01,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#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); {1775#true} is VALID [2022-04-15 07:49:01,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-15 07:49:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:49:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:49:01,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034485183] [2022-04-15 07:49:01,398 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:49:01,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513850512] [2022-04-15 07:49:01,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513850512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:49:01,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:49:01,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-15 07:49:07,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:49:07,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1499636364] [2022-04-15 07:49:07,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1499636364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:49:07,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:49:07,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 07:49:07,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831260444] [2022-04-15 07:49:07,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:49:07,419 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 49 [2022-04-15 07:49:07,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:49:07,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 07:49:09,717 WARN L143 InductivityCheck]: Transition 1932#(and (= (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) (* main_~z~0 6) (* main_~y~0 (- 12)) (- 24)) 0) (<= main_~n~0 (+ main_~a~0 1))) ( _ , assume !false; , 1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0))) ) not inductive [2022-04-15 07:49:09,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 07:49:09,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:09,919 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 07:49:09,923 INFO L158 Benchmark]: Toolchain (without parser) took 178822.38ms. Allocated memory was 178.3MB in the beginning and 225.4MB in the end (delta: 47.2MB). Free memory was 123.5MB in the beginning and 81.5MB in the end (delta: 42.0MB). Peak memory consumption was 90.1MB. Max. memory is 8.0GB. [2022-04-15 07:49:09,923 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:49:09,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.82ms. Allocated memory is still 178.3MB. Free memory was 123.3MB in the beginning and 148.3MB in the end (delta: -25.0MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-15 07:49:09,923 INFO L158 Benchmark]: Boogie Preprocessor took 25.79ms. Allocated memory is still 178.3MB. Free memory was 148.3MB in the beginning and 146.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 07:49:09,924 INFO L158 Benchmark]: RCFGBuilder took 242.84ms. Allocated memory is still 178.3MB. Free memory was 146.7MB in the beginning and 135.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:49:09,924 INFO L158 Benchmark]: TraceAbstraction took 178314.50ms. Allocated memory was 178.3MB in the beginning and 225.4MB in the end (delta: 47.2MB). Free memory was 134.7MB in the beginning and 81.5MB in the end (delta: 53.1MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. [2022-04-15 07:49:09,925 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.11ms. Allocated memory is still 178.3MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.82ms. Allocated memory is still 178.3MB. Free memory was 123.3MB in the beginning and 148.3MB in the end (delta: -25.0MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.79ms. Allocated memory is still 178.3MB. Free memory was 148.3MB in the beginning and 146.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 242.84ms. Allocated memory is still 178.3MB. Free memory was 146.7MB in the beginning and 135.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 178314.50ms. Allocated memory was 178.3MB in the beginning and 225.4MB in the end (delta: 47.2MB). Free memory was 134.7MB in the beginning and 81.5MB in the end (delta: 53.1MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 07:49:10,131 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-15 07:49:10,138 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...