/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:34:26,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:34:26,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:34:26,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:34:26,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:34:26,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:34:26,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:34:26,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:34:26,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:34:26,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:34:26,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:34:26,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:34:26,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:34:26,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:34:26,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:34:26,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:34:26,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:34:26,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:34:26,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:34:26,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:34:26,064 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:34:26,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:34:26,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:34:26,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:34:26,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:34:26,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:34:26,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:34:26,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:34:26,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:34:26,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:34:26,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:34:26,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:34:26,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:34:26,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:34:26,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:34:26,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:34:26,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:34:26,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:34:26,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:34:26,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:34:26,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:34:26,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:34:26,081 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 11:34:26,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:34:26,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:34:26,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:34:26,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:34:26,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:34:26,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:34:26,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:34:26,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:34:26,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:34:26,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:34:26,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:34:26,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:34:26,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:34:26,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:34:26,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:34:26,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:34:26,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:34:26,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:34:26,094 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:34:26,094 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:34:26,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:34:26,094 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:34:26,094 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 11:34:26,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:34:26,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:34:26,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:34:26,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:34:26,320 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:34:26,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c [2022-04-28 11:34:26,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cb7f05e/cc034c98fe9f4f51bc437060102ac675/FLAG29fb68ac8 [2022-04-28 11:34:26,665 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:34:26,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c [2022-04-28 11:34:26,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cb7f05e/cc034c98fe9f4f51bc437060102ac675/FLAG29fb68ac8 [2022-04-28 11:34:27,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cb7f05e/cc034c98fe9f4f51bc437060102ac675 [2022-04-28 11:34:27,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:34:27,108 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:34:27,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:34:27,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:34:27,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:34:27,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:34:27" (1/1) ... [2022-04-28 11:34:27,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4100e879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27, skipping insertion in model container [2022-04-28 11:34:27,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:34:27" (1/1) ... [2022-04-28 11:34:27,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:34:27,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:34:27,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c[525,538] [2022-04-28 11:34:27,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:34:27,284 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:34:27,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c[525,538] [2022-04-28 11:34:27,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:34:27,328 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:34:27,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27 WrapperNode [2022-04-28 11:34:27,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:34:27,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:34:27,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:34:27,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:34:27,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27" (1/1) ... [2022-04-28 11:34:27,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27" (1/1) ... [2022-04-28 11:34:27,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27" (1/1) ... [2022-04-28 11:34:27,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27" (1/1) ... [2022-04-28 11:34:27,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27" (1/1) ... [2022-04-28 11:34:27,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27" (1/1) ... [2022-04-28 11:34:27,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27" (1/1) ... [2022-04-28 11:34:27,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:34:27,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:34:27,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:34:27,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:34:27,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27" (1/1) ... [2022-04-28 11:34:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:34:27,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:34:27,403 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 11:34:27,416 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 11:34:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:34:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:34:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:34:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:34:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:34:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:34:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:34:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:34:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:34:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:34:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 11:34:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:34:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:34:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:34:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:34:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:34:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:34:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:34:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:34:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:34:27,474 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:34:27,475 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:34:27,643 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:34:27,648 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:34:27,649 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 11:34:27,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:34:27 BoogieIcfgContainer [2022-04-28 11:34:27,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:34:27,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:34:27,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:34:27,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:34:27,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:34:27" (1/3) ... [2022-04-28 11:34:27,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cabae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:34:27, skipping insertion in model container [2022-04-28 11:34:27,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:34:27" (2/3) ... [2022-04-28 11:34:27,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cabae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:34:27, skipping insertion in model container [2022-04-28 11:34:27,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:34:27" (3/3) ... [2022-04-28 11:34:27,660 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound5.c [2022-04-28 11:34:27,670 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:34:27,670 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:34:27,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:34:27,728 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@4a5a701a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@43a2f2f4 [2022-04-28 11:34:27,728 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:34:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:34:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:34:27,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:34:27,749 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:34:27,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:34:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:34:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-28 11:34:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:34:27,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [860220424] [2022-04-28 11:34:27,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:34:27,785 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 2 times [2022-04-28 11:34:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:34:27,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707199046] [2022-04-28 11:34:27,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:34:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:34:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:34:27,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:34:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:34:27,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(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); {41#true} is VALID [2022-04-28 11:34:27,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:34:27,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-28 11:34:27,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:34:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:34:27,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:34:27,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:34:27,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:34:27,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-28 11:34:27,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 11:34:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:34:28,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:34:28,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:34:28,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:34:28,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-28 11:34:28,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:34:28,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(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); {41#true} is VALID [2022-04-28 11:34:28,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:34:28,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-28 11:34:28,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-28 11:34:28,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-28 11:34:28,007 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 5 then 1 else 0)); {41#true} is VALID [2022-04-28 11:34:28,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:34:28,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:34:28,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:34:28,008 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-28 11:34:28,008 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {41#true} is VALID [2022-04-28 11:34:28,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:34:28,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:34:28,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:34:28,009 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-28 11:34:28,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {42#false} is VALID [2022-04-28 11:34:28,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-28 11:34:28,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-28 11:34:28,010 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#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)); {42#false} is VALID [2022-04-28 11:34:28,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-28 11:34:28,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-28 11:34:28,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-28 11:34:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:34:28,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:34:28,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707199046] [2022-04-28 11:34:28,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707199046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:34:28,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:34:28,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:34:28,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:34:28,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [860220424] [2022-04-28 11:34:28,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [860220424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:34:28,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:34:28,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:34:28,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779063183] [2022-04-28 11:34:28,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:34:28,018 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:34:28,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:34:28,022 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:34:28,042 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 11:34:28,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:34:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:34:28,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:34:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:34:28,069 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:34:35,051 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 11:34:39,565 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 11:34:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:34:39,589 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-28 11:34:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:34:39,589 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:34:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:34:39,590 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:34:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-28 11:34:39,598 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:34:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-28 11:34:39,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-28 11:34:39,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:34:39,749 INFO L225 Difference]: With dead ends: 69 [2022-04-28 11:34:39,749 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 11:34:39,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 11:34:39,756 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:34:39,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 11:34:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 11:34:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 11:34:39,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:34:39,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:34:39,796 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:34:39,797 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:34:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:34:39,801 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-28 11:34:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 11:34:39,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:34:39,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:34:39,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-28 11:34:39,803 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-28 11:34:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:34:39,813 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-28 11:34:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 11:34:39,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:34:39,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:34:39,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:34:39,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:34:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:34:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-28 11:34:39,822 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-28 11:34:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:34:39,822 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-28 11:34:39,823 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:34:39,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 44 transitions. [2022-04-28 11:34:39,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:34:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 11:34:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 11:34:39,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:34:39,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:34:39,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:34:39,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:34:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:34:39,875 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-28 11:34:39,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:34:39,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [667047999] [2022-04-28 11:34:39,878 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:34:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 2 times [2022-04-28 11:34:39,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:34:39,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518732168] [2022-04-28 11:34:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:34:39,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:34:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:34:40,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:34:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:34:40,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(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); {327#true} is VALID [2022-04-28 11:34:40,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 11:34:40,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-28 11:34:40,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:34:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:34:40,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 11:34:40,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 11:34:40,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 11:34:40,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-28 11:34:40,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 11:34:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:34:40,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 11:34:40,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 11:34:40,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 11:34:40,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-28 11:34:40,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:34:40,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(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); {327#true} is VALID [2022-04-28 11:34:40,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 11:34:40,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-28 11:34:40,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret5 := main(); {327#true} is VALID [2022-04-28 11:34:40,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-28 11:34:40,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 5 then 1 else 0)); {327#true} is VALID [2022-04-28 11:34:40,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 11:34:40,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 11:34:40,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 11:34:40,134 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-28 11:34:40,135 INFO L272 TraceCheckUtils]: 11: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {327#true} is VALID [2022-04-28 11:34:40,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 11:34:40,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 11:34:40,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 11:34:40,135 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-28 11:34:40,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {327#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:34:40,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:34:40,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {341#(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 11:34:40,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {341#(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; {341#(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 11:34:40,139 INFO L272 TraceCheckUtils]: 20: Hoare triple {341#(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)); {342#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:34:40,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {342#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {343#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:34:40,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {328#false} is VALID [2022-04-28 11:34:40,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-28 11:34:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:34:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:34:40,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518732168] [2022-04-28 11:34:40,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518732168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:34:40,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:34:40,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:34:40,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:34:40,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [667047999] [2022-04-28 11:34:40,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [667047999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:34:40,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:34:40,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:34:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135422588] [2022-04-28 11:34:40,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:34:40,145 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-28 11:34:40,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:34:40,146 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:34:40,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:34:40,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:34:40,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:34:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:34:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 11:34:40,166 INFO L87 Difference]: Start difference. First operand 33 states and 44 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:34:46,675 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 11:34:48,904 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 11:34:50,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 11:34:52,945 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 11:34:57,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:34:59,992 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 11:35:02,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 11:35:05,080 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 11:35:07,082 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 11:35:09,704 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 11:35:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:11,325 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2022-04-28 11:35:11,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:35:11,325 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-28 11:35:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:35:11,325 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:35:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-04-28 11:35:11,329 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:35:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-04-28 11:35:11,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 97 transitions. [2022-04-28 11:35:11,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:11,494 INFO L225 Difference]: With dead ends: 67 [2022-04-28 11:35:11,494 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 11:35:11,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 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 11:35:11,497 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 45 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:35:11,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 54 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 183 Invalid, 9 Unknown, 0 Unchecked, 24.4s Time] [2022-04-28 11:35:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 11:35:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-28 11:35:11,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:35:11,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:35:11,521 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:35:11,522 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:35:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:11,525 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-28 11:35:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-04-28 11:35:11,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:11,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:11,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 49 states. [2022-04-28 11:35:11,526 INFO L87 Difference]: Start difference. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 49 states. [2022-04-28 11:35:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:11,529 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-28 11:35:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-04-28 11:35:11,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:11,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:11,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:35:11,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:35:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:35:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-28 11:35:11,533 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 24 [2022-04-28 11:35:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:35:11,533 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-28 11:35:11,534 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:35:11,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-28 11:35:11,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-28 11:35:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 11:35:11,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:35:11,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:35:11,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:35:11,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:35:11,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:35:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-28 11:35:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:35:11,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476762940] [2022-04-28 11:35:11,715 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:35:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 2 times [2022-04-28 11:35:11,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:35:11,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373442912] [2022-04-28 11:35:11,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:35:11,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:35:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:35:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:35:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:35:11,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {700#(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); {683#true} is VALID [2022-04-28 11:35:11,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 11:35:11,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {683#true} {683#true} #103#return; {683#true} is VALID [2022-04-28 11:35:11,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:35:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:35:11,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-28 11:35:11,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-28 11:35:11,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 11:35:11,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #81#return; {683#true} is VALID [2022-04-28 11:35:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 11:35:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:35:11,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-28 11:35:11,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-28 11:35:11,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 11:35:11,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #83#return; {683#true} is VALID [2022-04-28 11:35:11,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:35:11,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {700#(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); {683#true} is VALID [2022-04-28 11:35:11,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 11:35:11,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #103#return; {683#true} is VALID [2022-04-28 11:35:11,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret5 := main(); {683#true} is VALID [2022-04-28 11:35:11,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {683#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {683#true} is VALID [2022-04-28 11:35:11,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {683#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 5 then 1 else 0)); {683#true} is VALID [2022-04-28 11:35:11,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-28 11:35:11,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-28 11:35:11,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 11:35:11,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {683#true} {683#true} #81#return; {683#true} is VALID [2022-04-28 11:35:11,885 INFO L272 TraceCheckUtils]: 11: Hoare triple {683#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {683#true} is VALID [2022-04-28 11:35:11,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-28 11:35:11,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-28 11:35:11,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 11:35:11,886 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {683#true} {683#true} #83#return; {683#true} is VALID [2022-04-28 11:35:11,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {683#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 11:35:11,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 11:35:11,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 11:35:11,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 11:35:11,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {697#(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 11:35:11,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {697#(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; {697#(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 11:35:11,890 INFO L272 TraceCheckUtils]: 22: Hoare triple {697#(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)); {698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:11,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {698#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {699#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:35:11,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {699#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {684#false} is VALID [2022-04-28 11:35:11,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {684#false} assume !false; {684#false} is VALID [2022-04-28 11:35:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 11:35:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:35:11,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373442912] [2022-04-28 11:35:11,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373442912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:35:11,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:35:11,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:35:11,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:35:11,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476762940] [2022-04-28 11:35:11,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476762940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:35:11,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:35:11,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:35:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669165273] [2022-04-28 11:35:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:35:11,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-28 11:35:11,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:35:11,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:35:11,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:11,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:35:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:35:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:35:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 11:35:11,908 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:35:15,421 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 11:35:22,630 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 11:35:33,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 11:35:35,437 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 11:35:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:35,865 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2022-04-28 11:35:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:35:35,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-28 11:35:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:35:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:35:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-28 11:35:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:35:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-28 11:35:35,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 91 transitions. [2022-04-28 11:35:36,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:36,391 INFO L225 Difference]: With dead ends: 76 [2022-04-28 11:35:36,391 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 11:35:36,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 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 11:35:36,392 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 87 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:35:36,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 48 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 223 Invalid, 4 Unknown, 0 Unchecked, 11.3s Time] [2022-04-28 11:35:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 11:35:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-04-28 11:35:36,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:35:36,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:35:36,414 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:35:36,414 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:35:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:36,418 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2022-04-28 11:35:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2022-04-28 11:35:36,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:36,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:36,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 70 states. [2022-04-28 11:35:36,420 INFO L87 Difference]: Start difference. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 70 states. [2022-04-28 11:35:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:36,423 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2022-04-28 11:35:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2022-04-28 11:35:36,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:36,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:36,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:35:36,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:35:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:35:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-28 11:35:36,427 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26 [2022-04-28 11:35:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:35:36,427 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-28 11:35:36,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 11:35:36,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 88 transitions. [2022-04-28 11:35:36,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-28 11:35:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 11:35:36,797 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:35:36,797 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:35:36,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 11:35:36,797 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:35:36,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:35:36,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-28 11:35:36,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:35:36,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1405604507] [2022-04-28 11:35:36,798 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:35:36,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 2 times [2022-04-28 11:35:36,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:35:36,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035841158] [2022-04-28 11:35:36,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:35:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:35:36,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:35:36,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318822676] [2022-04-28 11:35:36,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:35:36,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:35:36,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:35:36,818 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 11:35:36,821 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 11:35:36,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:35:36,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:35:36,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:35:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:35:36,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:35:37,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {1131#true} call ULTIMATE.init(); {1131#true} is VALID [2022-04-28 11:35:37,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {1131#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); {1131#true} is VALID [2022-04-28 11:35:37,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 11:35:37,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1131#true} {1131#true} #103#return; {1131#true} is VALID [2022-04-28 11:35:37,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {1131#true} call #t~ret5 := main(); {1131#true} is VALID [2022-04-28 11:35:37,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {1131#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1131#true} is VALID [2022-04-28 11:35:37,176 INFO L272 TraceCheckUtils]: 6: Hoare triple {1131#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 5 then 1 else 0)); {1131#true} is VALID [2022-04-28 11:35:37,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-28 11:35:37,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-28 11:35:37,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 11:35:37,177 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1131#true} {1131#true} #81#return; {1131#true} is VALID [2022-04-28 11:35:37,177 INFO L272 TraceCheckUtils]: 11: Hoare triple {1131#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1131#true} is VALID [2022-04-28 11:35:37,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-28 11:35:37,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-28 11:35:37,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 11:35:37,177 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1131#true} {1131#true} #83#return; {1131#true} is VALID [2022-04-28 11:35:37,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {1131#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 11:35:37,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 11:35:37,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 11:35:37,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 11:35:37,180 INFO L272 TraceCheckUtils]: 20: Hoare triple {1184#(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)); {1131#true} is VALID [2022-04-28 11:35:37,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-28 11:35:37,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-28 11:35:37,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 11:35:37,181 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1131#true} {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 11:35:37,181 INFO L272 TraceCheckUtils]: 25: Hoare triple {1184#(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)); {1131#true} is VALID [2022-04-28 11:35:37,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-28 11:35:37,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-28 11:35:37,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 11:35:37,182 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1131#true} {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1184#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 11:35:37,183 INFO L272 TraceCheckUtils]: 30: Hoare triple {1184#(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)); {1227#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:35:37,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {1227#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:37,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {1231#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1132#false} is VALID [2022-04-28 11:35:37,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {1132#false} assume !false; {1132#false} is VALID [2022-04-28 11:35:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 11:35:37,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:35:37,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:35:37,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035841158] [2022-04-28 11:35:37,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:35:37,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318822676] [2022-04-28 11:35:37,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318822676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:35:37,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:35:37,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:35:37,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:35:37,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1405604507] [2022-04-28 11:35:37,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1405604507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:35:37,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:35:37,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:35:37,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927372210] [2022-04-28 11:35:37,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:35:37,186 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 11:35:37,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:35:37,187 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:35:37,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:37,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:35:37,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:35:37,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:35:37,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:35:37,209 INFO L87 Difference]: Start difference. First operand 63 states and 88 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:35:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:42,608 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-28 11:35:42,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:35:42,609 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 11:35:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:35:42,609 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:35:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:35:42,611 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:35:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:35:42,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:35:42,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:42,670 INFO L225 Difference]: With dead ends: 74 [2022-04-28 11:35:42,670 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 11:35:42,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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 11:35:42,673 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:35:42,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 146 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 11:35:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 11:35:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 11:35:42,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:35:42,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:35:42,696 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:35:42,696 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:35:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:42,699 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 11:35:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 11:35:42,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:42,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:42,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-28 11:35:42,700 INFO L87 Difference]: Start difference. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-28 11:35:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:42,702 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 11:35:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 11:35:42,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:42,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:42,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:35:42,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:35:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:35:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-28 11:35:42,705 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34 [2022-04-28 11:35:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:35:42,705 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-28 11:35:42,706 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:35:42,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 70 transitions. [2022-04-28 11:35:42,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 11:35:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 11:35:42,906 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:35:42,906 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:35:42,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 11:35:43,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:35:43,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:35:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:35:43,114 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-28 11:35:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:35:43,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1496060996] [2022-04-28 11:35:43,114 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:35:43,114 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 2 times [2022-04-28 11:35:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:35:43,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933137716] [2022-04-28 11:35:43,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:35:43,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:35:43,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:35:43,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820901449] [2022-04-28 11:35:43,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:35:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:35:43,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:35:43,126 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 11:35:43,139 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 11:35:43,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:35:43,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:35:43,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:35:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:35:43,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:35:43,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {1591#true} call ULTIMATE.init(); {1591#true} is VALID [2022-04-28 11:35:43,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1591#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); {1591#true} is VALID [2022-04-28 11:35:43,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {1591#true} assume true; {1591#true} is VALID [2022-04-28 11:35:43,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1591#true} {1591#true} #103#return; {1591#true} is VALID [2022-04-28 11:35:43,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {1591#true} call #t~ret5 := main(); {1591#true} is VALID [2022-04-28 11:35:43,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {1591#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1591#true} is VALID [2022-04-28 11:35:43,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {1591#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 5 then 1 else 0)); {1591#true} is VALID [2022-04-28 11:35:43,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {1591#true} ~cond := #in~cond; {1591#true} is VALID [2022-04-28 11:35:43,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {1591#true} assume !(0 == ~cond); {1591#true} is VALID [2022-04-28 11:35:43,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {1591#true} assume true; {1591#true} is VALID [2022-04-28 11:35:43,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1591#true} {1591#true} #81#return; {1591#true} is VALID [2022-04-28 11:35:43,396 INFO L272 TraceCheckUtils]: 11: Hoare triple {1591#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1591#true} is VALID [2022-04-28 11:35:43,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {1591#true} ~cond := #in~cond; {1591#true} is VALID [2022-04-28 11:35:43,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {1591#true} assume !(0 == ~cond); {1591#true} is VALID [2022-04-28 11:35:43,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {1591#true} assume true; {1591#true} is VALID [2022-04-28 11:35:43,397 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1591#true} {1591#true} #83#return; {1591#true} is VALID [2022-04-28 11:35:43,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {1591#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1644#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 11:35:43,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {1644#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1644#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 11:35:43,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {1644#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1644#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 11:35:43,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {1644#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1644#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 11:35:43,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {1644#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1644#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 11:35:43,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {1644#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1644#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 11:35:43,399 INFO L272 TraceCheckUtils]: 22: Hoare triple {1644#(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)); {1591#true} is VALID [2022-04-28 11:35:43,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {1591#true} ~cond := #in~cond; {1591#true} is VALID [2022-04-28 11:35:43,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {1591#true} assume !(0 == ~cond); {1591#true} is VALID [2022-04-28 11:35:43,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {1591#true} assume true; {1591#true} is VALID [2022-04-28 11:35:43,400 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1591#true} {1644#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1644#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 11:35:43,401 INFO L272 TraceCheckUtils]: 27: Hoare triple {1644#(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)); {1591#true} is VALID [2022-04-28 11:35:43,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {1591#true} ~cond := #in~cond; {1591#true} is VALID [2022-04-28 11:35:43,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {1591#true} assume !(0 == ~cond); {1591#true} is VALID [2022-04-28 11:35:43,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {1591#true} assume true; {1591#true} is VALID [2022-04-28 11:35:43,402 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1591#true} {1644#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1644#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 11:35:43,403 INFO L272 TraceCheckUtils]: 32: Hoare triple {1644#(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)); {1693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:35:43,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {1693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:43,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {1697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1592#false} is VALID [2022-04-28 11:35:43,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {1592#false} assume !false; {1592#false} is VALID [2022-04-28 11:35:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 11:35:43,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:35:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:35:43,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933137716] [2022-04-28 11:35:43,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:35:43,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820901449] [2022-04-28 11:35:43,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820901449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:35:43,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:35:43,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:35:43,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:35:43,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1496060996] [2022-04-28 11:35:43,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1496060996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:35:43,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:35:43,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:35:43,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519116125] [2022-04-28 11:35:43,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:35:43,406 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 11:35:43,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:35:43,406 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:35:43,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:43,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:35:43,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:35:43,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:35:43,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:35:43,429 INFO L87 Difference]: Start difference. First operand 51 states and 70 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:35:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:46,856 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-04-28 11:35:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:35:46,857 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 11:35:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:35:46,858 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:35:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 11:35:46,861 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:35:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 11:35:46,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 11:35:46,943 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 11:35:46,944 INFO L225 Difference]: With dead ends: 68 [2022-04-28 11:35:46,945 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 11:35:46,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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 11:35:46,956 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 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 11:35:46,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 11:35:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 11:35:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 11:35:47,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:35:47,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 11:35:47,002 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 11:35:47,005 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 11:35:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:47,009 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 11:35:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 11:35:47,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:47,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:47,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-28 11:35:47,010 INFO L87 Difference]: Start difference. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-28 11:35:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:47,013 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 11:35:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 11:35:47,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:47,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:47,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:35:47,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:35:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 11:35:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-04-28 11:35:47,019 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2022-04-28 11:35:47,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:35:47,020 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-04-28 11:35:47,021 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:35:47,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 87 transitions. [2022-04-28 11:35:47,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 11:35:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 11:35:47,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:35:47,422 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:35:47,427 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 11:35:47,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:35:47,623 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:35:47,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:35:47,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-28 11:35:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:35:47,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994553881] [2022-04-28 11:35:47,624 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:35:47,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 2 times [2022-04-28 11:35:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:35:47,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329430682] [2022-04-28 11:35:47,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:35:47,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:35:47,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:35:47,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696255701] [2022-04-28 11:35:47,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:35:47,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:35:47,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:35:47,643 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 11:35:47,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process