/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/dijkstra-u.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:43:58,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:43:58,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:43:58,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:43:58,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:43:58,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:43:58,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:43:58,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:43:58,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:43:58,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:43:58,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:43:58,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:43:58,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:43:58,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:43:58,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:43:58,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:43:58,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:43:58,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:43:58,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:43:58,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:43:58,659 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:43:58,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:43:58,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:43:58,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:43:58,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:43:58,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:43:58,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:43:58,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:43:58,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:43:58,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:43:58,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:43:58,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:43:58,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:43:58,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:43:58,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:43:58,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:43:58,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:43:58,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:43:58,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:43:58,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:43:58,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:43:58,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:43:58,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:43:58,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:43:58,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:43:58,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:43:58,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:43:58,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:43:58,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:43:58,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:43:58,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:43:58,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:43:58,685 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:43:58,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:43:58,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:43:58,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:43:58,686 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:43:58,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:43:58,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:43:58,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:43:58,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:43:58,687 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:43:58,687 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:43:58,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:43:58,687 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:43:58,687 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:43:58,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:43:58,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:43:58,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:43:58,960 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:43:58,961 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:43:58,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/dijkstra-u.c [2022-04-28 10:43:59,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166ec3ed6/a67ca88f2128402bb25eb7e5ad03864d/FLAGec8348a62 [2022-04-28 10:43:59,365 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:43:59,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/dijkstra-u.c [2022-04-28 10:43:59,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166ec3ed6/a67ca88f2128402bb25eb7e5ad03864d/FLAGec8348a62 [2022-04-28 10:43:59,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166ec3ed6/a67ca88f2128402bb25eb7e5ad03864d [2022-04-28 10:43:59,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:43:59,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:43:59,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:43:59,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:43:59,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:43:59,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:43:59" (1/1) ... [2022-04-28 10:43:59,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f44fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59, skipping insertion in model container [2022-04-28 10:43:59,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:43:59" (1/1) ... [2022-04-28 10:43:59,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:43:59,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:43:59,536 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/dijkstra-u.c[525,538] [2022-04-28 10:43:59,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:43:59,581 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:43:59,591 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/dijkstra-u.c[525,538] [2022-04-28 10:43:59,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:43:59,629 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:43:59,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59 WrapperNode [2022-04-28 10:43:59,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:43:59,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:43:59,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:43:59,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:43:59,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59" (1/1) ... [2022-04-28 10:43:59,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59" (1/1) ... [2022-04-28 10:43:59,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59" (1/1) ... [2022-04-28 10:43:59,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59" (1/1) ... [2022-04-28 10:43:59,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59" (1/1) ... [2022-04-28 10:43:59,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59" (1/1) ... [2022-04-28 10:43:59,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59" (1/1) ... [2022-04-28 10:43:59,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:43:59,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:43:59,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:43:59,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:43:59,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59" (1/1) ... [2022-04-28 10:43:59,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:43:59,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:59,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:43:59,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:43:59,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:43:59,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:43:59,716 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:43:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:43:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:43:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:43:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:43:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:43:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:43:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:43:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:43:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:43:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:43:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:43:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:43:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:43:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:43:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:43:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:43:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:43:59,767 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:43:59,769 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:43:59,986 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:44:00,001 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:44:00,003 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 10:44:00,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:44:00 BoogieIcfgContainer [2022-04-28 10:44:00,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:44:00,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:44:00,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:44:00,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:44:00,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:43:59" (1/3) ... [2022-04-28 10:44:00,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71df62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:44:00, skipping insertion in model container [2022-04-28 10:44:00,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:59" (2/3) ... [2022-04-28 10:44:00,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71df62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:44:00, skipping insertion in model container [2022-04-28 10:44:00,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:44:00" (3/3) ... [2022-04-28 10:44:00,011 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u.c [2022-04-28 10:44:00,019 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:44:00,019 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:44:00,047 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:44:00,051 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f5142c4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69be7d3c [2022-04-28 10:44:00,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:44:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:44:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:44:00,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:00,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:00,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash 818818098, now seen corresponding path program 1 times [2022-04-28 10:44:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:00,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1165301645] [2022-04-28 10:44:00,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:44:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 818818098, now seen corresponding path program 2 times [2022-04-28 10:44:00,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:00,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176437028] [2022-04-28 10:44:00,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:00,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:00,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:44:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:00,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-28 10:44:00,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 10:44:00,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #100#return; {40#true} is VALID [2022-04-28 10:44:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:44:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:00,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 10:44:00,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 10:44:00,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 10:44:00,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-28 10:44:00,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:44:00,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-28 10:44:00,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 10:44:00,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #100#return; {40#true} is VALID [2022-04-28 10:44:00,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret5 := main(); {40#true} is VALID [2022-04-28 10:44:00,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {40#true} is VALID [2022-04-28 10:44:00,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {40#true} is VALID [2022-04-28 10:44:00,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 10:44:00,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 10:44:00,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 10:44:00,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-28 10:44:00,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {41#false} is VALID [2022-04-28 10:44:00,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-28 10:44:00,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-28 10:44:00,201 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-28 10:44:00,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 10:44:00,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 10:44:00,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 10:44:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:00,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:00,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176437028] [2022-04-28 10:44:00,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176437028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:00,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:00,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:44:00,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:00,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1165301645] [2022-04-28 10:44:00,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1165301645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:00,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:00,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:44:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160530328] [2022-04-28 10:44:00,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:00,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 10:44:00,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:00,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:00,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:00,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:44:00,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:00,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:44:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:44:00,264 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:00,644 INFO L93 Difference]: Finished difference Result 65 states and 105 transitions. [2022-04-28 10:44:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:44:00,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 10:44:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-28 10:44:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-28 10:44:00,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-28 10:44:00,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:00,803 INFO L225 Difference]: With dead ends: 65 [2022-04-28 10:44:00,803 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:44:00,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:44:00,807 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:00,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:44:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:44:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 10:44:00,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:00,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:44:00,855 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:44:00,855 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:44:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:00,868 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 10:44:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 10:44:00,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:00,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:00,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 32 states. [2022-04-28 10:44:00,869 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 32 states. [2022-04-28 10:44:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:00,873 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 10:44:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 10:44:00,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:00,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:00,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:00,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:44:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 10:44:00,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-28 10:44:00,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:00,878 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 10:44:00,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:00,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 10:44:00,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 10:44:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:44:00,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:00,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:00,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:44:00,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:00,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1723375776, now seen corresponding path program 1 times [2022-04-28 10:44:00,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:00,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442660865] [2022-04-28 10:44:00,933 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:44:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1723375776, now seen corresponding path program 2 times [2022-04-28 10:44:00,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:00,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646190684] [2022-04-28 10:44:00,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:44:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:01,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {310#true} is VALID [2022-04-28 10:44:01,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-28 10:44:01,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {310#true} {310#true} #100#return; {310#true} is VALID [2022-04-28 10:44:01,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:44:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:01,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#true} ~cond := #in~cond; {310#true} is VALID [2022-04-28 10:44:01,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume !(0 == ~cond); {310#true} is VALID [2022-04-28 10:44:01,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-28 10:44:01,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #80#return; {310#true} is VALID [2022-04-28 10:44:01,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:44:01,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {310#true} is VALID [2022-04-28 10:44:01,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-28 10:44:01,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #100#return; {310#true} is VALID [2022-04-28 10:44:01,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret5 := main(); {310#true} is VALID [2022-04-28 10:44:01,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {310#true} is VALID [2022-04-28 10:44:01,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {310#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {310#true} is VALID [2022-04-28 10:44:01,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {310#true} ~cond := #in~cond; {310#true} is VALID [2022-04-28 10:44:01,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#true} assume !(0 == ~cond); {310#true} is VALID [2022-04-28 10:44:01,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-28 10:44:01,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {310#true} {310#true} #80#return; {310#true} is VALID [2022-04-28 10:44:01,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {310#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 10:44:01,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 10:44:01,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-28 10:44:01,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !false; {320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-28 10:44:01,215 INFO L272 TraceCheckUtils]: 15: Hoare triple {320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {321#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:44:01,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {321#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {322#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:44:01,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {322#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {311#false} is VALID [2022-04-28 10:44:01,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-04-28 10:44:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:01,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646190684] [2022-04-28 10:44:01,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646190684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:01,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:01,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:44:01,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:01,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442660865] [2022-04-28 10:44:01,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442660865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:01,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:01,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:44:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712702370] [2022-04-28 10:44:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:01,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-28 10:44:01,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:01,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:01,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:01,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:44:01,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:01,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:44:01,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:44:01,242 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:05,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:44:12,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:44:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:18,487 INFO L93 Difference]: Finished difference Result 67 states and 96 transitions. [2022-04-28 10:44:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:44:18,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-28 10:44:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-28 10:44:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-28 10:44:18,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2022-04-28 10:44:20,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 95 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:20,776 INFO L225 Difference]: With dead ends: 67 [2022-04-28 10:44:20,776 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:44:20,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:44:20,778 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 54 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:20,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 51 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 177 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2022-04-28 10:44:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:44:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 10:44:20,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:20,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:44:20,801 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:44:20,801 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:44:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:20,804 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-28 10:44:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-28 10:44:20,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:20,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:20,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 47 states. [2022-04-28 10:44:20,806 INFO L87 Difference]: Start difference. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 47 states. [2022-04-28 10:44:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:20,808 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-28 10:44:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-28 10:44:20,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:20,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:20,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:20,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:44:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2022-04-28 10:44:20,812 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 19 [2022-04-28 10:44:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:20,812 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2022-04-28 10:44:20,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:20,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 63 transitions. [2022-04-28 10:44:20,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-28 10:44:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:44:20,989 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:20,989 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:20,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:44:20,989 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1182987237, now seen corresponding path program 1 times [2022-04-28 10:44:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:20,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [439463881] [2022-04-28 10:44:21,001 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:21,001 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:21,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1182987237, now seen corresponding path program 2 times [2022-04-28 10:44:21,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:21,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212941844] [2022-04-28 10:44:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:21,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:44:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:21,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {658#true} is VALID [2022-04-28 10:44:21,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-28 10:44:21,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {658#true} {658#true} #100#return; {658#true} is VALID [2022-04-28 10:44:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:44:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:21,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {658#true} ~cond := #in~cond; {658#true} is VALID [2022-04-28 10:44:21,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} assume !(0 == ~cond); {658#true} is VALID [2022-04-28 10:44:21,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-28 10:44:21,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #80#return; {658#true} is VALID [2022-04-28 10:44:21,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:44:21,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {658#true} is VALID [2022-04-28 10:44:21,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-28 10:44:21,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #100#return; {658#true} is VALID [2022-04-28 10:44:21,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret5 := main(); {658#true} is VALID [2022-04-28 10:44:21,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {658#true} is VALID [2022-04-28 10:44:21,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {658#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {658#true} is VALID [2022-04-28 10:44:21,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#true} ~cond := #in~cond; {658#true} is VALID [2022-04-28 10:44:21,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#true} assume !(0 == ~cond); {658#true} is VALID [2022-04-28 10:44:21,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-28 10:44:21,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {658#true} {658#true} #80#return; {658#true} is VALID [2022-04-28 10:44:21,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {667#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 10:44:21,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {667#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !false; {667#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 10:44:21,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {667#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 10:44:21,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 10:44:21,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {669#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-28 10:44:21,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {669#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !false; {669#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-28 10:44:21,235 INFO L272 TraceCheckUtils]: 17: Hoare triple {669#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {670#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:44:21,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {671#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:44:21,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {671#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {659#false} is VALID [2022-04-28 10:44:21,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-04-28 10:44:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:21,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:21,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212941844] [2022-04-28 10:44:21,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212941844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:44:21,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983569049] [2022-04-28 10:44:21,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:44:21,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:21,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:21,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:44:21,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:44:21,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:44:21,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:21,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:44:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:21,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:22,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {658#true} is VALID [2022-04-28 10:44:22,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#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); {658#true} is VALID [2022-04-28 10:44:22,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-28 10:44:22,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #100#return; {658#true} is VALID [2022-04-28 10:44:22,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret5 := main(); {658#true} is VALID [2022-04-28 10:44:22,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {658#true} is VALID [2022-04-28 10:44:22,251 INFO L272 TraceCheckUtils]: 6: Hoare triple {658#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {658#true} is VALID [2022-04-28 10:44:22,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#true} ~cond := #in~cond; {658#true} is VALID [2022-04-28 10:44:22,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#true} assume !(0 == ~cond); {658#true} is VALID [2022-04-28 10:44:22,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-28 10:44:22,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {658#true} {658#true} #80#return; {658#true} is VALID [2022-04-28 10:44:22,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 10:44:22,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 10:44:22,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 10:44:22,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 10:44:22,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {669#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-28 10:44:22,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {669#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !false; {669#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-28 10:44:22,256 INFO L272 TraceCheckUtils]: 17: Hoare triple {669#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:22,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:22,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {659#false} is VALID [2022-04-28 10:44:22,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-04-28 10:44:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:44:22,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:44:22,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983569049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:22,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:44:22,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-04-28 10:44:22,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:22,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [439463881] [2022-04-28 10:44:22,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [439463881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:22,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:22,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:44:22,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232823022] [2022-04-28 10:44:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-28 10:44:22,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:22,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:22,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:22,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:44:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:22,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:44:22,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:44:22,276 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:27,296 INFO L93 Difference]: Finished difference Result 76 states and 110 transitions. [2022-04-28 10:44:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:44:27,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-28 10:44:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-28 10:44:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-28 10:44:27,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-04-28 10:44:27,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:27,752 INFO L225 Difference]: With dead ends: 76 [2022-04-28 10:44:27,752 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 10:44:27,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:44:27,753 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:27,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 145 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 10:44:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 10:44:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2022-04-28 10:44:27,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:27,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 10:44:27,800 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 10:44:27,800 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 10:44:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:27,804 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2022-04-28 10:44:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2022-04-28 10:44:27,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:27,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:27,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 70 states. [2022-04-28 10:44:27,806 INFO L87 Difference]: Start difference. First operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 70 states. [2022-04-28 10:44:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:27,809 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2022-04-28 10:44:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2022-04-28 10:44:27,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:27,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:27,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:27,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 10:44:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2022-04-28 10:44:27,821 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 21 [2022-04-28 10:44:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:27,822 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2022-04-28 10:44:27,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:44:27,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 86 transitions. [2022-04-28 10:44:28,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2022-04-28 10:44:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:44:28,201 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:28,201 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:28,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:44:28,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:28,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:28,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1777258624, now seen corresponding path program 1 times [2022-04-28 10:44:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:28,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513939382] [2022-04-28 10:44:28,403 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:44:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1777258624, now seen corresponding path program 2 times [2022-04-28 10:44:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:28,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053499732] [2022-04-28 10:44:28,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:28,413 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:44:28,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001378059] [2022-04-28 10:44:28,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:44:28,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:28,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:28,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:44:28,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:44:28,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:44:28,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:28,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:44:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:28,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:28,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1157#true} call ULTIMATE.init(); {1157#true} is VALID [2022-04-28 10:44:28,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1157#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); {1157#true} is VALID [2022-04-28 10:44:28,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {1157#true} assume true; {1157#true} is VALID [2022-04-28 10:44:28,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1157#true} {1157#true} #100#return; {1157#true} is VALID [2022-04-28 10:44:28,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {1157#true} call #t~ret5 := main(); {1157#true} is VALID [2022-04-28 10:44:28,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {1157#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1157#true} is VALID [2022-04-28 10:44:28,694 INFO L272 TraceCheckUtils]: 6: Hoare triple {1157#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1157#true} is VALID [2022-04-28 10:44:28,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {1157#true} ~cond := #in~cond; {1157#true} is VALID [2022-04-28 10:44:28,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {1157#true} assume !(0 == ~cond); {1157#true} is VALID [2022-04-28 10:44:28,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {1157#true} assume true; {1157#true} is VALID [2022-04-28 10:44:28,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1157#true} {1157#true} #80#return; {1157#true} is VALID [2022-04-28 10:44:28,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {1157#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 10:44:28,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 10:44:28,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 10:44:28,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 10:44:28,699 INFO L272 TraceCheckUtils]: 15: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1157#true} is VALID [2022-04-28 10:44:28,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {1157#true} ~cond := #in~cond; {1157#true} is VALID [2022-04-28 10:44:28,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {1157#true} assume !(0 == ~cond); {1157#true} is VALID [2022-04-28 10:44:28,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {1157#true} assume true; {1157#true} is VALID [2022-04-28 10:44:28,711 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1157#true} {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #82#return; {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 10:44:28,711 INFO L272 TraceCheckUtils]: 20: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1157#true} is VALID [2022-04-28 10:44:28,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {1157#true} ~cond := #in~cond; {1157#true} is VALID [2022-04-28 10:44:28,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {1157#true} assume !(0 == ~cond); {1157#true} is VALID [2022-04-28 10:44:28,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {1157#true} assume true; {1157#true} is VALID [2022-04-28 10:44:28,715 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1157#true} {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 10:44:28,717 INFO L272 TraceCheckUtils]: 25: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:28,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:28,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {1242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1158#false} is VALID [2022-04-28 10:44:28,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {1158#false} assume !false; {1158#false} is VALID [2022-04-28 10:44:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:44:28,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:44:28,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:28,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053499732] [2022-04-28 10:44:28,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:44:28,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001378059] [2022-04-28 10:44:28,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001378059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:28,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:28,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:44:28,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:28,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513939382] [2022-04-28 10:44:28,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513939382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:28,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:28,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:44:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593496611] [2022-04-28 10:44:28,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:28,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 29 [2022-04-28 10:44:28,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:28,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:44:28,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:28,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:44:28,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:44:28,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:44:28,742 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:44:31,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:44:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:33,917 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2022-04-28 10:44:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:44:33,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 29 [2022-04-28 10:44:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:44:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 10:44:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:44:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 10:44:33,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 10:44:33,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:33,986 INFO L225 Difference]: With dead ends: 73 [2022-04-28 10:44:33,986 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 10:44:33,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:44:33,987 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:33,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 10:44:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 10:44:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 10:44:34,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:34,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:44:34,004 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:44:34,004 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:44:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:34,008 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-28 10:44:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-28 10:44:34,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:34,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:34,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-28 10:44:34,009 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-28 10:44:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:34,011 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-28 10:44:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-28 10:44:34,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:34,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:34,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:34,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:44:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-04-28 10:44:34,013 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 29 [2022-04-28 10:44:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:34,014 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-04-28 10:44:34,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:44:34,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 68 transitions. [2022-04-28 10:44:34,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-28 10:44:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:44:34,174 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:34,174 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:34,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:44:34,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 10:44:34,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:34,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:34,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1684913467, now seen corresponding path program 1 times [2022-04-28 10:44:34,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:34,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1034123078] [2022-04-28 10:44:34,383 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:34,383 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1684913467, now seen corresponding path program 2 times [2022-04-28 10:44:34,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:34,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315442094] [2022-04-28 10:44:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:34,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:34,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:44:34,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450312133] [2022-04-28 10:44:34,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:44:34,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:34,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:34,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:44:34,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 10:44:34,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:44:34,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:34,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:44:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:34,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {1596#true} call ULTIMATE.init(); {1596#true} is VALID [2022-04-28 10:44:34,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {1596#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); {1596#true} is VALID [2022-04-28 10:44:34,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-28 10:44:34,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1596#true} {1596#true} #100#return; {1596#true} is VALID [2022-04-28 10:44:34,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {1596#true} call #t~ret5 := main(); {1596#true} is VALID [2022-04-28 10:44:34,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {1596#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1596#true} is VALID [2022-04-28 10:44:34,634 INFO L272 TraceCheckUtils]: 6: Hoare triple {1596#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1596#true} is VALID [2022-04-28 10:44:34,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-28 10:44:34,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-28 10:44:34,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-28 10:44:34,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1596#true} {1596#true} #80#return; {1596#true} is VALID [2022-04-28 10:44:34,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {1596#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 10:44:34,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 10:44:34,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 10:44:34,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 10:44:34,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 10:44:34,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 10:44:34,637 INFO L272 TraceCheckUtils]: 17: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1596#true} is VALID [2022-04-28 10:44:34,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-28 10:44:34,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-28 10:44:34,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-28 10:44:34,638 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1596#true} {1634#(and (= main_~p~0 0) (= main_~h~0 0))} #82#return; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 10:44:34,638 INFO L272 TraceCheckUtils]: 22: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1596#true} is VALID [2022-04-28 10:44:34,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-28 10:44:34,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-28 10:44:34,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-28 10:44:34,639 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1596#true} {1634#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 10:44:34,640 INFO L272 TraceCheckUtils]: 27: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:34,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {1683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:34,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {1687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1597#false} is VALID [2022-04-28 10:44:34,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {1597#false} assume !false; {1597#false} is VALID [2022-04-28 10:44:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:44:34,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:44:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:34,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315442094] [2022-04-28 10:44:34,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:44:34,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450312133] [2022-04-28 10:44:34,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450312133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:34,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:34,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:44:34,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:34,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1034123078] [2022-04-28 10:44:34,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1034123078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:34,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:34,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:44:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094296768] [2022-04-28 10:44:34,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:34,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 31 [2022-04-28 10:44:34,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:34,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:44:34,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:34,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:44:34,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:34,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:44:34,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:44:34,667 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:44:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:42,906 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2022-04-28 10:44:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:44:42,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 31 [2022-04-28 10:44:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:44:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 10:44:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:44:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 10:44:42,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-28 10:44:42,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:42,975 INFO L225 Difference]: With dead ends: 67 [2022-04-28 10:44:42,975 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 10:44:42,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:44:42,976 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:42,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 142 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:44:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 10:44:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-28 10:44:43,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:43,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 10:44:43,016 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 10:44:43,016 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 10:44:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:43,031 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2022-04-28 10:44:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-04-28 10:44:43,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:43,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:43,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 64 states. [2022-04-28 10:44:43,032 INFO L87 Difference]: Start difference. First operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 64 states. [2022-04-28 10:44:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:43,035 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2022-04-28 10:44:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-04-28 10:44:43,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:43,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:43,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:43,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 10:44:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2022-04-28 10:44:43,037 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 31 [2022-04-28 10:44:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:43,038 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2022-04-28 10:44:43,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:44:43,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 85 transitions. [2022-04-28 10:44:43,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-04-28 10:44:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 10:44:43,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:43,397 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:43,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:44:43,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:43,602 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1928736347, now seen corresponding path program 1 times [2022-04-28 10:44:43,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:43,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [870003156] [2022-04-28 10:44:43,605 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:43,605 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:43,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1928736347, now seen corresponding path program 2 times [2022-04-28 10:44:43,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:43,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022590758] [2022-04-28 10:44:43,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:43,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:43,619 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:44:43,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403333595] [2022-04-28 10:44:43,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:44:43,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:43,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:43,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:44:43,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process