/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:15:07,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:15:07,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:15:07,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:15:07,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:15:07,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:15:07,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:15:07,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:15:07,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:15:07,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:15:07,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:15:07,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:15:07,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:15:07,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:15:07,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:15:07,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:15:07,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:15:07,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:15:07,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:15:07,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:15:07,526 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:15:07,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:15:07,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:15:07,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:15:07,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:15:07,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:15:07,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:15:07,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:15:07,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:15:07,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:15:07,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:15:07,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:15:07,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:15:07,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:15:07,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:15:07,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:15:07,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:15:07,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:15:07,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:15:07,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:15:07,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:15:07,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:15:07,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:15:07,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:15:07,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:15:07,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:15:07,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:15:07,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:15:07,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:15:07,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:15:07,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:15:07,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:15:07,550 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:15:07,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:15:07,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:15:07,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:15:07,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:15:07,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:15:07,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:15:07,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:15:07,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:15:07,551 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:15:07,551 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:15:07,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:15:07,551 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:15:07,551 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 14:15:07,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:15:07,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:15:07,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:15:07,752 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:15:07,752 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:15:07,753 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 14:15:07,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8695b39bc/8849631e92254d0e99ad963b1ea7b0d1/FLAG4d40fc318 [2022-04-15 14:15:08,147 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:15:08,148 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c [2022-04-15 14:15:08,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8695b39bc/8849631e92254d0e99ad963b1ea7b0d1/FLAG4d40fc318 [2022-04-15 14:15:08,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8695b39bc/8849631e92254d0e99ad963b1ea7b0d1 [2022-04-15 14:15:08,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:15:08,164 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:15:08,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:15:08,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:15:08,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:15:08,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:15:08" (1/1) ... [2022-04-15 14:15:08,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbba02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08, skipping insertion in model container [2022-04-15 14:15:08,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:15:08" (1/1) ... [2022-04-15 14:15:08,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:15:08,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:15:08,287 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 14:15:08,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:15:08,324 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:15:08,331 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 14:15:08,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:15:08,350 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:15:08,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08 WrapperNode [2022-04-15 14:15:08,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:15:08,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:15:08,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:15:08,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:15:08,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08" (1/1) ... [2022-04-15 14:15:08,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08" (1/1) ... [2022-04-15 14:15:08,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08" (1/1) ... [2022-04-15 14:15:08,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08" (1/1) ... [2022-04-15 14:15:08,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08" (1/1) ... [2022-04-15 14:15:08,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08" (1/1) ... [2022-04-15 14:15:08,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08" (1/1) ... [2022-04-15 14:15:08,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:15:08,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:15:08,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:15:08,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:15:08,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08" (1/1) ... [2022-04-15 14:15:08,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:15:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:15:08,401 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 14:15:08,402 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 14:15:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:15:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:15:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:15:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:15:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:15:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:15:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:15:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:15:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:15:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:15:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:15:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:15:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:15:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:15:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:15:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:15:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:15:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:15:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:15:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:15:08,471 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:15:08,473 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:15:08,601 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:15:08,606 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:15:08,606 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:15:08,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:15:08 BoogieIcfgContainer [2022-04-15 14:15:08,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:15:08,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:15:08,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:15:08,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:15:08,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:15:08" (1/3) ... [2022-04-15 14:15:08,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa9ec05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:15:08, skipping insertion in model container [2022-04-15 14:15:08,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:08" (2/3) ... [2022-04-15 14:15:08,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa9ec05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:15:08, skipping insertion in model container [2022-04-15 14:15:08,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:15:08" (3/3) ... [2022-04-15 14:15:08,612 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound50.c [2022-04-15 14:15:08,615 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:15:08,615 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:15:08,643 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:15:08,647 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 14:15:08,647 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:15:08,664 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 14:15:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 14:15:08,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:15:08,669 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 14:15:08,670 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:15:08,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:15:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-15 14:15:08,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:08,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1926052560] [2022-04-15 14:15:08,684 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:15:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 2 times [2022-04-15 14:15:08,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:15:08,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849281515] [2022-04-15 14:15:08,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:15:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:15:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:08,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:15:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:08,824 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 14:15:08,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 14:15:08,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-15 14:15:08,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:15:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:08,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:15:08,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:15:08,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:15:08,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-15 14:15:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:15:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:08,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:15:08,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:15:08,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:15:08,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-15 14:15:08,855 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 14:15:08,856 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 14:15:08,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 14:15:08,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-15 14:15:08,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-15 14:15:08,856 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 14:15:08,856 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 14:15:08,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:15:08,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:15:08,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:15:08,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-15 14:15:08,876 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 14:15:08,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:15:08,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:15:08,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:15:08,877 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-15 14:15:08,877 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 14:15:08,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-15 14:15:08,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-15 14:15:08,878 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 14:15:08,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-15 14:15:08,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-15 14:15:08,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-15 14:15:08,879 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 14:15:08,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:15:08,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849281515] [2022-04-15 14:15:08,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849281515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:08,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:08,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:15:08,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:15:08,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1926052560] [2022-04-15 14:15:08,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1926052560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:08,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:08,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:15:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203867302] [2022-04-15 14:15:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:15:08,887 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 14:15:08,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:15:08,890 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 14:15:08,924 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 14:15:08,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:15:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:15:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:15:08,947 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 14:15:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:10,342 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-15 14:15:10,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:15:10,343 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 14:15:10,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:15:10,344 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 14:15:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-15 14:15:10,357 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 14:15:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-15 14:15:10,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-15 14:15:10,493 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 14:15:10,505 INFO L225 Difference]: With dead ends: 69 [2022-04-15 14:15:10,505 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 14:15:10,508 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 14:15:10,511 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-15 14:15:10,513 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.8s Time] [2022-04-15 14:15:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 14:15:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 14:15:10,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:15:10,534 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 14:15:10,535 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 14:15:10,535 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 14:15:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:10,539 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-15 14:15:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 14:15:10,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:10,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:10,540 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 14:15:10,541 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 14:15:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:10,544 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-15 14:15:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 14:15:10,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:10,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:10,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:15:10,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:15:10,545 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 14:15:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-15 14:15:10,548 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-15 14:15:10,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:15:10,549 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-15 14:15:10,549 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 14:15:10,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 44 transitions. [2022-04-15 14:15:10,601 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 14:15:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 14:15:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 14:15:10,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:15:10,603 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 14:15:10,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:15:10,603 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:15:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:15:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-15 14:15:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:10,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [283538280] [2022-04-15 14:15:10,605 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:15:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 2 times [2022-04-15 14:15:10,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:15:10,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827133015] [2022-04-15 14:15:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:15:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:15:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:10,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:15:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:10,814 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 14:15:10,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:15:10,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-15 14:15:10,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:15:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:10,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:15:10,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:15:10,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:15:10,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-15 14:15:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:15:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:10,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:15:10,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:15:10,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:15:10,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-15 14:15:10,839 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 14:15:10,839 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 14:15:10,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:15:10,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-15 14:15:10,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret5 := main(); {327#true} is VALID [2022-04-15 14:15:10,842 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 14:15:10,842 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 14:15:10,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:15:10,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:15:10,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:15:10,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-15 14:15:10,843 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 14:15:10,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:15:10,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:15:10,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:15:10,843 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-15 14:15:10,846 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 14:15:10,847 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 14:15:10,848 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 14:15:10,848 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 14:15:10,849 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 14:15:10,850 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 14:15:10,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {328#false} is VALID [2022-04-15 14:15:10,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 14:15:10,852 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 14:15:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:15:10,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827133015] [2022-04-15 14:15:10,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827133015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:10,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:10,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:15:10,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:15:10,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [283538280] [2022-04-15 14:15:10,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [283538280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:10,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:10,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:15:10,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556388208] [2022-04-15 14:15:10,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:15:10,854 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 14:15:10,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:15:10,854 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 14:15:10,869 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 14:15:10,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:15:10,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:10,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:15:10,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:15:10,871 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 14:15:14,644 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 14:15:16,646 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 14:15:18,660 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 14:15:20,662 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 14:15:22,859 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 14:15:24,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 14:15:29,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:15:31,232 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 14:15:33,235 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 14:15:38,889 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 14:15:46,369 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 14:15:48,371 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 14:15:50,452 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 14:15:52,456 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 14:15:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:54,720 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2022-04-15 14:15:54,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:15:54,720 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 14:15:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:15:54,721 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 14:15:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-04-15 14:15:54,724 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 14:15:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-04-15 14:15:54,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 97 transitions. [2022-04-15 14:15:54,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:54,882 INFO L225 Difference]: With dead ends: 67 [2022-04-15 14:15:54,882 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 14:15:54,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 14:15:54,883 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 41 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:15:54,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 59 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 196 Invalid, 13 Unknown, 0 Unchecked, 35.0s Time] [2022-04-15 14:15:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 14:15:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-15 14:15:54,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:15:54,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:15:54,898 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:15:54,899 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:15:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:54,902 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-15 14:15:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-04-15 14:15:54,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:54,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:54,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 49 states. [2022-04-15 14:15:54,903 INFO L87 Difference]: Start difference. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 49 states. [2022-04-15 14:15:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:54,906 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-15 14:15:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-04-15 14:15:54,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:54,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:54,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:15:54,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:15:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:15:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-15 14:15:54,910 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 24 [2022-04-15 14:15:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:15:54,910 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-15 14:15:54,911 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 14:15:54,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-15 14:15:55,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-15 14:15:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 14:15:55,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:15:55,104 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 14:15:55,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 14:15:55,105 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:15:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:15:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-15 14:15:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:55,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1246564051] [2022-04-15 14:15:55,105 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:15:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 2 times [2022-04-15 14:15:55,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:15:55,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353642043] [2022-04-15 14:15:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:15:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:15:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:55,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:15:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:55,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {683#true} is VALID [2022-04-15 14:15:55,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-15 14:15:55,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {683#true} {683#true} #103#return; {683#true} is VALID [2022-04-15 14:15:55,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:15:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:55,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-15 14:15:55,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-15 14:15:55,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-15 14:15:55,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #81#return; {683#true} is VALID [2022-04-15 14:15:55,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:15:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:55,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-15 14:15:55,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-15 14:15:55,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-15 14:15:55,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #83#return; {683#true} is VALID [2022-04-15 14:15:55,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:15:55,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {683#true} is VALID [2022-04-15 14:15:55,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-15 14:15:55,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #103#return; {683#true} is VALID [2022-04-15 14:15:55,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret5 := main(); {683#true} is VALID [2022-04-15 14:15:55,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {683#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {683#true} is VALID [2022-04-15 14:15:55,255 INFO L272 TraceCheckUtils]: 6: Hoare triple {683#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {683#true} is VALID [2022-04-15 14:15:55,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-15 14:15:55,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-15 14:15:55,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-15 14:15:55,255 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {683#true} {683#true} #81#return; {683#true} is VALID [2022-04-15 14:15:55,255 INFO L272 TraceCheckUtils]: 11: Hoare triple {683#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {683#true} is VALID [2022-04-15 14:15:55,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-15 14:15:55,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-15 14:15:55,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-15 14:15:55,256 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {683#true} {683#true} #83#return; {683#true} is VALID [2022-04-15 14:15:55,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {683#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:15:55,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:15:55,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:15:55,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:15:55,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {696#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {697#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-15 14:15:55,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {697#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !false; {697#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-15 14:15:55,260 INFO L272 TraceCheckUtils]: 22: Hoare triple {697#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:15:55,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {698#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {699#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:15:55,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {699#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {684#false} is VALID [2022-04-15 14:15:55,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {684#false} assume !false; {684#false} is VALID [2022-04-15 14:15:55,261 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 14:15:55,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:15:55,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353642043] [2022-04-15 14:15:55,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353642043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:55,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:55,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:15:55,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:15:55,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1246564051] [2022-04-15 14:15:55,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1246564051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:55,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:55,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:15:55,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771692638] [2022-04-15 14:15:55,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:15:55,262 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 14:15:55,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:15:55,263 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 14:15:55,280 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 14:15:55,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:15:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:55,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:15:55,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:15:55,281 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:16:01,140 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 14:16:02,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:16:05,163 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 14:16:07,166 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 14:16:09,650 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 14:16:11,655 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 14:16:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:19,209 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2022-04-15 14:16:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:16:19,209 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 14:16:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:16:19,209 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 14:16:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-04-15 14:16:19,214 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 14:16:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-04-15 14:16:19,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 69 transitions. [2022-04-15 14:16:19,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:19,381 INFO L225 Difference]: With dead ends: 64 [2022-04-15 14:16:19,381 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 14:16:19,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 14:16:19,382 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 54 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-04-15 14:16:19,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 54 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 177 Invalid, 5 Unknown, 0 Unchecked, 15.7s Time] [2022-04-15 14:16:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 14:16:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 14:16:19,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:16:19,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 14:16:19,405 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 14:16:19,405 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 14:16:19,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:19,408 INFO L93 Difference]: Finished difference Result 60 states and 83 transitions. [2022-04-15 14:16:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2022-04-15 14:16:19,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:19,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:19,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 60 states. [2022-04-15 14:16:19,409 INFO L87 Difference]: Start difference. First operand has 60 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 60 states. [2022-04-15 14:16:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:19,412 INFO L93 Difference]: Finished difference Result 60 states and 83 transitions. [2022-04-15 14:16:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2022-04-15 14:16:19,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:19,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:19,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:16:19,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:16:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 14:16:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2022-04-15 14:16:19,415 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 26 [2022-04-15 14:16:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:16:19,415 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2022-04-15 14:16:19,415 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 14:16:19,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 83 transitions. [2022-04-15 14:16:19,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2022-04-15 14:16:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 14:16:19,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:16:19,716 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 14:16:19,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 14:16:19,717 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:16:19,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:16:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-15 14:16:19,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:19,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1091448305] [2022-04-15 14:16:19,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:16:19,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 2 times [2022-04-15 14:16:19,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:16:19,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049703501] [2022-04-15 14:16:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:16:19,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:16:19,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325492599] [2022-04-15 14:16:19,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:16:19,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:19,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:16:19,733 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 14:16:19,755 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 14:16:19,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:16:19,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:16:19,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:16:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:19,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:16:20,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {1081#true} call ULTIMATE.init(); {1081#true} is VALID [2022-04-15 14:16:20,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#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); {1081#true} is VALID [2022-04-15 14:16:20,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {1081#true} assume true; {1081#true} is VALID [2022-04-15 14:16:20,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1081#true} {1081#true} #103#return; {1081#true} is VALID [2022-04-15 14:16:20,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {1081#true} call #t~ret5 := main(); {1081#true} is VALID [2022-04-15 14:16:20,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {1081#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1081#true} is VALID [2022-04-15 14:16:20,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {1081#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {1081#true} is VALID [2022-04-15 14:16:20,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {1081#true} ~cond := #in~cond; {1081#true} is VALID [2022-04-15 14:16:20,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {1081#true} assume !(0 == ~cond); {1081#true} is VALID [2022-04-15 14:16:20,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {1081#true} assume true; {1081#true} is VALID [2022-04-15 14:16:20,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1081#true} {1081#true} #81#return; {1081#true} is VALID [2022-04-15 14:16:20,043 INFO L272 TraceCheckUtils]: 11: Hoare triple {1081#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1081#true} is VALID [2022-04-15 14:16:20,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {1081#true} ~cond := #in~cond; {1081#true} is VALID [2022-04-15 14:16:20,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {1081#true} assume !(0 == ~cond); {1081#true} is VALID [2022-04-15 14:16:20,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {1081#true} assume true; {1081#true} is VALID [2022-04-15 14:16:20,051 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1081#true} {1081#true} #83#return; {1081#true} is VALID [2022-04-15 14:16:20,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {1081#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:16:20,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:16:20,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:16:20,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:16:20,056 INFO L272 TraceCheckUtils]: 20: Hoare triple {1134#(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)); {1081#true} is VALID [2022-04-15 14:16:20,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {1081#true} ~cond := #in~cond; {1081#true} is VALID [2022-04-15 14:16:20,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {1081#true} assume !(0 == ~cond); {1081#true} is VALID [2022-04-15 14:16:20,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {1081#true} assume true; {1081#true} is VALID [2022-04-15 14:16:20,057 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1081#true} {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:16:20,057 INFO L272 TraceCheckUtils]: 25: Hoare triple {1134#(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)); {1081#true} is VALID [2022-04-15 14:16:20,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {1081#true} ~cond := #in~cond; {1081#true} is VALID [2022-04-15 14:16:20,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {1081#true} assume !(0 == ~cond); {1081#true} is VALID [2022-04-15 14:16:20,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {1081#true} assume true; {1081#true} is VALID [2022-04-15 14:16:20,058 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1081#true} {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1134#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:16:20,059 INFO L272 TraceCheckUtils]: 30: Hoare triple {1134#(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)); {1177#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:16:20,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {1177#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1181#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:16:20,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {1181#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1082#false} is VALID [2022-04-15 14:16:20,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {1082#false} assume !false; {1082#false} is VALID [2022-04-15 14:16:20,060 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 14:16:20,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:16:20,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:16:20,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049703501] [2022-04-15 14:16:20,060 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:16:20,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325492599] [2022-04-15 14:16:20,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325492599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:20,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:20,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:16:20,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:16:20,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1091448305] [2022-04-15 14:16:20,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1091448305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:20,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:20,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:16:20,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937488021] [2022-04-15 14:16:20,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:16:20,062 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 14:16:20,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:16:20,062 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 14:16:20,081 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 14:16:20,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:16:20,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:20,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:16:20,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:16:20,082 INFO L87 Difference]: Start difference. First operand 60 states and 83 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 14:16:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:31,834 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-04-15 14:16:31,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:16:31,835 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 14:16:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:16:31,835 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 14:16:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 14:16:31,836 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 14:16:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 14:16:31,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 14:16:31,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:31,900 INFO L225 Difference]: With dead ends: 71 [2022-04-15 14:16:31,900 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 14:16:31,900 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 14:16:31,901 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 14:16:31,901 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 14:16:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 14:16:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 14:16:31,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:16:31,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:16:31,915 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:16:31,916 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:16:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:31,918 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-15 14:16:31,918 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-15 14:16:31,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:31,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:31,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-15 14:16:31,919 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-15 14:16:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:31,920 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-15 14:16:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-15 14:16:31,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:31,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:31,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:16:31,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:16:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:16:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-15 14:16:31,923 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 34 [2022-04-15 14:16:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:16:31,923 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-15 14:16:31,923 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 14:16:31,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 65 transitions. [2022-04-15 14:16:32,147 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 14:16:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-15 14:16:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 14:16:32,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:16:32,147 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 14:16:32,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 14:16:32,348 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 14:16:32,349 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:16:32,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:16:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-15 14:16:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:32,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [811048208] [2022-04-15 14:16:32,351 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:16:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 2 times [2022-04-15 14:16:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:16:32,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812956343] [2022-04-15 14:16:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:16:32,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:16:32,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1054566584] [2022-04-15 14:16:32,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:16:32,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:32,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:16:32,368 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 14:16:32,369 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 14:16:32,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:16:32,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:16:32,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:16:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:32,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:16:32,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1523#true} is VALID [2022-04-15 14:16:32,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#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); {1523#true} is VALID [2022-04-15 14:16:32,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-15 14:16:32,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1523#true} {1523#true} #103#return; {1523#true} is VALID [2022-04-15 14:16:32,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {1523#true} call #t~ret5 := main(); {1523#true} is VALID [2022-04-15 14:16:32,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {1523#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1523#true} is VALID [2022-04-15 14:16:32,589 INFO L272 TraceCheckUtils]: 6: Hoare triple {1523#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {1523#true} is VALID [2022-04-15 14:16:32,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {1523#true} ~cond := #in~cond; {1523#true} is VALID [2022-04-15 14:16:32,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#true} assume !(0 == ~cond); {1523#true} is VALID [2022-04-15 14:16:32,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-15 14:16:32,589 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1523#true} {1523#true} #81#return; {1523#true} is VALID [2022-04-15 14:16:32,590 INFO L272 TraceCheckUtils]: 11: Hoare triple {1523#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1523#true} is VALID [2022-04-15 14:16:32,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {1523#true} ~cond := #in~cond; {1523#true} is VALID [2022-04-15 14:16:32,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {1523#true} assume !(0 == ~cond); {1523#true} is VALID [2022-04-15 14:16:32,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-15 14:16:32,590 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1523#true} {1523#true} #83#return; {1523#true} is VALID [2022-04-15 14:16:32,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {1523#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1576#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:16:32,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1576#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:16:32,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1576#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:16:32,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {1576#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1576#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:16:32,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1576#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:16:32,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1576#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:16:32,593 INFO L272 TraceCheckUtils]: 22: Hoare triple {1576#(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)); {1523#true} is VALID [2022-04-15 14:16:32,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {1523#true} ~cond := #in~cond; {1523#true} is VALID [2022-04-15 14:16:32,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {1523#true} assume !(0 == ~cond); {1523#true} is VALID [2022-04-15 14:16:32,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-15 14:16:32,594 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1523#true} {1576#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1576#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:16:32,594 INFO L272 TraceCheckUtils]: 27: Hoare triple {1576#(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)); {1523#true} is VALID [2022-04-15 14:16:32,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {1523#true} ~cond := #in~cond; {1523#true} is VALID [2022-04-15 14:16:32,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {1523#true} assume !(0 == ~cond); {1523#true} is VALID [2022-04-15 14:16:32,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-15 14:16:32,596 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1523#true} {1576#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1576#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:16:32,597 INFO L272 TraceCheckUtils]: 32: Hoare triple {1576#(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)); {1625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:16:32,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {1625#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:16:32,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {1629#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1524#false} is VALID [2022-04-15 14:16:32,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-04-15 14:16:32,598 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 14:16:32,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:16:32,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:16:32,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812956343] [2022-04-15 14:16:32,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:16:32,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054566584] [2022-04-15 14:16:32,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054566584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:32,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:32,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:16:32,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:16:32,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [811048208] [2022-04-15 14:16:32,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [811048208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:32,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:32,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:16:32,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440179081] [2022-04-15 14:16:32,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:16:32,600 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 14:16:32,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:16:32,600 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 14:16:32,628 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 14:16:32,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:16:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:16:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:16:32,630 INFO L87 Difference]: Start difference. First operand 48 states and 65 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 14:16:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:39,331 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-04-15 14:16:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:16:39,331 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 14:16:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:16:39,332 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 14:16:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 14:16:39,333 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 14:16:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 14:16:39,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 14:16:39,414 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 14:16:39,415 INFO L225 Difference]: With dead ends: 58 [2022-04-15 14:16:39,415 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 14:16:39,416 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 14:16:39,416 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 14:16:39,417 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.6s Time] [2022-04-15 14:16:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 14:16:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 14:16:39,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:16:39,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:16:39,435 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:16:39,435 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:16:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:39,437 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-15 14:16:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-15 14:16:39,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:39,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:39,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 55 states. [2022-04-15 14:16:39,438 INFO L87 Difference]: Start difference. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 55 states. [2022-04-15 14:16:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:39,439 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-15 14:16:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-15 14:16:39,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:39,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:39,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:16:39,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:16:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:16:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-15 14:16:39,442 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 36 [2022-04-15 14:16:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:16:39,442 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-15 14:16:39,442 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 14:16:39,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-15 14:16:39,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-15 14:16:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 14:16:39,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:16:39,605 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 14:16:39,609 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 14:16:39,808 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 14:16:39,809 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:16:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:16:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-15 14:16:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:39,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159422713] [2022-04-15 14:16:39,810 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:16:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 2 times [2022-04-15 14:16:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:16:39,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157769464] [2022-04-15 14:16:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:39,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:16:39,821 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:16:39,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740264003] [2022-04-15 14:16:39,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:16:39,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:39,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:16:39,822 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 14:16:39,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process