/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/divbin_valuebound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:58:15,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:58:15,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:58:15,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:58:15,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:58:15,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:58:15,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:58:15,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:58:15,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:58:15,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:58:15,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:58:15,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:58:15,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:58:15,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:58:15,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:58:15,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:58:15,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:58:15,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:58:15,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:58:15,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:58:15,360 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:58:15,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:58:15,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:58:15,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:58:15,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:58:15,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:58:15,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:58:15,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:58:15,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:58:15,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:58:15,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:58:15,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:58:15,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:58:15,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:58:15,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:58:15,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:58:15,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:58:15,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:58:15,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:58:15,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:58:15,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:58:15,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:58:15,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:58:15,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:58:15,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:58:15,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:58:15,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:58:15,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:58:15,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:58:15,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:58:15,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:58:15,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:58:15,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:58:15,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:58:15,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:58:15,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:58:15,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:58:15,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:58:15,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:58:15,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:58:15,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:58:15,380 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:58:15,380 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:58:15,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:58:15,380 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:58:15,380 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-08 11:58:15,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:58:15,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:58:15,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:58:15,589 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:58:15,590 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:58:15,591 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound100.i [2022-04-08 11:58:15,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8c4b3d6/3058c87346504412927734fb3f9841e9/FLAGcbad136b1 [2022-04-08 11:58:15,956 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:58:15,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound100.i [2022-04-08 11:58:15,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8c4b3d6/3058c87346504412927734fb3f9841e9/FLAGcbad136b1 [2022-04-08 11:58:16,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8c4b3d6/3058c87346504412927734fb3f9841e9 [2022-04-08 11:58:16,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:58:16,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:58:16,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:58:16,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:58:16,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:58:16,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:58:16" (1/1) ... [2022-04-08 11:58:16,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ddce03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16, skipping insertion in model container [2022-04-08 11:58:16,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:58:16" (1/1) ... [2022-04-08 11:58:16,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:58:16,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:58:16,597 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/divbin_valuebound100.i[950,963] [2022-04-08 11:58:16,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:58:16,635 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:58:16,648 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/divbin_valuebound100.i[950,963] [2022-04-08 11:58:16,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:58:16,678 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:58:16,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16 WrapperNode [2022-04-08 11:58:16,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:58:16,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:58:16,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:58:16,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:58:16,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16" (1/1) ... [2022-04-08 11:58:16,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16" (1/1) ... [2022-04-08 11:58:16,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16" (1/1) ... [2022-04-08 11:58:16,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16" (1/1) ... [2022-04-08 11:58:16,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16" (1/1) ... [2022-04-08 11:58:16,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16" (1/1) ... [2022-04-08 11:58:16,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16" (1/1) ... [2022-04-08 11:58:16,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:58:16,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:58:16,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:58:16,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:58:16,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16" (1/1) ... [2022-04-08 11:58:16,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:58:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:58:16,741 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-08 11:58:16,759 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-08 11:58:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:58:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:58:16,775 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:58:16,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:58:16,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:58:16,775 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:58:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:58:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:58:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 11:58:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 11:58:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:58:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:58:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 11:58:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:58:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:58:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:58:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:58:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:58:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:58:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:58:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:58:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:58:16,841 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:58:16,842 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:58:17,010 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:58:17,015 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:58:17,015 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:58:17,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:58:17 BoogieIcfgContainer [2022-04-08 11:58:17,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:58:17,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:58:17,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:58:17,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:58:17,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:58:16" (1/3) ... [2022-04-08 11:58:17,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac3a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:58:17, skipping insertion in model container [2022-04-08 11:58:17,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:58:16" (2/3) ... [2022-04-08 11:58:17,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac3a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:58:17, skipping insertion in model container [2022-04-08 11:58:17,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:58:17" (3/3) ... [2022-04-08 11:58:17,045 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound100.i [2022-04-08 11:58:17,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:58:17,049 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:58:17,080 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:58:17,085 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-08 11:58:17,085 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:58:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 11:58:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 11:58:17,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:58:17,104 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:58:17,105 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:58:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:58:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash 291922115, now seen corresponding path program 1 times [2022-04-08 11:58:17,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:58:17,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [506407728] [2022-04-08 11:58:17,124 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:58:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash 291922115, now seen corresponding path program 2 times [2022-04-08 11:58:17,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:58:17,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810628062] [2022-04-08 11:58:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:58:17,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:58:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:58:17,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:58:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:58:17,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(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(9, 2); {37#true} is VALID [2022-04-08 11:58:17,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-08 11:58:17,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #94#return; {37#true} is VALID [2022-04-08 11:58:17,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:58:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:58:17,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 11:58:17,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 11:58:17,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 11:58:17,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #82#return; {38#false} is VALID [2022-04-08 11:58:17,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 11:58:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:58:17,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 11:58:17,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 11:58:17,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 11:58:17,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #84#return; {38#false} is VALID [2022-04-08 11:58:17,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 11:58:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:58:17,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 11:58:17,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 11:58:17,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 11:58:17,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #86#return; {38#false} is VALID [2022-04-08 11:58:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 11:58:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:58:17,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 11:58:17,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 11:58:17,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 11:58:17,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #88#return; {38#false} is VALID [2022-04-08 11:58:17,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:58:17,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(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(9, 2); {37#true} is VALID [2022-04-08 11:58:17,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-08 11:58:17,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #94#return; {37#true} is VALID [2022-04-08 11:58:17,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2022-04-08 11:58:17,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2022-04-08 11:58:17,292 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {37#true} is VALID [2022-04-08 11:58:17,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 11:58:17,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 11:58:17,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 11:58:17,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #82#return; {38#false} is VALID [2022-04-08 11:58:17,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} ~B~0 := #t~nondet2;havoc #t~nondet2; {38#false} is VALID [2022-04-08 11:58:17,293 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {37#true} is VALID [2022-04-08 11:58:17,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 11:58:17,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 11:58:17,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 11:58:17,294 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #84#return; {38#false} is VALID [2022-04-08 11:58:17,294 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {37#true} is VALID [2022-04-08 11:58:17,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 11:58:17,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 11:58:17,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 11:58:17,295 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #86#return; {38#false} is VALID [2022-04-08 11:58:17,295 INFO L272 TraceCheckUtils]: 22: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-08 11:58:17,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 11:58:17,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 11:58:17,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 11:58:17,296 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38#false} {38#false} #88#return; {38#false} is VALID [2022-04-08 11:58:17,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {38#false} is VALID [2022-04-08 11:58:17,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-08 11:58:17,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-08 11:58:17,297 INFO L272 TraceCheckUtils]: 30: Hoare triple {38#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {38#false} is VALID [2022-04-08 11:58:17,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-08 11:58:17,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-08 11:58:17,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-08 11:58:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 11:58:17,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:58:17,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810628062] [2022-04-08 11:58:17,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810628062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:58:17,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:58:17,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:58:17,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:58:17,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [506407728] [2022-04-08 11:58:17,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [506407728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:58:17,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:58:17,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:58:17,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767667594] [2022-04-08 11:58:17,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:58:17,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 11:58:17,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:58:17,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 11:58:17,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:58:17,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:58:17,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:58:17,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:58:17,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:58:17,353 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 11:58:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:58:17,490 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-04-08 11:58:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:58:17,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 11:58:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:58:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 11:58:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-08 11:58:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 11:58:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-08 11:58:17,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-04-08 11:58:17,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:58:17,653 INFO L225 Difference]: With dead ends: 61 [2022-04-08 11:58:17,653 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 11:58:17,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-08 11:58:17,661 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:58:17,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:58:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 11:58:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 11:58:17,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:58:17,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:58:17,698 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:58:17,699 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:58:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:58:17,706 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 11:58:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 11:58:17,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:58:17,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:58:17,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-08 11:58:17,709 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-08 11:58:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:58:17,713 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 11:58:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 11:58:17,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:58:17,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:58:17,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:58:17,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:58:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:58:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-08 11:58:17,719 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 34 [2022-04-08 11:58:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:58:17,719 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-08 11:58:17,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 11:58:17,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-08 11:58:17,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:58:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 11:58:17,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 11:58:17,757 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:58:17,757 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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-08 11:58:17,757 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:58:17,758 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:58:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:58:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash -245963777, now seen corresponding path program 1 times [2022-04-08 11:58:17,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:58:17,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325076638] [2022-04-08 11:58:17,764 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:58:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash -245963777, now seen corresponding path program 2 times [2022-04-08 11:58:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:58:17,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144355581] [2022-04-08 11:58:17,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:58:17,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:58:17,801 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:58:17,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619989152] [2022-04-08 11:58:17,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:58:17,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:58:17,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:58:17,806 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-08 11:58:17,877 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-08 11:58:17,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:58:17,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:58:17,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 11:58:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:58:17,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:58:18,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2022-04-08 11:58:18,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {299#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(9, 2); {299#true} is VALID [2022-04-08 11:58:18,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2022-04-08 11:58:18,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #94#return; {299#true} is VALID [2022-04-08 11:58:18,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret3 := main(); {299#true} is VALID [2022-04-08 11:58:18,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {299#true} is VALID [2022-04-08 11:58:18,345 INFO L272 TraceCheckUtils]: 6: Hoare triple {299#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {299#true} is VALID [2022-04-08 11:58:18,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {299#true} ~cond := #in~cond; {299#true} is VALID [2022-04-08 11:58:18,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#true} assume !(0 == ~cond); {299#true} is VALID [2022-04-08 11:58:18,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {299#true} assume true; {299#true} is VALID [2022-04-08 11:58:18,345 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {299#true} {299#true} #82#return; {299#true} is VALID [2022-04-08 11:58:18,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {299#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {299#true} is VALID [2022-04-08 11:58:18,346 INFO L272 TraceCheckUtils]: 12: Hoare triple {299#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {299#true} is VALID [2022-04-08 11:58:18,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {299#true} ~cond := #in~cond; {299#true} is VALID [2022-04-08 11:58:18,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {299#true} assume !(0 == ~cond); {299#true} is VALID [2022-04-08 11:58:18,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {299#true} assume true; {299#true} is VALID [2022-04-08 11:58:18,346 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {299#true} {299#true} #84#return; {299#true} is VALID [2022-04-08 11:58:18,346 INFO L272 TraceCheckUtils]: 17: Hoare triple {299#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {299#true} is VALID [2022-04-08 11:58:18,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {299#true} ~cond := #in~cond; {299#true} is VALID [2022-04-08 11:58:18,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {299#true} assume !(0 == ~cond); {299#true} is VALID [2022-04-08 11:58:18,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {299#true} assume true; {299#true} is VALID [2022-04-08 11:58:18,347 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {299#true} {299#true} #86#return; {299#true} is VALID [2022-04-08 11:58:18,347 INFO L272 TraceCheckUtils]: 22: Hoare triple {299#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {299#true} is VALID [2022-04-08 11:58:18,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {299#true} ~cond := #in~cond; {299#true} is VALID [2022-04-08 11:58:18,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {299#true} assume !(0 == ~cond); {299#true} is VALID [2022-04-08 11:58:18,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {299#true} assume true; {299#true} is VALID [2022-04-08 11:58:18,348 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {299#true} {299#true} #88#return; {299#true} is VALID [2022-04-08 11:58:18,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {299#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:58:18,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:58:18,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {392#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:58:18,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {392#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {392#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:58:18,351 INFO L272 TraceCheckUtils]: 31: Hoare triple {392#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:58:18,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:58:18,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {300#false} is VALID [2022-04-08 11:58:18,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {300#false} assume !false; {300#false} is VALID [2022-04-08 11:58:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 11:58:18,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:58:18,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:58:18,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144355581] [2022-04-08 11:58:18,353 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:58:18,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619989152] [2022-04-08 11:58:18,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619989152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:58:18,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:58:18,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:58:18,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:58:18,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325076638] [2022-04-08 11:58:18,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325076638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:58:18,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:58:18,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:58:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983105662] [2022-04-08 11:58:18,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:58:18,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-08 11:58:18,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:58:18,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 11:58:18,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:58:18,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:58:18,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:58:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:58:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:58:18,376 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 11:58:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:58:18,528 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-08 11:58:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:58:18,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-08 11:58:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:58:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 11:58:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-04-08 11:58:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 11:58:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-04-08 11:58:18,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2022-04-08 11:58:18,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:58:18,577 INFO L225 Difference]: With dead ends: 40 [2022-04-08 11:58:18,577 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 11:58:18,577 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 11:58:18,578 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:58:18,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 100 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:58:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 11:58:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 11:58:18,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:58:18,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:58:18,589 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:58:18,590 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:58:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:58:18,592 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-08 11:58:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-08 11:58:18,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:58:18,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:58:18,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-08 11:58:18,593 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-08 11:58:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:58:18,594 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-08 11:58:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-08 11:58:18,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:58:18,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:58:18,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:58:18,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:58:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:58:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-08 11:58:18,597 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2022-04-08 11:58:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:58:18,597 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-08 11:58:18,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 11:58:18,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-08 11:58:18,638 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-08 11:58:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-08 11:58:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 11:58:18,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:58:18,639 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-08 11:58:18,658 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-08 11:58:18,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:58:18,860 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:58:18,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:58:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash -382866049, now seen corresponding path program 1 times [2022-04-08 11:58:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:58:18,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1995930667] [2022-04-08 11:58:18,861 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:58:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash -382866049, now seen corresponding path program 2 times [2022-04-08 11:58:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:58:18,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997583036] [2022-04-08 11:58:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:58:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:58:18,877 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:58:18,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411597863] [2022-04-08 11:58:18,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:58:18,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:58:18,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:58:18,878 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-08 11:58:18,880 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-08 11:58:18,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:58:18,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:58:18,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 11:58:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:58:18,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:58:19,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {639#true} call ULTIMATE.init(); {639#true} is VALID [2022-04-08 11:58:19,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {639#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(9, 2); {639#true} is VALID [2022-04-08 11:58:19,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {639#true} assume true; {639#true} is VALID [2022-04-08 11:58:19,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {639#true} {639#true} #94#return; {639#true} is VALID [2022-04-08 11:58:19,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {639#true} call #t~ret3 := main(); {639#true} is VALID [2022-04-08 11:58:19,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {639#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {639#true} is VALID [2022-04-08 11:58:19,002 INFO L272 TraceCheckUtils]: 6: Hoare triple {639#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {639#true} is VALID [2022-04-08 11:58:19,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {639#true} ~cond := #in~cond; {639#true} is VALID [2022-04-08 11:58:19,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {639#true} assume !(0 == ~cond); {639#true} is VALID [2022-04-08 11:58:19,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {639#true} assume true; {639#true} is VALID [2022-04-08 11:58:19,002 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {639#true} {639#true} #82#return; {639#true} is VALID [2022-04-08 11:58:19,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {639#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {639#true} is VALID [2022-04-08 11:58:19,003 INFO L272 TraceCheckUtils]: 12: Hoare triple {639#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {639#true} is VALID [2022-04-08 11:58:19,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {639#true} ~cond := #in~cond; {639#true} is VALID [2022-04-08 11:58:19,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {639#true} assume !(0 == ~cond); {639#true} is VALID [2022-04-08 11:58:19,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {639#true} assume true; {639#true} is VALID [2022-04-08 11:58:19,003 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {639#true} {639#true} #84#return; {639#true} is VALID [2022-04-08 11:58:19,003 INFO L272 TraceCheckUtils]: 17: Hoare triple {639#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {639#true} is VALID [2022-04-08 11:58:19,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {639#true} ~cond := #in~cond; {639#true} is VALID [2022-04-08 11:58:19,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {639#true} assume !(0 == ~cond); {639#true} is VALID [2022-04-08 11:58:19,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {639#true} assume true; {639#true} is VALID [2022-04-08 11:58:19,004 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {639#true} {639#true} #86#return; {639#true} is VALID [2022-04-08 11:58:19,004 INFO L272 TraceCheckUtils]: 22: Hoare triple {639#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {639#true} is VALID [2022-04-08 11:58:19,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {639#true} ~cond := #in~cond; {639#true} is VALID [2022-04-08 11:58:19,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {639#true} assume !(0 == ~cond); {639#true} is VALID [2022-04-08 11:58:19,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {639#true} assume true; {639#true} is VALID [2022-04-08 11:58:19,004 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {639#true} {639#true} #88#return; {639#true} is VALID [2022-04-08 11:58:19,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {639#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {725#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:58:19,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {725#(= main_~B~0 main_~b~0)} assume !false; {725#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:58:19,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {725#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {725#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:58:19,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {725#(= main_~B~0 main_~b~0)} assume !false; {725#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:58:19,006 INFO L272 TraceCheckUtils]: 31: Hoare triple {725#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {639#true} is VALID [2022-04-08 11:58:19,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {639#true} ~cond := #in~cond; {639#true} is VALID [2022-04-08 11:58:19,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {639#true} assume !(0 == ~cond); {639#true} is VALID [2022-04-08 11:58:19,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {639#true} assume true; {639#true} is VALID [2022-04-08 11:58:19,007 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {639#true} {725#(= main_~B~0 main_~b~0)} #90#return; {725#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:58:19,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {725#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {640#false} is VALID [2022-04-08 11:58:19,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {640#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {640#false} is VALID [2022-04-08 11:58:19,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {640#false} assume !false; {640#false} is VALID [2022-04-08 11:58:19,008 INFO L272 TraceCheckUtils]: 39: Hoare triple {640#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {640#false} is VALID [2022-04-08 11:58:19,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {640#false} ~cond := #in~cond; {640#false} is VALID [2022-04-08 11:58:19,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {640#false} assume 0 == ~cond; {640#false} is VALID [2022-04-08 11:58:19,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {640#false} assume !false; {640#false} is VALID [2022-04-08 11:58:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 11:58:19,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:58:19,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:58:19,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997583036] [2022-04-08 11:58:19,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:58:19,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411597863] [2022-04-08 11:58:19,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411597863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:58:19,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:58:19,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:58:19,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:58:19,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1995930667] [2022-04-08 11:58:19,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1995930667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:58:19,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:58:19,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:58:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881049257] [2022-04-08 11:58:19,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:58:19,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-08 11:58:19,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:58:19,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 11:58:19,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:58:19,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:58:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:58:19,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:58:19,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:58:19,044 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 11:58:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:58:19,097 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-08 11:58:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:58:19,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-08 11:58:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:58:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 11:58:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 11:58:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 11:58:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 11:58:19,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-08 11:58:19,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:58:19,138 INFO L225 Difference]: With dead ends: 61 [2022-04-08 11:58:19,138 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 11:58:19,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-08 11:58:19,139 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:58:19,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:58:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 11:58:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 11:58:19,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:58:19,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:58:19,150 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:58:19,150 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:58:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:58:19,152 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-08 11:58:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 11:58:19,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:58:19,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:58:19,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-08 11:58:19,153 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-08 11:58:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:58:19,154 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-08 11:58:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 11:58:19,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:58:19,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:58:19,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:58:19,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:58:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:58:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 11:58:19,157 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 43 [2022-04-08 11:58:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:58:19,157 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 11:58:19,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 11:58:19,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 11:58:19,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:58:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 11:58:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 11:58:19,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:58:19,199 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-08 11:58:19,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 11:58:19,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 11:58:19,419 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:58:19,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:58:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash 866494938, now seen corresponding path program 1 times [2022-04-08 11:58:19,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:58:19,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145199251] [2022-04-08 11:58:19,420 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:58:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash 866494938, now seen corresponding path program 2 times [2022-04-08 11:58:19,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:58:19,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090650196] [2022-04-08 11:58:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:58:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:58:19,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:58:19,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483880029] [2022-04-08 11:58:19,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:58:19,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:58:19,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:58:19,437 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-08 11:58:19,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process