/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/ps4-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:32:39,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:32:39,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:32:39,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:32:39,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:32:39,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:32:39,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:32:39,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:32:39,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:32:39,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:32:39,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:32:39,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:32:39,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:32:39,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:32:39,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:32:39,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:32:39,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:32:39,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:32:39,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:32:39,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:32:39,122 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:32:39,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:32:39,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:32:39,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:32:39,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:32:39,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:32:39,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:32:39,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:32:39,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:32:39,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:32:39,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:32:39,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:32:39,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:32:39,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:32:39,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:32:39,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:32:39,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:32:39,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:32:39,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:32:39,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:32:39,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:32:39,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:32:39,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:32:39,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:32:39,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:32:39,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:32:39,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:32:39,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:32:39,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:32:39,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:32:39,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:32:39,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:32:39,150 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:32:39,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:32:39,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:32:39,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:32:39,151 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:32:39,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:32:39,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:32:39,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:32:39,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:32:39,151 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:32:39,151 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:32:39,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:32:39,152 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:32:39,152 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:32:39,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:32:39,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:32:39,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:32:39,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:32:39,319 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:32:39,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps4-ll.c [2022-04-15 13:32:39,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597a90503/953d45f670674db881cab29576985779/FLAG877595e0d [2022-04-15 13:32:39,660 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:32:39,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps4-ll.c [2022-04-15 13:32:39,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597a90503/953d45f670674db881cab29576985779/FLAG877595e0d [2022-04-15 13:32:39,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597a90503/953d45f670674db881cab29576985779 [2022-04-15 13:32:39,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:32:39,677 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:32:39,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:32:39,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:32:39,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:32:39,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:32:39" (1/1) ... [2022-04-15 13:32:39,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13196ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39, skipping insertion in model container [2022-04-15 13:32:39,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:32:39" (1/1) ... [2022-04-15 13:32:39,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:32:39,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:32:39,817 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/ps4-ll.c[458,471] [2022-04-15 13:32:39,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:32:39,848 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:32:39,857 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/ps4-ll.c[458,471] [2022-04-15 13:32:39,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:32:39,885 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:32:39,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39 WrapperNode [2022-04-15 13:32:39,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:32:39,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:32:39,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:32:39,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:32:39,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39" (1/1) ... [2022-04-15 13:32:39,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39" (1/1) ... [2022-04-15 13:32:39,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39" (1/1) ... [2022-04-15 13:32:39,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39" (1/1) ... [2022-04-15 13:32:39,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39" (1/1) ... [2022-04-15 13:32:39,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39" (1/1) ... [2022-04-15 13:32:39,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39" (1/1) ... [2022-04-15 13:32:39,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:32:39,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:32:39,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:32:39,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:32:39,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39" (1/1) ... [2022-04-15 13:32:39,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:32:39,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:32:39,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:32:39,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:32:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:32:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:32:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:32:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:32:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:32:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:32:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:32:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:32:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:32:40,031 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:32:40,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:32:40,155 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:32:40,159 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:32:40,160 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:32:40,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:32:40 BoogieIcfgContainer [2022-04-15 13:32:40,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:32:40,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:32:40,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:32:40,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:32:40,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:32:39" (1/3) ... [2022-04-15 13:32:40,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b263dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:32:40, skipping insertion in model container [2022-04-15 13:32:40,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:32:39" (2/3) ... [2022-04-15 13:32:40,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b263dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:32:40, skipping insertion in model container [2022-04-15 13:32:40,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:32:40" (3/3) ... [2022-04-15 13:32:40,166 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll.c [2022-04-15 13:32:40,169 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:32:40,169 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:32:40,203 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:32:40,207 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:32:40,207 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:32:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:32:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:32:40,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:32:40,233 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:32:40,233 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:32:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:32:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash -973133132, now seen corresponding path program 1 times [2022-04-15 13:32:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:32:40,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197068302] [2022-04-15 13:32:40,259 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:32:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash -973133132, now seen corresponding path program 2 times [2022-04-15 13:32:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:32:40,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624556404] [2022-04-15 13:32:40,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:32:40,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:32:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:32:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:32:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:32:40,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(9, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 13:32:40,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 13:32:40,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-15 13:32:40,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:32:40,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(9, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 13:32:40,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 13:32:40,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-15 13:32:40,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-15 13:32:40,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25#true} is VALID [2022-04-15 13:32:40,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume false; {26#false} is VALID [2022-04-15 13:32:40,419 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-15 13:32:40,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 13:32:40,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 13:32:40,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 13:32:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:32:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:32:40,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624556404] [2022-04-15 13:32:40,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624556404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:32:40,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:32:40,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:32:40,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:32:40,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197068302] [2022-04-15 13:32:40,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197068302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:32:40,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:32:40,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:32:40,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605295547] [2022-04-15 13:32:40,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:32:40,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:32:40,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:32:40,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:32:40,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:32:40,461 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:32:40,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:32:40,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:32:40,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:32:40,482 INFO L87 Difference]: Start difference. First operand has 22 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:32:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:32:40,566 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-15 13:32:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:32:40,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:32:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:32:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:32:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-15 13:32:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:32:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-15 13:32:40,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-15 13:32:40,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:32:40,638 INFO L225 Difference]: With dead ends: 38 [2022-04-15 13:32:40,638 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:32:40,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:32:40,642 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:32:40,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:32:40,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:32:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 13:32:40,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:32:40,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:32:40,661 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:32:40,662 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:32:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:32:40,664 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:32:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:32:40,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:32:40,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:32:40,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 17 states. [2022-04-15 13:32:40,665 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 17 states. [2022-04-15 13:32:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:32:40,666 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:32:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:32:40,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:32:40,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:32:40,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:32:40,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:32:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:32:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 13:32:40,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 13:32:40,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:32:40,669 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 13:32:40,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:32:40,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 13:32:40,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:32:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:32:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:32:40,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:32:40,698 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:32:40,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:32:40,703 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:32:40,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:32:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash -971345672, now seen corresponding path program 1 times [2022-04-15 13:32:40,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:32:40,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [185189104] [2022-04-15 13:32:40,705 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:32:40,705 INFO L85 PathProgramCache]: Analyzing trace with hash -971345672, now seen corresponding path program 2 times [2022-04-15 13:32:40,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:32:40,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669349642] [2022-04-15 13:32:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:32:40,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:32:40,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:32:40,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475377343] [2022-04-15 13:32:40,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:32:40,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:32:40,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:32:40,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:32:40,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:32:40,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 13:32:40,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:32:40,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:32:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:32:40,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:32:40,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2022-04-15 13:32:40,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#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(9, 2);call #Ultimate.allocInit(12, 3); {177#true} is VALID [2022-04-15 13:32:40,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-15 13:32:40,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #56#return; {177#true} is VALID [2022-04-15 13:32:40,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret5 := main(); {177#true} is VALID [2022-04-15 13:32:40,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {197#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 13:32:40,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {197#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 13:32:40,861 INFO L272 TraceCheckUtils]: 7: Hoare triple {197#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:32:40,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:32:40,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {178#false} is VALID [2022-04-15 13:32:40,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-04-15 13:32:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:32:40,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:32:40,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:32:40,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669349642] [2022-04-15 13:32:40,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:32:40,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475377343] [2022-04-15 13:32:40,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475377343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:32:40,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:32:40,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:32:40,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:32:40,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [185189104] [2022-04-15 13:32:40,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [185189104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:32:40,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:32:40,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:32:40,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594835209] [2022-04-15 13:32:40,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:32:40,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:32:40,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:32:40,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:32:40,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:32:40,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:32:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:32:40,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:32:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:32:40,884 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:32:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:32:58,487 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 13:32:58,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:32:58,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:32:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:32:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:32:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 13:32:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:32:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 13:32:58,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 13:32:58,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:32:58,533 INFO L225 Difference]: With dead ends: 28 [2022-04-15 13:32:58,533 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 13:32:58,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:32:58,534 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:32:58,534 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:32:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 13:32:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 13:32:58,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:32:58,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:32:58,543 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:32:58,543 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:32:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:32:58,549 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 13:32:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 13:32:58,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:32:58,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:32:58,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-15 13:32:58,549 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-15 13:32:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:32:58,551 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 13:32:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 13:32:58,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:32:58,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:32:58,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:32:58,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:32:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:32:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 13:32:58,553 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2022-04-15 13:32:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:32:58,553 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 13:32:58,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:32:58,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 13:32:58,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:32:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 13:32:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 13:32:58,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:32:58,579 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:32:58,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 13:32:58,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:32:58,796 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:32:58,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:32:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1679137237, now seen corresponding path program 1 times [2022-04-15 13:32:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:32:58,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1457120478] [2022-04-15 13:41:17,919 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:41:17,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1136410440, now seen corresponding path program 1 times [2022-04-15 13:41:17,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:41:17,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333574988] [2022-04-15 13:41:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:41:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:41:17,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:41:17,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696714732] [2022-04-15 13:41:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:41:17,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:41:17,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:41:17,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:41:17,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:41:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:41:17,966 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:41:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:41:17,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:41:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1679137237, now seen corresponding path program 2 times [2022-04-15 13:41:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:41:17,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008097883] [2022-04-15 13:41:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:41:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:41:18,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:41:18,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446179645] [2022-04-15 13:41:18,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:41:18,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:41:18,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:41:18,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:41:18,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 13:41:18,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:41:18,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:41:18,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 13:41:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:41:18,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:41:18,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {368#true} is VALID [2022-04-15 13:41:18,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#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(9, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-15 13:41:18,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-15 13:41:18,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #56#return; {368#true} is VALID [2022-04-15 13:41:18,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret5 := main(); {368#true} is VALID [2022-04-15 13:41:18,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {388#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 13:41:18,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {388#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {388#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 13:41:18,163 INFO L272 TraceCheckUtils]: 7: Hoare triple {388#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {368#true} is VALID [2022-04-15 13:41:18,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#true} ~cond := #in~cond; {368#true} is VALID [2022-04-15 13:41:18,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#true} assume !(0 == ~cond); {368#true} is VALID [2022-04-15 13:41:18,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-15 13:41:18,164 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {368#true} {388#(and (= main_~x~0 0) (= main_~y~0 0))} #50#return; {388#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 13:41:18,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {388#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {410#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-15 13:41:18,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {410#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {410#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-15 13:41:18,166 INFO L272 TraceCheckUtils]: 14: Hoare triple {410#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {417#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:41:18,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {421#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:41:18,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {421#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {369#false} is VALID [2022-04-15 13:41:18,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-15 13:41:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:41:18,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:41:18,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-15 13:41:18,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {421#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {369#false} is VALID [2022-04-15 13:41:18,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {421#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:41:18,299 INFO L272 TraceCheckUtils]: 14: Hoare triple {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {417#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:41:18,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 13:41:18,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 13:41:18,310 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {368#true} {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #50#return; {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 13:41:18,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-15 13:41:18,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#true} assume !(0 == ~cond); {368#true} is VALID [2022-04-15 13:41:18,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#true} ~cond := #in~cond; {368#true} is VALID [2022-04-15 13:41:18,311 INFO L272 TraceCheckUtils]: 7: Hoare triple {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {368#true} is VALID [2022-04-15 13:41:18,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 13:41:18,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {437#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 13:41:18,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret5 := main(); {368#true} is VALID [2022-04-15 13:41:18,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #56#return; {368#true} is VALID [2022-04-15 13:41:18,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-15 13:41:18,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#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(9, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-15 13:41:18,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {368#true} is VALID [2022-04-15 13:41:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 13:41:18,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:41:18,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008097883] [2022-04-15 13:41:18,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:41:18,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446179645] [2022-04-15 13:41:18,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446179645] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 13:41:18,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 13:41:18,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 13:41:18,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:41:18,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1457120478] [2022-04-15 13:41:18,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1457120478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:41:18,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:41:18,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:41:18,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353637657] [2022-04-15 13:41:18,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:41:18,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 13:41:18,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:41:18,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:41:18,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:41:18,338 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:41:18,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:41:18,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:41:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:41:18,342 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:41:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:41:18,428 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 13:41:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:41:18,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 13:41:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:41:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:41:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 13:41:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:41:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 13:41:18,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-15 13:41:18,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:41:18,463 INFO L225 Difference]: With dead ends: 30 [2022-04-15 13:41:18,464 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:41:18,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:41:18,467 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:41:18,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 47 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:41:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:41:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 13:41:18,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:41:18,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:41:18,487 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:41:18,487 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:41:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:41:18,493 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:41:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:41:18,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:41:18,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:41:18,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 13:41:18,493 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 13:41:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:41:18,494 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:41:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:41:18,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:41:18,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:41:18,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:41:18,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:41:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:41:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 13:41:18,496 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 18 [2022-04-15 13:41:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:41:18,498 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 13:41:18,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:41:18,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 13:41:18,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:41:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:41:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 13:41:18,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:41:18,536 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:41:18,561 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-15 13:41:18,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 13:41:18,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:41:18,956 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:41:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:41:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1991962395, now seen corresponding path program 1 times [2022-04-15 13:41:18,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:41:18,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1525731500]