/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_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:46:37,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:46:37,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:46:37,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:46:37,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:46:37,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:46:37,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:46:37,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:46:37,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:46:37,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:46:37,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:46:37,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:46:37,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:46:37,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:46:37,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:46:37,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:46:37,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:46:37,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:46:38,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:46:38,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:46:38,003 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:46:38,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:46:38,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:46:38,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:46:38,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:46:38,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:46:38,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:46:38,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:46:38,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:46:38,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:46:38,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:46:38,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:46:38,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:46:38,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:46:38,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:46:38,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:46:38,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:46:38,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:46:38,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:46:38,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:46:38,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:46:38,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:46:38,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:46:38,030 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:46:38,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:46:38,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:46:38,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:46:38,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:46:38,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:46:38,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:46:38,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:46:38,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:46:38,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:46:38,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:46:38,032 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:46:38,032 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:46:38,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:46:38,032 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:46:38,033 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:46:38,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:46:38,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:46:38,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:46:38,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:46:38,260 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:46:38,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound5.c [2022-04-28 04:46:38,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288c58f15/0d64f275a5874470a6d9a65add383878/FLAGbbd4f88cb [2022-04-28 04:46:38,652 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:46:38,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound5.c [2022-04-28 04:46:38,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288c58f15/0d64f275a5874470a6d9a65add383878/FLAGbbd4f88cb [2022-04-28 04:46:39,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288c58f15/0d64f275a5874470a6d9a65add383878 [2022-04-28 04:46:39,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:46:39,080 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:46:39,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:46:39,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:46:39,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:46:39,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:46:39" (1/1) ... [2022-04-28 04:46:39,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@324eb929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39, skipping insertion in model container [2022-04-28 04:46:39,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:46:39" (1/1) ... [2022-04-28 04:46:39,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:46:39,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:46:39,237 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_valuebound5.c[588,601] [2022-04-28 04:46:39,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:46:39,276 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:46:39,291 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_valuebound5.c[588,601] [2022-04-28 04:46:39,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:46:39,317 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:46:39,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39 WrapperNode [2022-04-28 04:46:39,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:46:39,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:46:39,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:46:39,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:46:39,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39" (1/1) ... [2022-04-28 04:46:39,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39" (1/1) ... [2022-04-28 04:46:39,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39" (1/1) ... [2022-04-28 04:46:39,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39" (1/1) ... [2022-04-28 04:46:39,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39" (1/1) ... [2022-04-28 04:46:39,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39" (1/1) ... [2022-04-28 04:46:39,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39" (1/1) ... [2022-04-28 04:46:39,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:46:39,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:46:39,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:46:39,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:46:39,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39" (1/1) ... [2022-04-28 04:46:39,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:46:39,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:46:39,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:46:39,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-28 04:46:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:46:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:46:39,438 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:46:39,438 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:46:39,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:46:39,438 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:46:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:46:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:46:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:46:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:46:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 04:46:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:46:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:46:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:46:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:46:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:46:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:46:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:46:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:46:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:46:39,485 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:46:39,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:46:39,623 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:46:39,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:46:39,628 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:46:39,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:46:39 BoogieIcfgContainer [2022-04-28 04:46:39,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:46:39,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:46:39,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:46:39,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:46:39,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:46:39" (1/3) ... [2022-04-28 04:46:39,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26aabbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:46:39, skipping insertion in model container [2022-04-28 04:46:39,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:46:39" (2/3) ... [2022-04-28 04:46:39,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26aabbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:46:39, skipping insertion in model container [2022-04-28 04:46:39,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:46:39" (3/3) ... [2022-04-28 04:46:39,635 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound5.c [2022-04-28 04:46:39,644 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:46:39,644 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:46:39,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:46:39,688 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@274fab87, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e68a399 [2022-04-28 04:46:39,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:46:39,712 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-28 04:46:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:46:39,721 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:46:39,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:46:39,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:46:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:46:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-28 04:46:39,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:39,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [815644825] [2022-04-28 04:46:39,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:46:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-28 04:46:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:46:39,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078822460] [2022-04-28 04:46:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:46:39,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:46:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:46:39,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:46:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:46:39,920 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-28 04:46:39,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 04:46:39,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 04:46:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:46:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:46:39,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 04:46:39,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 04:46:39,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 04:46:39,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 04:46:39,940 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-28 04:46:39,940 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-28 04:46:39,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 04:46:39,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 04:46:39,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-28 04:46:39,941 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-28 04:46:39,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {39#true} is VALID [2022-04-28 04:46:39,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 04:46:39,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 04:46:39,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 04:46:39,943 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 04:46:39,943 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-28 04:46:39,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-28 04:46:39,943 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-28 04:46:39,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-28 04:46:39,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-28 04:46:39,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-28 04:46:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:46:39,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:46:39,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078822460] [2022-04-28 04:46:39,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078822460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:39,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:39,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:46:39,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:46:39,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [815644825] [2022-04-28 04:46:39,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [815644825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:39,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:39,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:46:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069649016] [2022-04-28 04:46:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:46:39,953 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-28 04:46:39,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:46:39,956 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-28 04:46:39,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:46:39,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:46:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:39,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:46:40,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:46:40,002 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-28 04:46:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:40,148 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-28 04:46:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:46:40,149 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-28 04:46:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:46:40,150 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-28 04:46:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 04:46:40,157 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-28 04:46:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 04:46:40,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 04:46:40,258 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-28 04:46:40,264 INFO L225 Difference]: With dead ends: 63 [2022-04-28 04:46:40,264 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 04:46:40,266 INFO L412 NwaCegarLoop]: 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-28 04:46:40,269 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:46:40,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:46:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 04:46:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 04:46:40,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:46:40,301 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-28 04:46:40,302 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-28 04:46:40,302 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-28 04:46:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:40,306 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 04:46:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 04:46:40,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:46:40,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:46:40,307 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-28 04:46:40,307 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-28 04:46:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:40,310 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 04:46:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 04:46:40,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:46:40,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:46:40,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:46:40,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:46:40,312 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-28 04:46:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-28 04:46:40,315 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-28 04:46:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:46:40,315 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-28 04:46:40,315 INFO L496 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-28 04:46:40,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-28 04:46:40,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:46:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 04:46:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:46:40,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:46:40,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:46:40,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:46:40,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:46:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:46:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-28 04:46:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:40,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1508792811] [2022-04-28 04:46:40,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:46:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-28 04:46:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:46:40,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174183142] [2022-04-28 04:46:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:46:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:46:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:46:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:46:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:46:40,455 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-28 04:46:40,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 04:46:40,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 04:46:40,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:46:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:46:40,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 04:46:40,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 04:46:40,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 04:46:40,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 04:46:40,460 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-28 04:46:40,460 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-28 04:46:40,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 04:46:40,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 04:46:40,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-28 04:46:40,461 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-28 04:46:40,461 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {301#true} is VALID [2022-04-28 04:46:40,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 04:46:40,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 04:46:40,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 04:46:40,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 04:46:40,462 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-28 04:46:40,463 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-28 04:46:40,463 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-28 04:46:40,464 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-28 04:46:40,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-28 04:46:40,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-28 04:46:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:46:40,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:46:40,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174183142] [2022-04-28 04:46:40,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174183142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:40,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:40,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:46:40,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:46:40,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1508792811] [2022-04-28 04:46:40,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1508792811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:40,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:40,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:46:40,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209512863] [2022-04-28 04:46:40,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:46:40,467 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-28 04:46:40,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:46:40,467 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-28 04:46:40,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:46:40,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:46:40,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:40,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:46:40,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:46:40,479 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-28 04:46:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:40,817 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 04:46:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:46:40,818 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-28 04:46:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:46:40,818 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-28 04:46:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 04:46:40,820 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-28 04:46:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 04:46:40,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 04:46:40,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:46:40,864 INFO L225 Difference]: With dead ends: 37 [2022-04-28 04:46:40,864 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:46:40,864 INFO L412 NwaCegarLoop]: 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-28 04:46:40,865 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:46:40,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:46:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:46:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 04:46:40,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:46:40,871 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-28 04:46:40,871 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-28 04:46:40,872 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-28 04:46:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:40,874 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 04:46:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 04:46:40,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:46:40,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:46:40,875 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-28 04:46:40,875 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-28 04:46:40,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:40,877 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 04:46:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 04:46:40,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:46:40,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:46:40,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:46:40,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:46:40,878 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-28 04:46:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 04:46:40,880 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-28 04:46:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:46:40,880 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 04:46:40,880 INFO L496 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-28 04:46:40,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 04:46:40,920 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-28 04:46:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 04:46:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:46:40,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:46:40,921 INFO L195 NwaCegarLoop]: 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-28 04:46:40,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:46:40,922 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:46:40,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:46:40,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-28 04:46:40,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:40,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [909830471] [2022-04-28 04:46:40,923 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:46:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-28 04:46:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:46:40,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673937059] [2022-04-28 04:46:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:46:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:46:40,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:46:40,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496648466] [2022-04-28 04:46:40,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:46:40,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:46:40,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:46:40,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:46:40,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:46:40,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:46:40,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:46:40,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:46:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:46:41,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:46:41,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-28 04:46:41,164 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-28 04:46:41,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 04:46:41,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-28 04:46:41,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-28 04:46:41,165 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-28 04:46:41,165 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {538#true} is VALID [2022-04-28 04:46:41,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 04:46:41,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 04:46:41,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 04:46:41,165 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-28 04:46:41,166 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-28 04:46:41,166 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-28 04:46:41,166 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-28 04:46:41,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 04:46:41,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 04:46:41,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 04:46:41,167 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-28 04:46:41,168 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-28 04:46:41,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:46:41,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-28 04:46:41,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-28 04:46:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:46:41,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:46:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:46:41,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673937059] [2022-04-28 04:46:41,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:46:41,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496648466] [2022-04-28 04:46:41,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496648466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:41,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:41,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:46:41,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:46:41,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [909830471] [2022-04-28 04:46:41,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [909830471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:41,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:41,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:46:41,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999804079] [2022-04-28 04:46:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:46:41,172 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-28 04:46:41,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:46:41,172 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-28 04:46:41,186 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-28 04:46:41,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:46:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:41,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:46:41,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:46:41,188 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-28 04:46:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:41,391 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 04:46:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:46:41,391 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-28 04:46:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:46:41,392 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-28 04:46:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 04:46:41,394 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-28 04:46:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 04:46:41,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 04:46:41,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:46:41,450 INFO L225 Difference]: With dead ends: 54 [2022-04-28 04:46:41,450 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 04:46:41,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:46:41,451 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:46:41,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:46:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 04:46:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-28 04:46:41,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:46:41,462 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-28 04:46:41,463 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-28 04:46:41,463 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-28 04:46:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:41,466 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 04:46:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 04:46:41,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:46:41,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:46:41,467 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-28 04:46:41,468 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-28 04:46:41,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:41,470 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 04:46:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 04:46:41,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:46:41,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:46:41,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:46:41,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:46:41,471 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-28 04:46:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-28 04:46:41,473 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-28 04:46:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:46:41,473 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-28 04:46:41,473 INFO L496 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-28 04:46:41,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-28 04:46:41,521 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-28 04:46:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-28 04:46:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 04:46:41,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:46:41,522 INFO L195 NwaCegarLoop]: 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-28 04:46:41,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 04:46:41,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:46:41,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:46:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:46:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-28 04:46:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:41,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1586608789] [2022-04-28 04:46:41,737 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:46:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-28 04:46:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:46:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144563973] [2022-04-28 04:46:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:46:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:46:41,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:46:41,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815098151] [2022-04-28 04:46:41,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:46:41,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:46:41,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:46:41,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:46:41,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 04:46:41,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:46:41,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:46:41,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:46:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:46:41,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:46:41,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-28 04:46:41,899 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-28 04:46:41,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 04:46:41,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-28 04:46:41,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 04:46:41,900 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-28 04:46:41,900 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {906#true} is VALID [2022-04-28 04:46:41,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 04:46:41,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 04:46:41,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 04:46:41,901 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-28 04:46:41,901 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-28 04:46:41,902 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-28 04:46:41,902 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-28 04:46:41,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 04:46:41,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 04:46:41,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 04:46:41,903 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-28 04:46:41,903 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-28 04:46:41,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 04:46:41,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 04:46:41,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 04:46:41,904 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-28 04:46:41,905 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-28 04:46:41,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {985#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:46:41,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-28 04:46:41,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 04:46:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:46:41,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:46:41,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:46:41,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144563973] [2022-04-28 04:46:41,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:46:41,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815098151] [2022-04-28 04:46:41,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815098151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:41,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:41,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:46:41,907 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:46:41,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1586608789] [2022-04-28 04:46:41,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1586608789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:41,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:41,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:46:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915576496] [2022-04-28 04:46:41,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:46:41,908 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-28 04:46:41,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:46:41,908 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-28 04:46:41,927 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-28 04:46:41,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:46:41,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:41,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:46:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:46:41,928 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-28 04:46:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:42,132 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 04:46:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:46:42,132 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-28 04:46:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:46:42,132 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-28 04:46:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 04:46:42,134 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-28 04:46:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 04:46:42,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 04:46:42,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:46:42,196 INFO L225 Difference]: With dead ends: 58 [2022-04-28 04:46:42,196 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 04:46:42,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:46:42,197 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:46:42,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:46:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 04:46:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-28 04:46:42,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:46:42,213 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-28 04:46:42,213 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-28 04:46:42,214 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-28 04:46:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:42,216 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 04:46:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 04:46:42,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:46:42,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:46:42,217 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-28 04:46:42,217 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-28 04:46:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:42,220 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 04:46:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 04:46:42,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:46:42,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:46:42,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:46:42,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:46:42,221 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-28 04:46:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-28 04:46:42,223 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-28 04:46:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:46:42,223 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-28 04:46:42,223 INFO L496 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-28 04:46:42,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-28 04:46:42,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:46:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-28 04:46:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 04:46:42,294 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:46:42,294 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:46:42,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 04:46:42,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 04:46:42,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:46:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:46:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-28 04:46:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [301684020] [2022-04-28 04:46:42,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:46:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-28 04:46:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:46:42,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36990941] [2022-04-28 04:46:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:46:42,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:46:42,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:46:42,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139759965] [2022-04-28 04:46:42,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:46:42,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:46:42,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:46:42,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:46:42,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:46:42,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:46:42,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:46:42,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:46:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:46:42,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:46:42,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-28 04:46:42,676 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-28 04:46:42,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 04:46:42,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-28 04:46:42,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-28 04:46:42,677 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-28 04:46:42,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1325#true} is VALID [2022-04-28 04:46:42,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 04:46:42,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 04:46:42,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 04:46:42,678 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-28 04:46:42,678 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-28 04:46:42,679 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-28 04:46:42,679 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-28 04:46:42,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 04:46:42,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 04:46:42,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 04:46:42,680 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-28 04:46:42,680 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-28 04:46:42,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 04:46:42,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 04:46:42,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 04:46:42,681 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-28 04:46:42,681 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-28 04:46:42,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 04:46:42,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 04:46:42,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 04:46:42,682 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-28 04:46:42,683 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-28 04:46:42,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:46:42,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-28 04:46:42,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-28 04:46:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 04:46:42,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:46:42,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:46:42,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36990941] [2022-04-28 04:46:42,685 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:46:42,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139759965] [2022-04-28 04:46:42,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139759965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:42,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:42,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:46:42,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:46:42,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [301684020] [2022-04-28 04:46:42,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [301684020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:42,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:42,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:46:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507281254] [2022-04-28 04:46:42,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:46:42,687 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-28 04:46:42,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:46:42,687 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-28 04:46:42,707 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-28 04:46:42,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:46:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:42,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:46:42,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:46:42,708 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-28 04:46:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:42,946 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-28 04:46:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:46:42,946 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-28 04:46:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:46:42,946 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-28 04:46:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 04:46:42,948 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-28 04:46:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 04:46:42,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 04:46:43,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:46:43,009 INFO L225 Difference]: With dead ends: 66 [2022-04-28 04:46:43,009 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 04:46:43,010 INFO L412 NwaCegarLoop]: 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-28 04:46:43,010 INFO L413 NwaCegarLoop]: 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-28 04:46:43,011 INFO L414 NwaCegarLoop]: 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-28 04:46:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 04:46:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 04:46:43,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:46:43,026 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-28 04:46:43,026 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-28 04:46:43,027 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-28 04:46:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:43,028 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 04:46:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 04:46:43,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:46:43,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:46:43,029 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-28 04:46:43,029 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-28 04:46:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:43,031 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 04:46:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 04:46:43,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:46:43,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:46:43,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:46:43,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:46:43,032 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-28 04:46:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-28 04:46:43,033 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-28 04:46:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:46:43,033 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-28 04:46:43,033 INFO L496 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-28 04:46:43,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-28 04:46:43,098 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-28 04:46:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 04:46:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 04:46:43,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:46:43,099 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:46:43,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 04:46:43,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:46:43,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:46:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:46:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-28 04:46:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:43,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2021870110] [2022-04-28 04:48:43,382 WARN L232 SmtUtils]: Spent 1.99m on a formula simplification. DAG size of input: 192 DAG size of output: 184 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 04:48:43,432 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-28 04:48:43,436 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:48:43,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1018400594, now seen corresponding path program 1 times [2022-04-28 04:48:43,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:48:43,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237020341] [2022-04-28 04:48:43,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:48:43,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:48:43,483 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:48:43,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96710820] [2022-04-28 04:48:43,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:48:43,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:43,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:48:43,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:48:43,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 04:48:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:43,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 04:48:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:43,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:48:45,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:48:45,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237020341] [2022-04-28 04:48:45,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:48:45,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96710820] [2022-04-28 04:48:45,751 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 04:48:45,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 04:48:45,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:45,958 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Illegal for the call above at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForLocalEliminatees.findSomePushableLocalEliminateeSet(QuantifierPushUtilsForLocalEliminatees.java:177) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForLocalEliminatees.pushLocalEliminateesOverCorrespondingFiniteJunction(QuantifierPushUtilsForLocalEliminatees.java:74) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:174) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:330) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:289) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 04:48:45,961 INFO L158 Benchmark]: Toolchain (without parser) took 126880.42ms. Allocated memory was 222.3MB in the beginning and 324.0MB in the end (delta: 101.7MB). Free memory was 167.9MB in the beginning and 195.0MB in the end (delta: -27.1MB). Peak memory consumption was 76.4MB. Max. memory is 8.0GB. [2022-04-28 04:48:45,961 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 222.3MB. Free memory is still 183.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:48:45,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.14ms. Allocated memory was 222.3MB in the beginning and 269.5MB in the end (delta: 47.2MB). Free memory was 167.6MB in the beginning and 239.1MB in the end (delta: -71.5MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-28 04:48:45,962 INFO L158 Benchmark]: Boogie Preprocessor took 34.58ms. Allocated memory is still 269.5MB. Free memory was 239.1MB in the beginning and 237.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:48:45,962 INFO L158 Benchmark]: RCFGBuilder took 276.42ms. Allocated memory is still 269.5MB. Free memory was 237.6MB in the beginning and 225.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 04:48:45,962 INFO L158 Benchmark]: TraceAbstraction took 126329.74ms. Allocated memory was 269.5MB in the beginning and 324.0MB in the end (delta: 54.5MB). Free memory was 225.0MB in the beginning and 195.0MB in the end (delta: 30.0MB). Peak memory consumption was 86.2MB. Max. memory is 8.0GB. [2022-04-28 04:48:45,963 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.09ms. Allocated memory is still 222.3MB. Free memory is still 183.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.14ms. Allocated memory was 222.3MB in the beginning and 269.5MB in the end (delta: 47.2MB). Free memory was 167.6MB in the beginning and 239.1MB in the end (delta: -71.5MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.58ms. Allocated memory is still 269.5MB. Free memory was 239.1MB in the beginning and 237.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 276.42ms. Allocated memory is still 269.5MB. Free memory was 237.6MB in the beginning and 225.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 126329.74ms. Allocated memory was 269.5MB in the beginning and 324.0MB in the end (delta: 54.5MB). Free memory was 225.0MB in the beginning and 195.0MB in the end (delta: 30.0MB). Peak memory consumption was 86.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Illegal for the call above de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Illegal for the call above: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForLocalEliminatees.findSomePushableLocalEliminateeSet(QuantifierPushUtilsForLocalEliminatees.java:177) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 04:48:46,191 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-28 04:48:46,201 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...