/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:11:56,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:11:56,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:11:56,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:11:56,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:11:56,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:11:56,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:11:56,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:11:56,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:11:56,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:11:56,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:11:56,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:11:56,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:11:56,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:11:56,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:11:56,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:11:56,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:11:56,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:11:56,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:11:56,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:11:56,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:11:56,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:11:56,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:11:56,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:11:56,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:11:56,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:11:56,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:11:56,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:11:56,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:11:56,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:11:56,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:11:56,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:11:56,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:11:56,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:11:56,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:11:56,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:11:56,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:11:56,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:11:56,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:11:56,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:11:56,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:11:56,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:11:56,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:11:56,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:11:56,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:11:56,119 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:11:56,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:11:56,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:11:56,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:11:56,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:11:56,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:11:56,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:11:56,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:11:56,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:11:56,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:11:56,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:11:56,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:11:56,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:11:56,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:11:56,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:11:56,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:11:56,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:11:56,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:11:56,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:11:56,121 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:11:56,121 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-01-31 21:11:56,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:11:56,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:11:56,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:11:56,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:11:56,304 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:11:56,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-01-31 21:11:56,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4418946/d7329029b5dc4d7ea82e7ccb2c16d2a3/FLAGe188c0427 [2022-01-31 21:11:56,695 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:11:56,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-01-31 21:11:56,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4418946/d7329029b5dc4d7ea82e7ccb2c16d2a3/FLAGe188c0427 [2022-01-31 21:11:56,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4418946/d7329029b5dc4d7ea82e7ccb2c16d2a3 [2022-01-31 21:11:56,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:11:56,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:11:56,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:11:56,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:11:56,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:11:56,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:11:56" (1/1) ... [2022-01-31 21:11:56,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c1e5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56, skipping insertion in model container [2022-01-31 21:11:56,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:11:56" (1/1) ... [2022-01-31 21:11:56,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:11:56,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:11:56,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c[368,381] [2022-01-31 21:11:56,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:11:56,875 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:11:56,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c[368,381] [2022-01-31 21:11:56,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:11:56,891 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:11:56,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56 WrapperNode [2022-01-31 21:11:56,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:11:56,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:11:56,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:11:56,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:11:56,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56" (1/1) ... [2022-01-31 21:11:56,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56" (1/1) ... [2022-01-31 21:11:56,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56" (1/1) ... [2022-01-31 21:11:56,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56" (1/1) ... [2022-01-31 21:11:56,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56" (1/1) ... [2022-01-31 21:11:56,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56" (1/1) ... [2022-01-31 21:11:56,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56" (1/1) ... [2022-01-31 21:11:56,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:11:56,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:11:56,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:11:56,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:11:56,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56" (1/1) ... [2022-01-31 21:11:56,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:11:56,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:11:56,930 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-01-31 21:11:56,939 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-01-31 21:11:56,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:11:56,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:11:56,955 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:11:56,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:11:56,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:11:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:11:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:11:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:11:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:11:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 21:11:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:11:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:11:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:11:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:11:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:11:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:11:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:11:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:11:56,998 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:11:57,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:11:57,064 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:11:57,068 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:11:57,068 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 21:11:57,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:11:57 BoogieIcfgContainer [2022-01-31 21:11:57,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:11:57,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:11:57,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:11:57,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:11:57,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:11:56" (1/3) ... [2022-01-31 21:11:57,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c589bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:11:57, skipping insertion in model container [2022-01-31 21:11:57,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:56" (2/3) ... [2022-01-31 21:11:57,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c589bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:11:57, skipping insertion in model container [2022-01-31 21:11:57,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:11:57" (3/3) ... [2022-01-31 21:11:57,074 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de20.c [2022-01-31 21:11:57,082 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:11:57,083 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:11:57,145 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:11:57,149 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 21:11:57,150 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:11:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 21:11:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-31 21:11:57,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:11:57,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:11:57,188 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:11:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:11:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 1 times [2022-01-31 21:11:57,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:11:57,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1873913677] [2022-01-31 21:11:57,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:11:57,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:11:57,242 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:11:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:11:57,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:11:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:11:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:11:57,483 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:11:57,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1873913677] [2022-01-31 21:11:57,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1873913677] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:11:57,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:11:57,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:11:57,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161772953] [2022-01-31 21:11:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:11:57,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:11:57,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:11:57,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:11:57,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:11:57,514 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:11:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:11:57,636 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-01-31 21:11:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:11:57,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-01-31 21:11:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:11:57,643 INFO L225 Difference]: With dead ends: 46 [2022-01-31 21:11:57,643 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 21:11:57,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:11:57,648 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:11:57,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:11:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 21:11:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 21:11:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:11:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-01-31 21:11:57,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-01-31 21:11:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:11:57,669 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-01-31 21:11:57,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:11:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-01-31 21:11:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 21:11:57,670 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:11:57,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:11:57,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:11:57,671 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:11:57,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:11:57,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 1 times [2022-01-31 21:11:57,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:11:57,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [29038244] [2022-01-31 21:11:57,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:11:57,797 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:11:57,798 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:11:57,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:11:57,812 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 21:11:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:11:57,848 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 21:11:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:11:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:11:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:11:58,010 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:11:58,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [29038244] [2022-01-31 21:11:58,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [29038244] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:11:58,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:11:58,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:11:58,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058971084] [2022-01-31 21:11:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:11:58,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:11:58,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:11:58,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:11:58,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:11:58,012 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:11:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:11:58,074 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-01-31 21:11:58,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:11:58,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-01-31 21:11:58,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:11:58,075 INFO L225 Difference]: With dead ends: 23 [2022-01-31 21:11:58,075 INFO L226 Difference]: Without dead ends: 15 [2022-01-31 21:11:58,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:11:58,079 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:11:58,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 39 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:11:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-01-31 21:11:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-01-31 21:11:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:11:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-01-31 21:11:58,083 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-01-31 21:11:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:11:58,083 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-01-31 21:11:58,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:11:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-01-31 21:11:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 21:11:58,083 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:11:58,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:11:58,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:11:58,084 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:11:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:11:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 1 times [2022-01-31 21:11:58,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:11:58,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246839736] [2022-01-31 21:11:58,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:11:58,176 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:11:58,177 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:11:58,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:11:58,182 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:11:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:11:58,222 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:11:58,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:11:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:11:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:11:59,148 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:11:59,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246839736] [2022-01-31 21:11:59,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1246839736] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:11:59,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:11:59,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:11:59,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4722263] [2022-01-31 21:11:59,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:11:59,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:11:59,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:11:59,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:11:59,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:11:59,150 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:01,477 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-01-31 21:12:01,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:12:01,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-01-31 21:12:01,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:01,478 INFO L225 Difference]: With dead ends: 22 [2022-01-31 21:12:01,478 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 21:12:01,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:12:01,480 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:01,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-01-31 21:12:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 21:12:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-01-31 21:12:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-01-31 21:12:01,484 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-01-31 21:12:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:01,484 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-01-31 21:12:01,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-01-31 21:12:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 21:12:01,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:01,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:01,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:12:01,485 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:01,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 1 times [2022-01-31 21:12:01,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:01,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1481355261] [2022-01-31 21:12:01,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:01,562 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:01,563 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:01,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:01,570 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:01,592 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:01,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:02,128 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:02,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1481355261] [2022-01-31 21:12:02,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1481355261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:02,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:02,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:12:02,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837861055] [2022-01-31 21:12:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:02,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:12:02,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:02,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:12:02,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:12:02,129 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:02,369 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-01-31 21:12:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:12:02,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 21:12:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:02,370 INFO L225 Difference]: With dead ends: 23 [2022-01-31 21:12:02,370 INFO L226 Difference]: Without dead ends: 18 [2022-01-31 21:12:02,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:12:02,371 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:02,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-01-31 21:12:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-31 21:12:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-01-31 21:12:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-01-31 21:12:02,376 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-01-31 21:12:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:02,376 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-01-31 21:12:02,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-01-31 21:12:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 21:12:02,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:02,376 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:02,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:12:02,377 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:02,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash -834915316, now seen corresponding path program 2 times [2022-01-31 21:12:02,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:02,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [703543547] [2022-01-31 21:12:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:02,427 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:02,427 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:02,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:02,435 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:12:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:02,465 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.6))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:12:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:02,864 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:02,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [703543547] [2022-01-31 21:12:02,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [703543547] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:02,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:02,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:12:02,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067038515] [2022-01-31 21:12:02,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:02,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:12:02,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:02,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:12:02,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:12:02,866 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:04,086 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-01-31 21:12:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:12:04,091 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 21:12:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:04,092 INFO L225 Difference]: With dead ends: 24 [2022-01-31 21:12:04,092 INFO L226 Difference]: Without dead ends: 19 [2022-01-31 21:12:04,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:12:04,093 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:04,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 51 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 71 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-01-31 21:12:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-31 21:12:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-01-31 21:12:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-01-31 21:12:04,098 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-01-31 21:12:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:04,098 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-01-31 21:12:04,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-01-31 21:12:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:12:04,099 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:04,099 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:04,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:12:04,099 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash -78075946, now seen corresponding path program 3 times [2022-01-31 21:12:04,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:04,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1348194186] [2022-01-31 21:12:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:04,155 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:04,155 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:04,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:04,159 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:04,195 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.7))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:09,965 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:09,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1348194186] [2022-01-31 21:12:09,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1348194186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:09,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:09,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:12:09,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624798454] [2022-01-31 21:12:09,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:09,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:12:09,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:09,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:12:09,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:12:09,967 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:10,779 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-01-31 21:12:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:12:10,779 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 21:12:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:10,779 INFO L225 Difference]: With dead ends: 25 [2022-01-31 21:12:10,779 INFO L226 Difference]: Without dead ends: 20 [2022-01-31 21:12:10,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:12:10,780 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:10,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 41 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 68 Invalid, 0 Unknown, 13 Unchecked, 0.1s Time] [2022-01-31 21:12:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-31 21:12:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-01-31 21:12:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-01-31 21:12:10,787 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2022-01-31 21:12:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:10,787 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-01-31 21:12:10,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-01-31 21:12:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:12:10,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:12:10,788 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:12:10,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:12:10,788 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:12:10,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:12:10,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1909108044, now seen corresponding path program 4 times [2022-01-31 21:12:10,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:12:10,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1548190344] [2022-01-31 21:12:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:12:10,832 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:12:10,832 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:12:10,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:12:10,839 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:10,868 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:12:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:12:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:12:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:12:11,376 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:12:11,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1548190344] [2022-01-31 21:12:11,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1548190344] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:12:11,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:12:11,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:12:11,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989218617] [2022-01-31 21:12:11,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:12:11,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:12:11,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:12:11,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:12:11,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:12:11,377 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:12:12,097 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-01-31 21:12:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:12:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 21:12:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:12:12,097 INFO L225 Difference]: With dead ends: 20 [2022-01-31 21:12:12,098 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 21:12:12,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:12:12,099 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:12:12,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 5 Unchecked, 0.1s Time] [2022-01-31 21:12:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 21:12:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 21:12:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 21:12:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 21:12:12,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-01-31 21:12:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:12:12,100 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 21:12:12,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:12:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 21:12:12,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 21:12:12,102 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 21:12:12,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:12:12,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 21:12:24,089 WARN L228 SmtUtils]: Spent 9.85s on a formula simplification. DAG size of input: 151 DAG size of output: 84 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 21:12:24,202 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-01-31 21:12:24,202 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-01-31 21:12:24,202 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-01-31 21:12:24,203 INFO L861 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-01-31 21:12:24,203 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 12 31) the Hoare annotation is: true [2022-01-31 21:12:24,203 INFO L854 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse11 (+ main_~z~0 main_~x~0)) (.cse12 (div main_~z~0 4294967296))) (let ((.cse3 (* .cse12 4294967296)) (.cse0 (<= main_~n~0 .cse11)) (.cse2 (* (div main_~n~0 4294967296) 4294967296)) (.cse9 (* (- 1) main_~z~0)) (.cse10 (* .cse12 (- 4294967296))) (.cse1 (<= .cse11 main_~n~0))) (or (and .cse0 .cse1 (<= (+ 3 .cse2) (+ main_~x~0 .cse3))) (let ((.cse6 (* 4294967296 (div main_~x~0 4294967296)))) (let ((.cse4 (let ((.cse8 (+ main_~n~0 .cse6))) (and (<= (+ main_~x~0 .cse2) .cse8) (< .cse8 (+ main_~x~0 .cse2 1))))) (.cse5 (+ main_~y~0 .cse6)) (.cse7 (+ .cse2 1))) (and (or .cse4 (<= .cse5 (+ 4294967295 (* (div (+ (- 1) main_~y~0 .cse6) 4294967296) 4294967296)))) (or (<= main_~n~0 .cse5) (= main_~y~0 0)) (or (<= (+ .cse3 1) main_~z~0) .cse4) (or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= .cse7 .cse5) (<= (+ main_~y~0 main_~x~0) main_~n~0))) (or (and .cse0 .cse1 (<= .cse7 (+ main_~z~0 .cse6))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))))) (and .cse1 (<= (+ 2 (* (div (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0 .cse9 .cse10 4294967293) 4294967296) 4294967296)) main_~x~0)) (and (<= (+ (* (div (+ main_~n~0 .cse9 4294967294 .cse10 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296) 1) main_~x~0) .cse1)))) [2022-01-31 21:12:24,203 INFO L854 garLoopResultBuilder]: At program point L23-3(lines 23 27) the Hoare annotation is: (let ((.cse1 (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (.cse0 (* (div main_~n~0 4294967296) 4294967296))) (and (<= (+ main_~x~0 .cse0) .cse1) (< .cse1 (+ main_~x~0 .cse0 1)))) [2022-01-31 21:12:24,203 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 12 31) the Hoare annotation is: true [2022-01-31 21:12:24,203 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 12 31) the Hoare annotation is: true [2022-01-31 21:12:24,203 INFO L854 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: (or (let ((.cse0 (+ main_~x~0 1))) (and (< 0 (mod .cse0 4294967296)) (or (and (< .cse0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (forall ((v_it_6 Int)) (or (not (<= (+ v_it_6 main_~x~0 2) main_~n~0)) (not (<= 1 v_it_6)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= .cse0 main_~n~0) (= main_~y~0 1))))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) [2022-01-31 21:12:24,203 INFO L854 garLoopResultBuilder]: At program point L16-3(lines 16 20) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~x~0 4294967296)))) (let ((.cse0 (* (div main_~n~0 4294967296) 4294967296)) (.cse3 (+ main_~y~0 .cse2))) (and (or (let ((.cse1 (+ main_~n~0 .cse2))) (and (<= (+ main_~x~0 .cse0) .cse1) (< .cse1 (+ main_~x~0 .cse0 1)))) (<= .cse3 (+ 4294967295 (* (div (+ (- 1) main_~y~0 .cse2) 4294967296) 4294967296)))) (or (<= main_~n~0 .cse3) (= main_~y~0 0)) (or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ .cse0 1) .cse3) (<= (+ main_~y~0 main_~x~0) main_~n~0)))))) [2022-01-31 21:12:24,204 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 21:12:24,204 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 21:12:24,204 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 21:12:24,204 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 21:12:24,204 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 21:12:24,204 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 21:12:24,204 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 21:12:24,204 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-01-31 21:12:24,204 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 21:12:24,204 INFO L854 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 21:12:24,204 INFO L854 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 21:12:24,204 INFO L854 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 21:12:24,205 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 21:12:24,207 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2022-01-31 21:12:24,207 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 21:12:24,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:12:24 BoogieIcfgContainer [2022-01-31 21:12:24,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 21:12:24,234 INFO L158 Benchmark]: Toolchain (without parser) took 27519.50ms. Allocated memory was 181.4MB in the beginning and 239.1MB in the end (delta: 57.7MB). Free memory was 124.7MB in the beginning and 143.8MB in the end (delta: -19.1MB). Peak memory consumption was 39.4MB. Max. memory is 8.0GB. [2022-01-31 21:12:24,234 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 21:12:24,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.44ms. Allocated memory was 181.4MB in the beginning and 239.1MB in the end (delta: 57.7MB). Free memory was 124.5MB in the beginning and 211.0MB in the end (delta: -86.5MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-01-31 21:12:24,239 INFO L158 Benchmark]: Boogie Preprocessor took 16.06ms. Allocated memory is still 239.1MB. Free memory was 211.0MB in the beginning and 209.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 21:12:24,239 INFO L158 Benchmark]: RCFGBuilder took 159.87ms. Allocated memory is still 239.1MB. Free memory was 209.9MB in the beginning and 199.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-31 21:12:24,240 INFO L158 Benchmark]: TraceAbstraction took 27163.35ms. Allocated memory is still 239.1MB. Free memory was 198.9MB in the beginning and 143.8MB in the end (delta: 55.1MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. [2022-01-31 21:12:24,240 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.44ms. Allocated memory was 181.4MB in the beginning and 239.1MB in the end (delta: 57.7MB). Free memory was 124.5MB in the beginning and 211.0MB in the end (delta: -86.5MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.06ms. Allocated memory is still 239.1MB. Free memory was 211.0MB in the beginning and 209.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 159.87ms. Allocated memory is still 239.1MB. Free memory was 209.9MB in the beginning and 199.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 27163.35ms. Allocated memory is still 239.1MB. Free memory was 198.9MB in the beginning and 143.8MB in the end (delta: 55.1MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.1s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 294 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 64 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 71 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 63 PreInvPairs, 98 NumberOfFragments, 507 HoareAnnotationTreeSize, 63 FomulaSimplifications, 43 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 905 FormulaSimplificationTreeSizeReductionInter, 12.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2022-01-31 21:12:24,244 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-01-31 21:12:24,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] Derived loop invariant: (0 < (x + 1) % 4294967296 && ((((x + 1 < n && 0 < n % 4294967296) && (forall v_it_6 : int :: (!(v_it_6 + x + 2 <= n) || !(1 <= v_it_6)) || 0 < (n + v_it_6 * 4294967295) % 4294967296)) && n == y + x) || (x + 1 == n && y == 1))) || (n == x && y == 0) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((n <= z + x && z + x <= n) && 3 + n / 4294967296 * 4294967296 <= x + z / 4294967296 * 4294967296) || ((((((x + n / 4294967296 * 4294967296 <= n + 4294967296 * (x / 4294967296) && n + 4294967296 * (x / 4294967296) < x + n / 4294967296 * 4294967296 + 1) || y + 4294967296 * (x / 4294967296) <= 4294967295 + (-1 + y + 4294967296 * (x / 4294967296)) / 4294967296 * 4294967296) && (n <= y + 4294967296 * (x / 4294967296) || y == 0)) && (z / 4294967296 * 4294967296 + 1 <= z || (x + n / 4294967296 * 4294967296 <= n + 4294967296 * (x / 4294967296) && n + 4294967296 * (x / 4294967296) < x + n / 4294967296 * 4294967296 + 1))) && ((0 <= y && y <= 0) || (n / 4294967296 * 4294967296 + 1 <= y + 4294967296 * (x / 4294967296) && y + x <= n))) && (((n <= z + x && z + x <= n) && n / 4294967296 * 4294967296 + 1 <= z + 4294967296 * (x / 4294967296)) || (z <= 0 && 0 <= z)))) || (z + x <= n && 2 + ((z + 2) / 4294967296 * 4294967296 + n + -1 * z + z / 4294967296 * -4294967296 + 4294967293) / 4294967296 * 4294967296 <= x)) || ((n + -1 * z + 4294967294 + z / 4294967296 * -4294967296 + (z + 1) / 4294967296 * 4294967296) / 4294967296 * 4294967296 + 1 <= x && z + x <= n) - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-01-31 21:12:24,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...