/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_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:56:53,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:56:53,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:56:53,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:56:53,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:56:53,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:56:53,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:56:53,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:56:53,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:56:53,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:56:53,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:56:53,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:56:53,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:56:53,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:56:53,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:56:53,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:56:53,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:56:53,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:56:53,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:56:53,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:56:53,246 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:56:53,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:56:53,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:56:53,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:56:53,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:56:53,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:56:53,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:56:53,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:56:53,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:56:53,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:56:53,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:56:53,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:56:53,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:56:53,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:56:53,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:56:53,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:56:53,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:56:53,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:56:53,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:56:53,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:56:53,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:56:53,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:56:53,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:56:53,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:56:53,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:56:53,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:56:53,276 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:56:53,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:56:53,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:56:53,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:56:53,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:56:53,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:56:53,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:56:53,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:56:53,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:56:53,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:56:53,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:56:53,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:56:53,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:56:53,278 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:56:53,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:56:53,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:56:53,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:56:53,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:56:53,279 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:56:53,279 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:56:53,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:56:53,279 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:56:53,279 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:56:53,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:56:53,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:56:53,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:56:53,521 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:56:53,521 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:56:53,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c [2022-04-15 07:56:53,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db94b40e5/daf01ea5a1a44756bdb58d1374263d3b/FLAGdeef6ff40 [2022-04-15 07:56:53,999 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:56:53,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c [2022-04-15 07:56:54,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db94b40e5/daf01ea5a1a44756bdb58d1374263d3b/FLAGdeef6ff40 [2022-04-15 07:56:54,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db94b40e5/daf01ea5a1a44756bdb58d1374263d3b [2022-04-15 07:56:54,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:56:54,029 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:56:54,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:56:54,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:56:54,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:56:54,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:56:54" (1/1) ... [2022-04-15 07:56:54,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70133bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54, skipping insertion in model container [2022-04-15 07:56:54,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:56:54" (1/1) ... [2022-04-15 07:56:54,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:56:54,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:56:54,234 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_valuebound50.c[525,538] [2022-04-15 07:56:54,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:56:54,303 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:56:54,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c[525,538] [2022-04-15 07:56:54,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:56:54,354 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:56:54,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54 WrapperNode [2022-04-15 07:56:54,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:56:54,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:56:54,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:56:54,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:56:54,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54" (1/1) ... [2022-04-15 07:56:54,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54" (1/1) ... [2022-04-15 07:56:54,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54" (1/1) ... [2022-04-15 07:56:54,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54" (1/1) ... [2022-04-15 07:56:54,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54" (1/1) ... [2022-04-15 07:56:54,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54" (1/1) ... [2022-04-15 07:56:54,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54" (1/1) ... [2022-04-15 07:56:54,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:56:54,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:56:54,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:56:54,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:56:54,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54" (1/1) ... [2022-04-15 07:56:54,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:56:54,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:56:54,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:56:54,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:56:54,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:56:54,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:56:54,474 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:56:54,474 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:56:54,474 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:56:54,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:56:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:56:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:56:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:56:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:56:54,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 07:56:54,476 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:56:54,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:56:54,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:56:54,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:56:54,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:56:54,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:56:54,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:56:54,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:56:54,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:56:54,535 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:56:54,537 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:56:54,765 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:56:54,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:56:54,781 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 07:56:54,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:56:54 BoogieIcfgContainer [2022-04-15 07:56:54,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:56:54,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:56:54,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:56:54,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:56:54,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:56:54" (1/3) ... [2022-04-15 07:56:54,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fddc790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:56:54, skipping insertion in model container [2022-04-15 07:56:54,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:56:54" (2/3) ... [2022-04-15 07:56:54,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fddc790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:56:54, skipping insertion in model container [2022-04-15 07:56:54,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:56:54" (3/3) ... [2022-04-15 07:56:54,792 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound50.c [2022-04-15 07:56:54,796 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:56:54,796 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:56:54,844 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:56:54,851 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:56:54,852 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:56:54,872 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-15 07:56:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:56:54,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:56:54,879 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:56:54,880 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:56:54,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:56:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-15 07:56:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:56:54,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543717374] [2022-04-15 07:56:54,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:56:54,908 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 2 times [2022-04-15 07:56:54,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:56:54,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584438268] [2022-04-15 07:56:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:56:54,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:56:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:56:55,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:56:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:56:55,075 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-15 07:56:55,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 07:56:55,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-15 07:56:55,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:56:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:56:55,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 07:56:55,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 07:56:55,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 07:56:55,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-15 07:56:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:56:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:56:55,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 07:56:55,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 07:56:55,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 07:56:55,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-15 07:56:55,114 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-15 07:56:55,114 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-15 07:56:55,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 07:56:55,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-15 07:56:55,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-15 07:56:55,115 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-15 07:56:55,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {41#true} is VALID [2022-04-15 07:56:55,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 07:56:55,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 07:56:55,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 07:56:55,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-15 07:56:55,117 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-15 07:56:55,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 07:56:55,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 07:56:55,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 07:56:55,118 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-15 07:56:55,118 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-15 07:56:55,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-15 07:56:55,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-15 07:56:55,119 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-15 07:56:55,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-15 07:56:55,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-15 07:56:55,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-15 07:56:55,120 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-15 07:56:55,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:56:55,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584438268] [2022-04-15 07:56:55,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584438268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:56:55,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:56:55,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:56:55,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:56:55,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543717374] [2022-04-15 07:56:55,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543717374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:56:55,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:56:55,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:56:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588392131] [2022-04-15 07:56:55,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:56:55,130 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-15 07:56:55,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:56:55,135 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-15 07:56:55,162 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-15 07:56:55,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:56:55,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:56:55,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:56:55,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:56:55,190 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-15 07:56:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:56:56,808 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-15 07:56:56,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:56:56,809 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-15 07:56:56,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:56:56,810 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-15 07:56:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-15 07:56:56,828 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-15 07:56:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-15 07:56:56,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-15 07:56:57,041 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-15 07:56:57,054 INFO L225 Difference]: With dead ends: 69 [2022-04-15 07:56:57,054 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 07:56:57,057 INFO L912 BasicCegarLoop]: 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-15 07:56:57,062 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:56:57,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 07:56:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 07:56:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 07:56:57,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:56:57,110 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-15 07:56:57,110 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-15 07:56:57,111 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-15 07:56:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:56:57,115 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-15 07:56:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 07:56:57,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:56:57,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:56:57,118 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-15 07:56:57,119 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-15 07:56:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:56:57,124 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-15 07:56:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 07:56:57,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:56:57,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:56:57,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:56:57,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:56:57,126 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-15 07:56:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-15 07:56:57,130 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-15 07:56:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:56:57,130 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-15 07:56:57,130 INFO L479 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-15 07:56:57,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 44 transitions. [2022-04-15 07:56:57,192 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-15 07:56:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 07:56:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 07:56:57,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:56:57,197 INFO L499 BasicCegarLoop]: 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-15 07:56:57,197 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:56:57,198 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:56:57,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:56:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-15 07:56:57,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:56:57,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [580273996] [2022-04-15 07:56:57,202 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:56:57,202 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 2 times [2022-04-15 07:56:57,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:56:57,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834208663] [2022-04-15 07:56:57,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:56:57,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:56:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:56:57,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:56:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:56:57,517 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-15 07:56:57,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 07:56:57,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-15 07:56:57,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:56:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:56:57,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 07:56:57,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 07:56:57,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 07:56:57,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-15 07:56:57,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:56:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:56:57,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 07:56:57,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 07:56:57,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 07:56:57,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-15 07:56:57,540 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-15 07:56:57,540 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-15 07:56:57,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 07:56:57,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-15 07:56:57,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret5 := main(); {327#true} is VALID [2022-04-15 07:56:57,541 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-15 07:56:57,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {327#true} is VALID [2022-04-15 07:56:57,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 07:56:57,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 07:56:57,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 07:56:57,542 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-15 07:56:57,542 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-15 07:56:57,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 07:56:57,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 07:56:57,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 07:56:57,543 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-15 07:56:57,544 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-15 07:56:57,544 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-15 07:56:57,545 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-15 07:56:57,546 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-15 07:56:57,547 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-15 07:56:57,548 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-15 07:56:57,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {328#false} is VALID [2022-04-15 07:56:57,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 07:56:57,549 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-15 07:56:57,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:56:57,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834208663] [2022-04-15 07:56:57,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834208663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:56:57,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:56:57,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:56:57,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:56:57,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [580273996] [2022-04-15 07:56:57,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [580273996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:56:57,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:56:57,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:56:57,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917576772] [2022-04-15 07:56:57,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:56:57,552 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-15 07:56:57,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:56:57,552 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-15 07:56:57,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:56:57,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:56:57,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:56:57,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:56:57,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:56:57,576 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-15 07:57:01,464 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-15 07:57:03,467 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-15 07:57:05,469 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-15 07:57:07,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:57:15,601 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-15 07:57:17,604 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-15 07:57:23,836 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-15 07:57:31,310 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-15 07:57:34,332 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-15 07:57:49,729 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-15 07:57:51,734 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-15 07:57:53,739 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-15 07:57:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:57:56,847 INFO L93 Difference]: Finished difference Result 92 states and 142 transitions. [2022-04-15 07:57:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:57:56,848 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-15 07:57:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:57:56,848 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-15 07:57:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2022-04-15 07:57:56,854 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-15 07:57:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2022-04-15 07:57:56,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 142 transitions. [2022-04-15 07:57:57,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:57:57,296 INFO L225 Difference]: With dead ends: 92 [2022-04-15 07:57:57,296 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 07:57:57,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:57:57,301 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 50 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 120 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:57:57,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 76 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 294 Invalid, 12 Unknown, 0 Unchecked, 36.5s Time] [2022-04-15 07:57:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 07:57:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2022-04-15 07:57:57,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:57:57,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:57:57,347 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:57:57,349 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:57:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:57:57,362 INFO L93 Difference]: Finished difference Result 70 states and 105 transitions. [2022-04-15 07:57:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2022-04-15 07:57:57,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:57:57,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:57:57,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 70 states. [2022-04-15 07:57:57,370 INFO L87 Difference]: Start difference. First operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 70 states. [2022-04-15 07:57:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:57:57,374 INFO L93 Difference]: Finished difference Result 70 states and 105 transitions. [2022-04-15 07:57:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2022-04-15 07:57:57,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:57:57,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:57:57,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:57:57,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:57:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:57:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2022-04-15 07:57:57,383 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 24 [2022-04-15 07:57:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:57:57,383 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2022-04-15 07:57:57,384 INFO L479 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-15 07:57:57,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 82 transitions. [2022-04-15 07:57:57,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:57:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-04-15 07:57:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 07:57:57,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:57:57,726 INFO L499 BasicCegarLoop]: 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-15 07:57:57,726 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:57:57,726 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:57:57,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:57:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-15 07:57:57,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:57:57,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1709378173] [2022-04-15 07:57:57,727 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:57:57,727 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 2 times [2022-04-15 07:57:57,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:57:57,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204066] [2022-04-15 07:57:57,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:57:57,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:57:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:57:57,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:57:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:57:57,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {814#(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); {797#true} is VALID [2022-04-15 07:57:57,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {797#true} assume true; {797#true} is VALID [2022-04-15 07:57:57,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {797#true} {797#true} #103#return; {797#true} is VALID [2022-04-15 07:57:57,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:57:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:57:57,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {797#true} ~cond := #in~cond; {797#true} is VALID [2022-04-15 07:57:57,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {797#true} assume !(0 == ~cond); {797#true} is VALID [2022-04-15 07:57:57,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {797#true} assume true; {797#true} is VALID [2022-04-15 07:57:57,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {797#true} {797#true} #81#return; {797#true} is VALID [2022-04-15 07:57:57,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:57:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:57:57,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {797#true} ~cond := #in~cond; {797#true} is VALID [2022-04-15 07:57:57,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {797#true} assume !(0 == ~cond); {797#true} is VALID [2022-04-15 07:57:57,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {797#true} assume true; {797#true} is VALID [2022-04-15 07:57:57,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {797#true} {797#true} #83#return; {797#true} is VALID [2022-04-15 07:57:57,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {797#true} call ULTIMATE.init(); {814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:57:57,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {814#(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); {797#true} is VALID [2022-04-15 07:57:57,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {797#true} assume true; {797#true} is VALID [2022-04-15 07:57:57,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {797#true} {797#true} #103#return; {797#true} is VALID [2022-04-15 07:57:57,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {797#true} call #t~ret5 := main(); {797#true} is VALID [2022-04-15 07:57:57,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {797#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {797#true} is VALID [2022-04-15 07:57:57,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {797#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {797#true} is VALID [2022-04-15 07:57:57,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {797#true} ~cond := #in~cond; {797#true} is VALID [2022-04-15 07:57:57,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {797#true} assume !(0 == ~cond); {797#true} is VALID [2022-04-15 07:57:57,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {797#true} assume true; {797#true} is VALID [2022-04-15 07:57:57,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {797#true} {797#true} #81#return; {797#true} is VALID [2022-04-15 07:57:57,911 INFO L272 TraceCheckUtils]: 11: Hoare triple {797#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {797#true} is VALID [2022-04-15 07:57:57,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {797#true} ~cond := #in~cond; {797#true} is VALID [2022-04-15 07:57:57,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {797#true} assume !(0 == ~cond); {797#true} is VALID [2022-04-15 07:57:57,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {797#true} assume true; {797#true} is VALID [2022-04-15 07:57:57,911 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {797#true} {797#true} #83#return; {797#true} is VALID [2022-04-15 07:57:57,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {797#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {810#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:57:57,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {810#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:57:57,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {810#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {810#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:57:57,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {810#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {810#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:57:57,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {810#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {811#(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-15 07:57:57,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {811#(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; {811#(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-15 07:57:57,917 INFO L272 TraceCheckUtils]: 22: Hoare triple {811#(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)); {812#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:57:57,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {812#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {813#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:57:57,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {813#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {798#false} is VALID [2022-04-15 07:57:57,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {798#false} assume !false; {798#false} is VALID [2022-04-15 07:57:57,918 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-15 07:57:57,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:57:57,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204066] [2022-04-15 07:57:57,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:57:57,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:57:57,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:57:57,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:57:57,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1709378173] [2022-04-15 07:57:57,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1709378173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:57:57,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:57:57,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:57:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388963271] [2022-04-15 07:57:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:57:57,920 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-15 07:57:57,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:57:57,920 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-15 07:57:57,938 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-15 07:57:57,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:57:57,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:57:57,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:57:57,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:57:57,939 INFO L87 Difference]: Start difference. First operand 57 states and 82 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-15 07:58:00,202 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-15 07:58:02,854 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-15 07:58:04,970 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-15 07:58:16,209 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-15 07:58:18,290 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-15 07:58:20,626 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-15 07:58:22,631 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-15 07:58:28,015 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-15 07:58:32,303 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-15 07:58:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:58:32,703 INFO L93 Difference]: Finished difference Result 91 states and 133 transitions. [2022-04-15 07:58:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:58:32,704 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-15 07:58:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:58:32,707 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-15 07:58:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-15 07:58:32,715 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-15 07:58:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-15 07:58:32,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 91 transitions. [2022-04-15 07:58:33,055 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-15 07:58:33,058 INFO L225 Difference]: With dead ends: 91 [2022-04-15 07:58:33,058 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 07:58:33,059 INFO L912 BasicCegarLoop]: 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-15 07:58:33,060 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 85 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:58:33,060 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 49 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 217 Invalid, 9 Unknown, 0 Unchecked, 20.9s Time] [2022-04-15 07:58:33,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 07:58:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2022-04-15 07:58:33,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:58:33,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 76 states, 36 states have (on average 1.25) internal successors, (45), 39 states have internal predecessors, (45), 33 states have call successors, (33), 7 states have call predecessors, (33), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 07:58:33,096 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 76 states, 36 states have (on average 1.25) internal successors, (45), 39 states have internal predecessors, (45), 33 states have call successors, (33), 7 states have call predecessors, (33), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 07:58:33,096 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 76 states, 36 states have (on average 1.25) internal successors, (45), 39 states have internal predecessors, (45), 33 states have call successors, (33), 7 states have call predecessors, (33), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 07:58:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:58:33,101 INFO L93 Difference]: Finished difference Result 85 states and 123 transitions. [2022-04-15 07:58:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2022-04-15 07:58:33,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:58:33,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:58:33,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 36 states have (on average 1.25) internal successors, (45), 39 states have internal predecessors, (45), 33 states have call successors, (33), 7 states have call predecessors, (33), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 85 states. [2022-04-15 07:58:33,128 INFO L87 Difference]: Start difference. First operand has 76 states, 36 states have (on average 1.25) internal successors, (45), 39 states have internal predecessors, (45), 33 states have call successors, (33), 7 states have call predecessors, (33), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 85 states. [2022-04-15 07:58:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:58:33,136 INFO L93 Difference]: Finished difference Result 85 states and 123 transitions. [2022-04-15 07:58:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2022-04-15 07:58:33,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:58:33,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:58:33,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:58:33,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:58:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 36 states have (on average 1.25) internal successors, (45), 39 states have internal predecessors, (45), 33 states have call successors, (33), 7 states have call predecessors, (33), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 07:58:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2022-04-15 07:58:33,142 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 26 [2022-04-15 07:58:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:58:33,143 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2022-04-15 07:58:33,143 INFO L479 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-15 07:58:33,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 108 transitions. [2022-04-15 07:58:33,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:58:33,770 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2022-04-15 07:58:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 07:58:33,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:58:33,771 INFO L499 BasicCegarLoop]: 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-15 07:58:33,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:58:33,771 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:58:33,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:58:33,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-15 07:58:33,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:58:33,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187406846] [2022-04-15 07:58:33,772 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:58:33,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 2 times [2022-04-15 07:58:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:58:33,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533763483] [2022-04-15 07:58:33,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:58:33,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:58:33,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:58:33,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112376123] [2022-04-15 07:58:33,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:58:33,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:58:33,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:58:33,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:58:33,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 07:58:33,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:58:33,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:58:33,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:58:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:58:33,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:58:34,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {1331#true} call ULTIMATE.init(); {1331#true} is VALID [2022-04-15 07:58:34,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {1331#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); {1331#true} is VALID [2022-04-15 07:58:34,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {1331#true} assume true; {1331#true} is VALID [2022-04-15 07:58:34,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1331#true} {1331#true} #103#return; {1331#true} is VALID [2022-04-15 07:58:34,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {1331#true} call #t~ret5 := main(); {1331#true} is VALID [2022-04-15 07:58:34,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {1331#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1331#true} is VALID [2022-04-15 07:58:34,090 INFO L272 TraceCheckUtils]: 6: Hoare triple {1331#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {1331#true} is VALID [2022-04-15 07:58:34,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {1331#true} ~cond := #in~cond; {1331#true} is VALID [2022-04-15 07:58:34,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {1331#true} assume !(0 == ~cond); {1331#true} is VALID [2022-04-15 07:58:34,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {1331#true} assume true; {1331#true} is VALID [2022-04-15 07:58:34,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1331#true} {1331#true} #81#return; {1331#true} is VALID [2022-04-15 07:58:34,091 INFO L272 TraceCheckUtils]: 11: Hoare triple {1331#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1331#true} is VALID [2022-04-15 07:58:34,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {1331#true} ~cond := #in~cond; {1331#true} is VALID [2022-04-15 07:58:34,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {1331#true} assume !(0 == ~cond); {1331#true} is VALID [2022-04-15 07:58:34,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {1331#true} assume true; {1331#true} is VALID [2022-04-15 07:58:34,092 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1331#true} {1331#true} #83#return; {1331#true} is VALID [2022-04-15 07:58:34,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {1331#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 07:58:34,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 07:58:34,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 07:58:34,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 07:58:34,101 INFO L272 TraceCheckUtils]: 20: Hoare triple {1384#(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)); {1331#true} is VALID [2022-04-15 07:58:34,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {1331#true} ~cond := #in~cond; {1331#true} is VALID [2022-04-15 07:58:34,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {1331#true} assume !(0 == ~cond); {1331#true} is VALID [2022-04-15 07:58:34,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {1331#true} assume true; {1331#true} is VALID [2022-04-15 07:58:34,103 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1331#true} {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 07:58:34,103 INFO L272 TraceCheckUtils]: 25: Hoare triple {1384#(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)); {1331#true} is VALID [2022-04-15 07:58:34,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {1331#true} ~cond := #in~cond; {1331#true} is VALID [2022-04-15 07:58:34,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {1331#true} assume !(0 == ~cond); {1331#true} is VALID [2022-04-15 07:58:34,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {1331#true} assume true; {1331#true} is VALID [2022-04-15 07:58:34,104 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1331#true} {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1384#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 07:58:34,105 INFO L272 TraceCheckUtils]: 30: Hoare triple {1384#(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)); {1427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:58:34,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {1427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:58:34,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {1431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1332#false} is VALID [2022-04-15 07:58:34,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {1332#false} assume !false; {1332#false} is VALID [2022-04-15 07:58:34,107 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-15 07:58:34,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:58:34,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:58:34,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533763483] [2022-04-15 07:58:34,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:58:34,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112376123] [2022-04-15 07:58:34,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112376123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:58:34,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:58:34,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:58:34,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:58:34,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187406846] [2022-04-15 07:58:34,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187406846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:58:34,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:58:34,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:58:34,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401531246] [2022-04-15 07:58:34,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:58:34,110 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-15 07:58:34,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:58:34,110 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-15 07:58:34,137 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-15 07:58:34,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:58:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:58:34,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:58:34,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:58:34,139 INFO L87 Difference]: Start difference. First operand 76 states and 108 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-15 07:58:36,464 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-15 07:58:41,994 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-15 07:58:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:58:42,000 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2022-04-15 07:58:42,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:58:42,008 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-15 07:58:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:58:42,009 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-15 07:58:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-04-15 07:58:42,011 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-15 07:58:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-04-15 07:58:42,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 94 transitions. [2022-04-15 07:58:42,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:58:42,122 INFO L225 Difference]: With dead ends: 108 [2022-04-15 07:58:42,122 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 07:58:42,123 INFO L912 BasicCegarLoop]: 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-15 07:58:42,124 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:58:42,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-04-15 07:58:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 07:58:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 07:58:42,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:58:42,143 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-15 07:58:42,143 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-15 07:58:42,144 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-15 07:58:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:58:42,146 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-15 07:58:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-15 07:58:42,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:58:42,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:58:42,147 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-15 07:58:42,148 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-15 07:58:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:58:42,150 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-15 07:58:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-15 07:58:42,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:58:42,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:58:42,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:58:42,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:58:42,151 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-15 07:58:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-15 07:58:42,154 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34 [2022-04-15 07:58:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:58:42,154 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-15 07:58:42,154 INFO L479 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-15 07:58:42,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 70 transitions. [2022-04-15 07:58:42,273 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-15 07:58:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-15 07:58:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 07:58:42,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:58:42,274 INFO L499 BasicCegarLoop]: 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-15 07:58:42,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 07:58:42,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:58:42,475 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:58:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:58:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-15 07:58:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:58:42,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888530253] [2022-04-15 07:58:42,477 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:58:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 2 times [2022-04-15 07:58:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:58:42,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088135204] [2022-04-15 07:58:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:58:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:58:42,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:58:42,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655660934] [2022-04-15 07:58:42,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:58:42,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:58:42,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:58:42,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:58:42,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 07:58:42,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:58:42,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:58:42,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:58:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:58:42,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:58:42,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {1859#true} call ULTIMATE.init(); {1859#true} is VALID [2022-04-15 07:58:42,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {1859#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); {1859#true} is VALID [2022-04-15 07:58:42,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {1859#true} assume true; {1859#true} is VALID [2022-04-15 07:58:42,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1859#true} {1859#true} #103#return; {1859#true} is VALID [2022-04-15 07:58:42,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {1859#true} call #t~ret5 := main(); {1859#true} is VALID [2022-04-15 07:58:42,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {1859#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1859#true} is VALID [2022-04-15 07:58:42,756 INFO L272 TraceCheckUtils]: 6: Hoare triple {1859#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {1859#true} is VALID [2022-04-15 07:58:42,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {1859#true} ~cond := #in~cond; {1859#true} is VALID [2022-04-15 07:58:42,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {1859#true} assume !(0 == ~cond); {1859#true} is VALID [2022-04-15 07:58:42,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {1859#true} assume true; {1859#true} is VALID [2022-04-15 07:58:42,757 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1859#true} {1859#true} #81#return; {1859#true} is VALID [2022-04-15 07:58:42,757 INFO L272 TraceCheckUtils]: 11: Hoare triple {1859#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1859#true} is VALID [2022-04-15 07:58:42,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {1859#true} ~cond := #in~cond; {1859#true} is VALID [2022-04-15 07:58:42,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {1859#true} assume !(0 == ~cond); {1859#true} is VALID [2022-04-15 07:58:42,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {1859#true} assume true; {1859#true} is VALID [2022-04-15 07:58:42,758 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1859#true} {1859#true} #83#return; {1859#true} is VALID [2022-04-15 07:58:42,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {1859#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1912#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:58:42,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {1912#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1912#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:58:42,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {1912#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1912#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:58:42,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {1912#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1912#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:58:42,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {1912#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1912#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:58:42,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {1912#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1912#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:58:42,761 INFO L272 TraceCheckUtils]: 22: Hoare triple {1912#(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)); {1859#true} is VALID [2022-04-15 07:58:42,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {1859#true} ~cond := #in~cond; {1859#true} is VALID [2022-04-15 07:58:42,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {1859#true} assume !(0 == ~cond); {1859#true} is VALID [2022-04-15 07:58:42,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {1859#true} assume true; {1859#true} is VALID [2022-04-15 07:58:42,762 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1859#true} {1912#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1912#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:58:42,762 INFO L272 TraceCheckUtils]: 27: Hoare triple {1912#(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)); {1859#true} is VALID [2022-04-15 07:58:42,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {1859#true} ~cond := #in~cond; {1859#true} is VALID [2022-04-15 07:58:42,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {1859#true} assume !(0 == ~cond); {1859#true} is VALID [2022-04-15 07:58:42,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {1859#true} assume true; {1859#true} is VALID [2022-04-15 07:58:42,764 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1859#true} {1912#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1912#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:58:42,765 INFO L272 TraceCheckUtils]: 32: Hoare triple {1912#(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)); {1961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:58:42,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {1961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:58:42,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {1965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1860#false} is VALID [2022-04-15 07:58:42,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {1860#false} assume !false; {1860#false} is VALID [2022-04-15 07:58:42,766 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-15 07:58:42,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:58:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:58:42,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088135204] [2022-04-15 07:58:42,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:58:42,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655660934] [2022-04-15 07:58:42,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655660934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:58:42,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:58:42,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:58:42,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:58:42,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888530253] [2022-04-15 07:58:42,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888530253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:58:42,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:58:42,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:58:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286930733] [2022-04-15 07:58:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:58:42,769 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-15 07:58:42,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:58:42,769 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-15 07:58:42,798 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-15 07:58:42,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:58:42,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:58:42,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:58:42,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:58:42,799 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-15 07:58:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:58:48,517 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-04-15 07:58:48,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:58:48,518 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-15 07:58:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:58:48,518 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-15 07:58:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 07:58:48,521 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-15 07:58:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 07:58:48,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 07:58:48,595 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-15 07:58:48,597 INFO L225 Difference]: With dead ends: 68 [2022-04-15 07:58:48,597 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 07:58:48,597 INFO L912 BasicCegarLoop]: 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-15 07:58:48,598 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:58:48,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 07:58:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 07:58:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 07:58:48,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:58:48,628 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-15 07:58:48,628 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-15 07:58:48,628 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-15 07:58:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:58:48,631 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-15 07:58:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-15 07:58:48,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:58:48,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:58:48,632 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-15 07:58:48,632 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-15 07:58:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:58:48,635 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-15 07:58:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-15 07:58:48,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:58:48,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:58:48,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:58:48,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:58:48,636 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-15 07:58:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-04-15 07:58:48,638 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2022-04-15 07:58:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:58:48,639 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-04-15 07:58:48,639 INFO L479 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-15 07:58:48,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 87 transitions. [2022-04-15 07:58:49,003 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-15 07:58:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-15 07:58:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:58:49,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:58:49,005 INFO L499 BasicCegarLoop]: 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-15 07:58:49,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 07:58:49,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:58:49,208 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:58:49,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:58:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-15 07:58:49,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:58:49,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1323745707] [2022-04-15 07:58:49,209 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:58:49,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 2 times [2022-04-15 07:58:49,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:58:49,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206281792] [2022-04-15 07:58:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:58:49,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:58:49,234 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:58:49,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972418598] [2022-04-15 07:58:49,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:58:49,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:58:49,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:58:49,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:58:49,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process