/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:49:14,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:49:14,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:49:14,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:49:14,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:49:14,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:49:14,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:49:14,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:49:14,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:49:14,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:49:14,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:49:14,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:49:14,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:49:14,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:49:14,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:49:14,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:49:14,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:49:14,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:49:14,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:49:14,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:49:14,166 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:49:14,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:49:14,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:49:14,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:49:14,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:49:14,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:49:14,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:49:14,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:49:14,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:49:14,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:49:14,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:49:14,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:49:14,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:49:14,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:49:14,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:49:14,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:49:14,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:49:14,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:49:14,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:49:14,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:49:14,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:49:14,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:49:14,189 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:49:14,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:49:14,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:49:14,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:49:14,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:49:14,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:49:14,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:49:14,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:49:14,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:49:14,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:49:14,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:49:14,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:49:14,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:49:14,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:49:14,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:49:14,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:49:14,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:49:14,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:49:14,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:49:14,197 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:49:14,197 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:49:14,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:49:14,197 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:49:14,197 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:49:14,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:49:14,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:49:14,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:49:14,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:49:14,378 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:49:14,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-15 13:49:14,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b575812/cfdc02c79fa4449fbcbdcd19f8dfb31f/FLAG5f2f8e998 [2022-04-15 13:49:14,775 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:49:14,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-15 13:49:14,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b575812/cfdc02c79fa4449fbcbdcd19f8dfb31f/FLAG5f2f8e998 [2022-04-15 13:49:15,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b575812/cfdc02c79fa4449fbcbdcd19f8dfb31f [2022-04-15 13:49:15,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:49:15,159 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:49:15,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:49:15,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:49:15,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:49:15,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:49:15" (1/1) ... [2022-04-15 13:49:15,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad2831c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15, skipping insertion in model container [2022-04-15 13:49:15,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:49:15" (1/1) ... [2022-04-15 13:49:15,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:49:15,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:49:15,275 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_unwindbound50.c[588,601] [2022-04-15 13:49:15,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:49:15,309 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:49:15,316 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_unwindbound50.c[588,601] [2022-04-15 13:49:15,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:49:15,332 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:49:15,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15 WrapperNode [2022-04-15 13:49:15,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:49:15,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:49:15,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:49:15,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:49:15,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15" (1/1) ... [2022-04-15 13:49:15,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15" (1/1) ... [2022-04-15 13:49:15,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15" (1/1) ... [2022-04-15 13:49:15,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15" (1/1) ... [2022-04-15 13:49:15,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15" (1/1) ... [2022-04-15 13:49:15,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15" (1/1) ... [2022-04-15 13:49:15,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15" (1/1) ... [2022-04-15 13:49:15,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:49:15,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:49:15,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:49:15,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:49:15,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15" (1/1) ... [2022-04-15 13:49:15,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:49:15,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:49:15,400 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:49:15,406 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:49:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:49:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:49:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:49:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:49:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:49:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:49:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:49:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:49:15,468 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:49:15,470 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:49:15,647 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:49:15,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:49:15,652 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:49:15,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:49:15 BoogieIcfgContainer [2022-04-15 13:49:15,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:49:15,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:49:15,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:49:15,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:49:15,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:49:15" (1/3) ... [2022-04-15 13:49:15,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d3d53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:49:15, skipping insertion in model container [2022-04-15 13:49:15,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:49:15" (2/3) ... [2022-04-15 13:49:15,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d3d53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:49:15, skipping insertion in model container [2022-04-15 13:49:15,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:49:15" (3/3) ... [2022-04-15 13:49:15,658 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.c [2022-04-15 13:49:15,661 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:49:15,661 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:49:15,687 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:49:15,692 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:49:15,692 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:49:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:49:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:49:15,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:49:15,708 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:49:15,708 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:49:15,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:49:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-15 13:49:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:15,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [624370126] [2022-04-15 13:49:15,723 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:49:15,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-15 13:49:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:49:15,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384788035] [2022-04-15 13:49:15,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:49:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:49:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:49:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:49:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:49:15,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-15 13:49:15,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 13:49:15,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-15 13:49:15,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:49:15,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-15 13:49:15,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 13:49:15,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-15 13:49:15,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-15 13:49:15,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-15 13:49:15,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-15 13:49:15,883 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-15 13:49:15,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-15 13:49:15,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-15 13:49:15,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-15 13:49:15,893 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:49:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:49:15,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384788035] [2022-04-15 13:49:15,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384788035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:15,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:15,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:49:15,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:49:15,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [624370126] [2022-04-15 13:49:15,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [624370126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:15,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:15,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:49:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833504534] [2022-04-15 13:49:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:49:15,901 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:49:15,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:49:15,904 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:49:15,922 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:49:15,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:49:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:15,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:49:15,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:49:15,941 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:16,124 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-15 13:49:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:49:16,124 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:49:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:49:16,125 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:49:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 13:49:16,132 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:49:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 13:49:16,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-15 13:49:16,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:16,247 INFO L225 Difference]: With dead ends: 57 [2022-04-15 13:49:16,247 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:49:16,249 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:49:16,251 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:49:16,252 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:49:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:49:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 13:49:16,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:49:16,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:16,272 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:16,272 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:16,276 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-15 13:49:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-15 13:49:16,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:16,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:16,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-15 13:49:16,278 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-15 13:49:16,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:16,281 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-15 13:49:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-15 13:49:16,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:16,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:16,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:49:16,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:49:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-15 13:49:16,285 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-15 13:49:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:49:16,285 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-15 13:49:16,286 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:49:16,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-15 13:49:16,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-15 13:49:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:49:16,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:49:16,319 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:49:16,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:49:16,319 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:49:16,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:49:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-15 13:49:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:16,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620082825] [2022-04-15 13:49:16,321 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:49:16,321 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-15 13:49:16,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:49:16,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126603961] [2022-04-15 13:49:16,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:49:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:49:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:49:16,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:49:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:49:16,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:49:16,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:49:16,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:49:16,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:49:16,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:49:16,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:49:16,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:49:16,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-15 13:49:16,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:49:16,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {268#(= |main_#t~post5| 0)} is VALID [2022-04-15 13:49:16,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {263#false} is VALID [2022-04-15 13:49:16,393 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {263#false} is VALID [2022-04-15 13:49:16,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-15 13:49:16,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-15 13:49:16,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-15 13:49:16,394 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:49:16,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:49:16,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126603961] [2022-04-15 13:49:16,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126603961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:16,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:16,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:49:16,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:49:16,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620082825] [2022-04-15 13:49:16,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620082825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:16,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:16,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:49:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641132910] [2022-04-15 13:49:16,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:49:16,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:49:16,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:49:16,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:16,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:16,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:49:16,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:16,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:49:16,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:49:16,406 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:16,614 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-15 13:49:16,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:49:16,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:49:16,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:49:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-15 13:49:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-15 13:49:16,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-15 13:49:16,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:16,665 INFO L225 Difference]: With dead ends: 40 [2022-04-15 13:49:16,666 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:49:16,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:49:16,667 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:49:16,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:49:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:49:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 13:49:16,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:49:16,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:16,672 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:16,673 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:16,675 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-15 13:49:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 13:49:16,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:16,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:16,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-15 13:49:16,676 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-15 13:49:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:16,678 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-15 13:49:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 13:49:16,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:16,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:16,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:49:16,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:49:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-15 13:49:16,681 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-15 13:49:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:49:16,681 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-15 13:49:16,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:16,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-15 13:49:16,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 13:49:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:49:16,715 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:49:16,715 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:49:16,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:49:16,715 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:49:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:49:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-15 13:49:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:16,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737972624] [2022-04-15 13:49:16,716 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:49:16,717 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-15 13:49:16,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:49:16,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495791193] [2022-04-15 13:49:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:49:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:49:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:49:16,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:49:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:49:16,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-15 13:49:16,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-15 13:49:16,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-15 13:49:16,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:49:16,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-15 13:49:16,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-15 13:49:16,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-15 13:49:16,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-15 13:49:16,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 13:49:16,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 13:49:16,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 50);havoc #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 13:49:16,841 INFO L272 TraceCheckUtils]: 8: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:49:16,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:49:16,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-15 13:49:16,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-15 13:49:16,845 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:49:16,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:49:16,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495791193] [2022-04-15 13:49:16,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495791193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:16,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:16,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:49:16,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:49:16,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [737972624] [2022-04-15 13:49:16,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [737972624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:16,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:16,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:49:16,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793563422] [2022-04-15 13:49:16,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:49:16,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:49:16,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:49:16,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:16,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:16,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:49:16,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:49:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:49:16,858 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:17,160 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-15 13:49:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:49:17,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:49:17,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:49:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 13:49:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 13:49:17,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 13:49:17,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:17,204 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:49:17,204 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 13:49:17,205 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:49:17,208 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:49:17,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:49:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 13:49:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 13:49:17,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:49:17,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:17,214 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:17,214 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:17,216 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 13:49:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 13:49:17,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:17,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:17,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-15 13:49:17,217 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-15 13:49:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:17,219 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 13:49:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 13:49:17,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:17,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:17,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:49:17,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:49:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:49:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 13:49:17,221 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-15 13:49:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:49:17,221 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 13:49:17,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:49:17,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-15 13:49:17,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 13:49:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:49:17,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:49:17,270 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:49:17,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:49:17,271 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:49:17,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:49:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-15 13:49:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:17,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [610541034] [2022-04-15 13:49:17,276 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:49:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-15 13:49:17,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:49:17,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43389155] [2022-04-15 13:49:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:49:17,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:49:17,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:49:17,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966464391] [2022-04-15 13:49:17,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:49:17,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:49:17,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:49:17,314 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:49:17,315 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:49:17,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:49:17,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:49:17,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:49:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:49:17,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:49:17,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-15 13:49:17,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {681#true} is VALID [2022-04-15 13:49:17,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-15 13:49:17,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-15 13:49:17,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-15 13:49:17,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:49:17,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:49:17,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:49:17,510 INFO L272 TraceCheckUtils]: 8: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {681#true} is VALID [2022-04-15 13:49:17,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-15 13:49:17,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-15 13:49:17,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-15 13:49:17,511 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {681#true} {701#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:49:17,512 INFO L272 TraceCheckUtils]: 13: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:49:17,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:49:17,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-15 13:49:17,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-15 13:49:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:49:17,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:49:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:49:17,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43389155] [2022-04-15 13:49:17,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:49:17,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966464391] [2022-04-15 13:49:17,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966464391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:17,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:17,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:49:17,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:49:17,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [610541034] [2022-04-15 13:49:17,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [610541034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:17,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:17,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:49:17,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911287604] [2022-04-15 13:49:17,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:49:17,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 13:49:17,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:49:17,515 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:49:17,528 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:49:17,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:49:17,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:17,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:49:17,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:49:17,529 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:49:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:17,876 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-15 13:49:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:49:17,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 13:49:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:49:17,877 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:49:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:49:17,879 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:49:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:49:17,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 13:49:17,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:17,937 INFO L225 Difference]: With dead ends: 50 [2022-04-15 13:49:17,937 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 13:49:17,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:49:17,938 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:49:17,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:49:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 13:49:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-15 13:49:17,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:49:17,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:49:17,950 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:49:17,950 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:49:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:17,953 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-15 13:49:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-15 13:49:17,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:17,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:17,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-15 13:49:17,954 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-15 13:49:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:17,957 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-15 13:49:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-15 13:49:17,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:17,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:17,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:49:17,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:49:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:49:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-15 13:49:17,959 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-15 13:49:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:49:17,960 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-15 13:49:17,960 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:49:17,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-15 13:49:18,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-15 13:49:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:49:18,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:49:18,005 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:49:18,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 13:49:18,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:49:18,220 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:49:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:49:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-15 13:49:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:18,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1047830132] [2022-04-15 13:49:18,221 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:49:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-15 13:49:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:49:18,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547995244] [2022-04-15 13:49:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:49:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:49:18,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:49:18,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342959123] [2022-04-15 13:49:18,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:49:18,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:49:18,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:49:18,246 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:49:18,246 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:49:18,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:49:18,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:49:18,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:49:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:49:18,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:49:18,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-15 13:49:18,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1010#true} is VALID [2022-04-15 13:49:18,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-15 13:49:18,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-15 13:49:18,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-15 13:49:18,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:49:18,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:49:18,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:49:18,427 INFO L272 TraceCheckUtils]: 8: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1010#true} is VALID [2022-04-15 13:49:18,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-15 13:49:18,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-15 13:49:18,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-15 13:49:18,431 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:49:18,431 INFO L272 TraceCheckUtils]: 13: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1010#true} is VALID [2022-04-15 13:49:18,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-15 13:49:18,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-15 13:49:18,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-15 13:49:18,433 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:49:18,433 INFO L272 TraceCheckUtils]: 18: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:49:18,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:49:18,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-15 13:49:18,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-15 13:49:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:49:18,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:49:18,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:49:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547995244] [2022-04-15 13:49:18,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:49:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342959123] [2022-04-15 13:49:18,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342959123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:18,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:18,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:49:18,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:49:18,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1047830132] [2022-04-15 13:49:18,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1047830132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:18,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:18,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:49:18,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375179609] [2022-04-15 13:49:18,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:49:18,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 13:49:18,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:49:18,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:49:18,452 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:49:18,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:49:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:18,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:49:18,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:49:18,455 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:49:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:18,717 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-15 13:49:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:49:18,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 13:49:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:49:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:49:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:49:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:49:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:49:18,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 13:49:18,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:18,772 INFO L225 Difference]: With dead ends: 54 [2022-04-15 13:49:18,772 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 13:49:18,773 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:49:18,773 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:49:18,773 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:49:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 13:49:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-15 13:49:18,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:49:18,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:49:18,787 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:49:18,787 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:49:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:18,790 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 13:49:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 13:49:18,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:18,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:18,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-15 13:49:18,791 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-15 13:49:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:18,793 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 13:49:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 13:49:18,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:18,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:18,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:49:18,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:49:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:49:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-15 13:49:18,795 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-15 13:49:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:49:18,795 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-15 13:49:18,795 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:49:18,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-15 13:49:18,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-15 13:49:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 13:49:18,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:49:18,860 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:49:18,876 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:49:19,076 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:49:19,076 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:49:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:49:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-15 13:49:19,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:19,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1246658975] [2022-04-15 13:49:19,077 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:49:19,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-15 13:49:19,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:49:19,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875711174] [2022-04-15 13:49:19,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:49:19,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:49:19,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:49:19,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864878491] [2022-04-15 13:49:19,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:49:19,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:49:19,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:49:19,101 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:49:19,102 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:49:19,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:49:19,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:49:19,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:49:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:49:19,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:49:19,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-15 13:49:19,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1390#true} is VALID [2022-04-15 13:49:19,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-15 13:49:19,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-15 13:49:19,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-15 13:49:19,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:49:19,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:49:19,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:49:19,270 INFO L272 TraceCheckUtils]: 8: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-15 13:49:19,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-15 13:49:19,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-15 13:49:19,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-15 13:49:19,271 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:49:19,271 INFO L272 TraceCheckUtils]: 13: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1390#true} is VALID [2022-04-15 13:49:19,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-15 13:49:19,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-15 13:49:19,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-15 13:49:19,272 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:49:19,272 INFO L272 TraceCheckUtils]: 18: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-15 13:49:19,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-15 13:49:19,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-15 13:49:19,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-15 13:49:19,275 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:49:19,276 INFO L272 TraceCheckUtils]: 23: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:49:19,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:49:19,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-15 13:49:19,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-15 13:49:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 13:49:19,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:49:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:49:19,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875711174] [2022-04-15 13:49:19,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:49:19,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864878491] [2022-04-15 13:49:19,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864878491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:19,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:19,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:49:19,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:49:19,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1246658975] [2022-04-15 13:49:19,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1246658975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:49:19,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:49:19,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:49:19,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245953176] [2022-04-15 13:49:19,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:49:19,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-15 13:49:19,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:49:19,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:49:19,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:19,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:49:19,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:19,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:49:19,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:49:19,297 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:49:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:19,568 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-15 13:49:19,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:49:19,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-15 13:49:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:49:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:49:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:49:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:49:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:49:19,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 13:49:19,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:19,626 INFO L225 Difference]: With dead ends: 62 [2022-04-15 13:49:19,626 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 13:49:19,626 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:49:19,626 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:49:19,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:49:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 13:49:19,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 13:49:19,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:49:19,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:49:19,642 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:49:19,642 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:49:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:19,644 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-15 13:49:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 13:49:19,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:19,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:19,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-15 13:49:19,644 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-15 13:49:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:49:19,646 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-15 13:49:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 13:49:19,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:49:19,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:49:19,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:49:19,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:49:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:49:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-15 13:49:19,648 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-15 13:49:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:49:19,648 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-15 13:49:19,648 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:49:19,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-15 13:49:19,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:49:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 13:49:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 13:49:19,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:49:19,705 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:49:19,721 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:49:19,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:49:19,911 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:49:19,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:49:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-15 13:49:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:49:19,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1369862624]