/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:52:58,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:52:58,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:52:58,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:52:58,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:52:58,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:52:58,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:52:58,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:52:58,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:52:58,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:52:58,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:52:58,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:52:58,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:52:58,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:52:58,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:52:58,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:52:58,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:52:58,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:52:58,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:52:58,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:52:58,137 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:52:58,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:52:58,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:52:58,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:52:58,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:52:58,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:52:58,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:52:58,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:52:58,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:52:58,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:52:58,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:52:58,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:52:58,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:52:58,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:52:58,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:52:58,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:52:58,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:52:58,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:52:58,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:52:58,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:52:58,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:52:58,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:52:58,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:52:58,165 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:52:58,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:52:58,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:52:58,166 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:52:58,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:52:58,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:52:58,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:52:58,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:52:58,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:52:58,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:52:58,167 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:52:58,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:52:58,167 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:52:58,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:52:58,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:52:58,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:52:58,168 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:52:58,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:52:58,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:52:58,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:52:58,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:52:58,168 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:52:58,168 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:52:58,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:52:58,168 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:52:58,168 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:52:58,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:52:58,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:52:58,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:52:58,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:52:58,412 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:52:58,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound20.c [2022-04-28 04:52:58,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30b4d5fb/dbc2c85118bb45caa332a3096688b1d8/FLAGb38dab626 [2022-04-28 04:52:58,812 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:52:58,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound20.c [2022-04-28 04:52:58,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30b4d5fb/dbc2c85118bb45caa332a3096688b1d8/FLAGb38dab626 [2022-04-28 04:52:59,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30b4d5fb/dbc2c85118bb45caa332a3096688b1d8 [2022-04-28 04:52:59,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:52:59,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:52:59,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:52:59,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:52:59,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:52:59,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:52:59" (1/1) ... [2022-04-28 04:52:59,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258ff8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59, skipping insertion in model container [2022-04-28 04:52:59,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:52:59" (1/1) ... [2022-04-28 04:52:59,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:52:59,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:52:59,383 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_valuebound20.c[525,538] [2022-04-28 04:52:59,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:52:59,435 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:52:59,442 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_valuebound20.c[525,538] [2022-04-28 04:52:59,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:52:59,462 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:52:59,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59 WrapperNode [2022-04-28 04:52:59,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:52:59,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:52:59,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:52:59,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:52:59,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59" (1/1) ... [2022-04-28 04:52:59,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59" (1/1) ... [2022-04-28 04:52:59,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59" (1/1) ... [2022-04-28 04:52:59,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59" (1/1) ... [2022-04-28 04:52:59,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59" (1/1) ... [2022-04-28 04:52:59,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59" (1/1) ... [2022-04-28 04:52:59,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59" (1/1) ... [2022-04-28 04:52:59,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:52:59,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:52:59,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:52:59,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:52:59,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59" (1/1) ... [2022-04-28 04:52:59,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:52:59,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:52:59,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:52:59,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:52:59,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:52:59,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:52:59,551 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:52:59,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:52:59,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:52:59,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:52:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:52:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:52:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:52:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:52:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 04:52:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:52:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:52:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:52:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:52:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:52:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:52:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:52:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:52:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:52:59,605 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:52:59,606 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:52:59,803 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:52:59,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:52:59,825 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:52:59,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:52:59 BoogieIcfgContainer [2022-04-28 04:52:59,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:52:59,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:52:59,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:52:59,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:52:59,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:52:59" (1/3) ... [2022-04-28 04:52:59,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4973cf74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:52:59, skipping insertion in model container [2022-04-28 04:52:59,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:59" (2/3) ... [2022-04-28 04:52:59,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4973cf74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:52:59, skipping insertion in model container [2022-04-28 04:52:59,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:52:59" (3/3) ... [2022-04-28 04:52:59,848 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound20.c [2022-04-28 04:52:59,858 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:52:59,858 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:52:59,926 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:52:59,932 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@613be381, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d1963d1 [2022-04-28 04:52:59,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:52:59,940 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 04:52:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:52:59,945 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:52:59,945 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 04:52:59,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:52:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:52:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-28 04:52:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:59,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1986255583] [2022-04-28 04:52:59,973 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:52:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 2 times [2022-04-28 04:52:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:52:59,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334655369] [2022-04-28 04:52:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:52:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:00,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:53:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:00,170 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 04:53:00,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 04:53:00,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-28 04:53:00,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:53:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:00,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:53:00,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:53:00,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:53:00,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-28 04:53:00,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 04:53:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:00,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:53:00,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:53:00,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:53:00,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-28 04:53:00,216 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 04:53:00,216 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 04:53:00,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 04:53:00,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-28 04:53:00,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-28 04:53:00,217 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 04:53:00,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 20 then 1 else 0)); {41#true} is VALID [2022-04-28 04:53:00,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:53:00,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:53:00,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:53:00,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-28 04:53:00,218 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 04:53:00,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:53:00,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:53:00,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:53:00,219 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-28 04:53:00,219 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 04:53:00,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-28 04:53:00,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-28 04:53:00,220 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 04:53:00,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-28 04:53:00,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-28 04:53:00,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-28 04:53:00,221 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 04:53:00,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:00,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334655369] [2022-04-28 04:53:00,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334655369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:00,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:00,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:53:00,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:00,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1986255583] [2022-04-28 04:53:00,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1986255583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:00,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:00,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:53:00,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910087637] [2022-04-28 04:53:00,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:00,229 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 04:53:00,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:00,232 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 04:53:00,264 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 04:53:00,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:53:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:00,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:53:00,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:53:00,287 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 04:53:02,434 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 04:53:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:02,720 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-28 04:53:02,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:53:02,720 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 04:53:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:02,721 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 04:53:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-28 04:53:02,738 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 04:53:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-28 04:53:02,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-28 04:53:02,945 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 04:53:02,952 INFO L225 Difference]: With dead ends: 69 [2022-04-28 04:53:02,952 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 04:53:02,954 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 04:53:02,956 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:02,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 04:53:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 04:53:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 04:53:02,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:02,979 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 04:53:02,979 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 04:53:02,980 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 04:53:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:02,984 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-28 04:53:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 04:53:02,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:02,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:02,986 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 04:53:02,986 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 04:53:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:02,990 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-28 04:53:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 04:53:02,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:02,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:02,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:02,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:02,992 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 04:53:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-28 04:53:02,996 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-28 04:53:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:02,996 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-28 04:53:02,997 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 04:53:02,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 44 transitions. [2022-04-28 04:53:03,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 04:53:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:53:03,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:03,044 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 04:53:03,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:53:03,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:03,045 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-28 04:53:03,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:03,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [616032407] [2022-04-28 04:53:03,046 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:53:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 2 times [2022-04-28 04:53:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:03,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961066816] [2022-04-28 04:53:03,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:03,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:03,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:53:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:03,294 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 04:53:03,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:03,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-28 04:53:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:53:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:03,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:53:03,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:53:03,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:03,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-28 04:53:03,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 04:53:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:03,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:53:03,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:53:03,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:03,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-28 04:53:03,313 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 04:53:03,313 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 04:53:03,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:03,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-28 04:53:03,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret5 := main(); {327#true} is VALID [2022-04-28 04:53:03,317 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 04:53:03,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 20 then 1 else 0)); {327#true} is VALID [2022-04-28 04:53:03,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:53:03,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:53:03,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:03,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-28 04:53:03,319 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 04:53:03,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:53:03,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:53:03,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:03,320 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-28 04:53:03,321 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 04:53:03,322 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 04:53:03,322 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 04:53:03,323 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 04:53:03,324 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 04:53:03,324 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 04:53:03,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {328#false} is VALID [2022-04-28 04:53:03,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-28 04:53:03,326 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 04:53:03,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:03,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961066816] [2022-04-28 04:53:03,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961066816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:03,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:03,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:53:03,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:03,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [616032407] [2022-04-28 04:53:03,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [616032407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:03,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:03,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:53:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191402901] [2022-04-28 04:53:03,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:03,330 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 04:53:03,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:03,331 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 04:53:03,346 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 04:53:03,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:53:03,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:03,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:53:03,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:53:03,347 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 04:53:13,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:53:15,813 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 04:53:22,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:53:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:22,790 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-28 04:53:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:53:22,790 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 04:53:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:22,791 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 04:53:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-28 04:53:22,794 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 04:53:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-28 04:53:22,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2022-04-28 04:53:22,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:22,972 INFO L225 Difference]: With dead ends: 68 [2022-04-28 04:53:22,972 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 04:53:22,973 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 04:53:22,974 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:22,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 56 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 206 Invalid, 2 Unknown, 0 Unchecked, 11.6s Time] [2022-04-28 04:53:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 04:53:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 04:53:22,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:22,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:22,996 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:22,996 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:22,999 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-28 04:53:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-28 04:53:23,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:23,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:23,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-28 04:53:23,001 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-28 04:53:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:23,003 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-28 04:53:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-28 04:53:23,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:23,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:23,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:23,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-28 04:53:23,007 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-28 04:53:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:23,007 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-28 04:53:23,007 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 04:53:23,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 65 transitions. [2022-04-28 04:53:23,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-28 04:53:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 04:53:23,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:23,171 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 04:53:23,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:53:23,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-28 04:53:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:23,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433254852] [2022-04-28 04:53:23,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:53:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 2 times [2022-04-28 04:53:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:23,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815152912] [2022-04-28 04:53:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:23,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:23,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:53:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:23,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {702#(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); {685#true} is VALID [2022-04-28 04:53:23,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:23,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #103#return; {685#true} is VALID [2022-04-28 04:53:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:53:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:23,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:53:23,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:53:23,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:23,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #81#return; {685#true} is VALID [2022-04-28 04:53:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 04:53:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:23,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:53:23,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:53:23,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:23,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #83#return; {685#true} is VALID [2022-04-28 04:53:23,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:53:23,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#(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); {685#true} is VALID [2022-04-28 04:53:23,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:23,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #103#return; {685#true} is VALID [2022-04-28 04:53:23,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2022-04-28 04:53:23,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {685#true} is VALID [2022-04-28 04:53:23,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {685#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 20 then 1 else 0)); {685#true} is VALID [2022-04-28 04:53:23,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:53:23,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:53:23,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:23,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {685#true} {685#true} #81#return; {685#true} is VALID [2022-04-28 04:53:23,293 INFO L272 TraceCheckUtils]: 11: Hoare triple {685#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {685#true} is VALID [2022-04-28 04:53:23,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:53:23,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:53:23,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:23,294 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {685#true} {685#true} #83#return; {685#true} is VALID [2022-04-28 04:53:23,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {685#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:23,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:23,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:23,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:23,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {699#(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 04:53:23,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {699#(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; {699#(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 04:53:23,300 INFO L272 TraceCheckUtils]: 22: Hoare triple {699#(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)); {700#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:53:23,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {700#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {701#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:53:23,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {701#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {686#false} is VALID [2022-04-28 04:53:23,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {686#false} assume !false; {686#false} is VALID [2022-04-28 04:53:23,301 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 04:53:23,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:23,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815152912] [2022-04-28 04:53:23,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815152912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:23,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:23,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:53:23,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:23,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433254852] [2022-04-28 04:53:23,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433254852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:23,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:23,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:53:23,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809988271] [2022-04-28 04:53:23,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:23,303 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 04:53:23,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:23,303 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 04:53:23,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:23,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:53:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:53:23,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:53:23,319 INFO L87 Difference]: Start difference. First operand 48 states and 65 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 04:53:28,485 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 04:53:49,345 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 04:53:54,898 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 04:53:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:54,967 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-04-28 04:53:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:53:54,967 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 04:53:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:54,967 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 04:53:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-28 04:53:54,970 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 04:53:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-28 04:53:54,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 91 transitions. [2022-04-28 04:53:55,250 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 04:53:55,252 INFO L225 Difference]: With dead ends: 77 [2022-04-28 04:53:55,253 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 04:53:55,253 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 04:53:55,254 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 80 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:55,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 225 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2022-04-28 04:53:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 04:53:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2022-04-28 04:53:55,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:55,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 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 04:53:55,295 INFO L74 IsIncluded]: Start isIncluded. First operand 71 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 04:53:55,296 INFO L87 Difference]: Start difference. First operand 71 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 04:53:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:55,299 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-28 04:53:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-28 04:53:55,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:55,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:55,301 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 71 states. [2022-04-28 04:53:55,301 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 71 states. [2022-04-28 04:53:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:55,304 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-28 04:53:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-28 04:53:55,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:55,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:55,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:55,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:55,306 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 04:53:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-28 04:53:55,318 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26 [2022-04-28 04:53:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:55,318 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-28 04:53:55,318 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 04:53:55,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 88 transitions. [2022-04-28 04:53:55,664 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 04:53:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-28 04:53:55,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 04:53:55,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:55,666 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 04:53:55,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:53:55,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:55,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-28 04:53:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:55,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [425252452] [2022-04-28 04:53:55,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:53:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 2 times [2022-04-28 04:53:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:55,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497009425] [2022-04-28 04:53:55,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:55,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:55,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:53:55,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546742618] [2022-04-28 04:53:55,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:55,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:55,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:55,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:53:55,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:53:55,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:53:55,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:53:55,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:53:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:55,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:53:56,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-28 04:53:56,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#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); {1137#true} is VALID [2022-04-28 04:53:56,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-28 04:53:56,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1137#true} {1137#true} #103#return; {1137#true} is VALID [2022-04-28 04:53:56,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {1137#true} call #t~ret5 := main(); {1137#true} is VALID [2022-04-28 04:53:56,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {1137#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1137#true} is VALID [2022-04-28 04:53:56,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {1137#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 20 then 1 else 0)); {1137#true} is VALID [2022-04-28 04:53:56,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-28 04:53:56,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-28 04:53:56,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-28 04:53:56,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1137#true} #81#return; {1137#true} is VALID [2022-04-28 04:53:56,070 INFO L272 TraceCheckUtils]: 11: Hoare triple {1137#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-28 04:53:56,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-28 04:53:56,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-28 04:53:56,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-28 04:53:56,070 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1137#true} {1137#true} #83#return; {1137#true} is VALID [2022-04-28 04:53:56,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {1137#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:56,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:56,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:56,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:56,085 INFO L272 TraceCheckUtils]: 20: Hoare triple {1190#(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)); {1137#true} is VALID [2022-04-28 04:53:56,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-28 04:53:56,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-28 04:53:56,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-28 04:53:56,086 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1137#true} {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:56,086 INFO L272 TraceCheckUtils]: 25: Hoare triple {1190#(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)); {1137#true} is VALID [2022-04-28 04:53:56,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-28 04:53:56,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-28 04:53:56,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-28 04:53:56,087 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1137#true} {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1190#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:56,087 INFO L272 TraceCheckUtils]: 30: Hoare triple {1190#(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)); {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:53:56,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:53:56,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {1237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1138#false} is VALID [2022-04-28 04:53:56,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-28 04:53:56,089 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 04:53:56,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:53:56,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:56,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497009425] [2022-04-28 04:53:56,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:53:56,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546742618] [2022-04-28 04:53:56,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546742618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:56,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:56,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:56,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:56,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [425252452] [2022-04-28 04:53:56,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [425252452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:56,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:56,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327657053] [2022-04-28 04:53:56,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:56,091 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 04:53:56,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:56,091 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 04:53:56,124 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 04:53:56,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:53:56,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:56,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:53:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:53:56,126 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 04:54:10,280 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 04:54:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:10,317 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-28 04:54:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:54:10,318 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 04:54:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:54:10,318 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 04:54:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 04:54:10,319 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 04:54:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 04:54:10,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 04:54:10,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:10,391 INFO L225 Difference]: With dead ends: 74 [2022-04-28 04:54:10,391 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:54:10,392 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 04:54:10,392 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:54:10,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 04:54:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:54:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 04:54:10,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:54:10,411 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 04:54:10,411 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 04:54:10,412 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 04:54:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:10,414 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 04:54:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:54:10,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:10,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:10,415 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 04:54:10,415 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 04:54:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:10,417 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 04:54:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:54:10,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:10,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:10,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:54:10,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:54:10,418 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 04:54:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-28 04:54:10,420 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34 [2022-04-28 04:54:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:54:10,420 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-28 04:54:10,421 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 04:54:10,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 70 transitions. [2022-04-28 04:54:10,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:54:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 04:54:10,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:54:10,622 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 04:54:10,633 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 04:54:10,822 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 04:54:10,823 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:54:10,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:54:10,823 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-28 04:54:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:10,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1933018973] [2022-04-28 04:54:10,824 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:54:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 2 times [2022-04-28 04:54:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:54:10,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633310370] [2022-04-28 04:54:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:54:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:54:10,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:54:10,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005347767] [2022-04-28 04:54:10,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:54:10,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:54:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:54:10,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:54:10,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 04:54:10,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:54:10,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:54:11,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:54:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:54:11,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:54:11,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} call ULTIMATE.init(); {1597#true} is VALID [2022-04-28 04:54:11,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#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); {1597#true} is VALID [2022-04-28 04:54:11,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-28 04:54:11,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1597#true} {1597#true} #103#return; {1597#true} is VALID [2022-04-28 04:54:11,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {1597#true} call #t~ret5 := main(); {1597#true} is VALID [2022-04-28 04:54:11,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {1597#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1597#true} is VALID [2022-04-28 04:54:11,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {1597#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 20 then 1 else 0)); {1597#true} is VALID [2022-04-28 04:54:11,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {1597#true} ~cond := #in~cond; {1597#true} is VALID [2022-04-28 04:54:11,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {1597#true} assume !(0 == ~cond); {1597#true} is VALID [2022-04-28 04:54:11,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-28 04:54:11,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1597#true} {1597#true} #81#return; {1597#true} is VALID [2022-04-28 04:54:11,232 INFO L272 TraceCheckUtils]: 11: Hoare triple {1597#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1597#true} is VALID [2022-04-28 04:54:11,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {1597#true} ~cond := #in~cond; {1597#true} is VALID [2022-04-28 04:54:11,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {1597#true} assume !(0 == ~cond); {1597#true} is VALID [2022-04-28 04:54:11,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-28 04:54:11,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1597#true} {1597#true} #83#return; {1597#true} is VALID [2022-04-28 04:54:11,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {1597#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1650#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:11,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {1650#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1650#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:11,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {1650#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1650#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:11,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {1650#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1650#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:11,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {1650#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1650#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:11,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {1650#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1650#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:11,235 INFO L272 TraceCheckUtils]: 22: Hoare triple {1650#(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)); {1597#true} is VALID [2022-04-28 04:54:11,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {1597#true} ~cond := #in~cond; {1597#true} is VALID [2022-04-28 04:54:11,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {1597#true} assume !(0 == ~cond); {1597#true} is VALID [2022-04-28 04:54:11,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-28 04:54:11,236 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1597#true} {1650#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1650#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:11,236 INFO L272 TraceCheckUtils]: 27: Hoare triple {1650#(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)); {1597#true} is VALID [2022-04-28 04:54:11,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {1597#true} ~cond := #in~cond; {1597#true} is VALID [2022-04-28 04:54:11,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {1597#true} assume !(0 == ~cond); {1597#true} is VALID [2022-04-28 04:54:11,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-28 04:54:11,237 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1597#true} {1650#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1650#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:11,237 INFO L272 TraceCheckUtils]: 32: Hoare triple {1650#(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)); {1699#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:54:11,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {1699#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1703#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:54:11,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {1703#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1598#false} is VALID [2022-04-28 04:54:11,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {1598#false} assume !false; {1598#false} is VALID [2022-04-28 04:54:11,238 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 04:54:11,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:54:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:54:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633310370] [2022-04-28 04:54:11,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:54:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005347767] [2022-04-28 04:54:11,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005347767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:54:11,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:54:11,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:54:11,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:54:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1933018973] [2022-04-28 04:54:11,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1933018973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:54:11,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:54:11,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:54:11,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287297540] [2022-04-28 04:54:11,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:54:11,240 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 04:54:11,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:54:11,241 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 04:54:11,259 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 04:54:11,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:54:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:11,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:54:11,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:54:11,260 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 04:54:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:23,453 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-04-28 04:54:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:54:23,453 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 04:54:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:54:23,454 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 04:54:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 04:54:23,455 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 04:54:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 04:54:23,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 04:54:23,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:23,522 INFO L225 Difference]: With dead ends: 68 [2022-04-28 04:54:23,522 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 04:54:23,523 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 04:54:23,524 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:54:23,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 04:54:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 04:54:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 04:54:23,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:54:23,550 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 04:54:23,550 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 04:54:23,551 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 04:54:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:23,554 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 04:54:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 04:54:23,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:23,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:23,555 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 04:54:23,555 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 04:54:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:23,558 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 04:54:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 04:54:23,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:23,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:23,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:54:23,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:54:23,559 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 04:54:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-04-28 04:54:23,562 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2022-04-28 04:54:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:54:23,562 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-04-28 04:54:23,562 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 04:54:23,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 87 transitions. [2022-04-28 04:54:23,988 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 04:54:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 04:54:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 04:54:23,990 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:54:23,990 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 04:54:24,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 04:54:24,190 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 04:54:24,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:54:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:54:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-28 04:54:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:24,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [187107645] [2022-04-28 04:54:24,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:54:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 2 times [2022-04-28 04:54:24,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:54:24,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022456623] [2022-04-28 04:54:24,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:54:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:54:24,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:54:24,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587010677] [2022-04-28 04:54:24,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:54:24,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:54:24,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:54:24,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:54:24,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process