/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-6c470ae [2022-02-15 01:46:20,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 01:46:20,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 01:46:20,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 01:46:20,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 01:46:20,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 01:46:20,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 01:46:20,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 01:46:20,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 01:46:20,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 01:46:20,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 01:46:20,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 01:46:20,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 01:46:20,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 01:46:20,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 01:46:20,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 01:46:20,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 01:46:20,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 01:46:20,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 01:46:20,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 01:46:20,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 01:46:20,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 01:46:20,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 01:46:20,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 01:46:20,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 01:46:20,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 01:46:20,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 01:46:20,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 01:46:20,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 01:46:20,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 01:46:20,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 01:46:20,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 01:46:20,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 01:46:20,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 01:46:20,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 01:46:20,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 01:46:20,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 01:46:20,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 01:46:20,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 01:46:20,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 01:46:20,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 01:46:20,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 01:46:20,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 01:46:20,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 01:46:20,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 01:46:20,287 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 01:46:20,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 01:46:20,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 01:46:20,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 01:46:20,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 01:46:20,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 01:46:20,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 01:46:20,289 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 01:46:20,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 01:46:20,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 01:46:20,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 01:46:20,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 01:46:20,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 01:46:20,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 01:46:20,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 01:46:20,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:46:20,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 01:46:20,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 01:46:20,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 01:46:20,291 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 01:46:20,291 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-02-15 01:46:20,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 01:46:20,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 01:46:20,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 01:46:20,569 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 01:46:20,571 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 01:46:20,572 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-02-15 01:46:20,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef610a24/934571ed79a74a1f907c612612914a8a/FLAG74baca456 [2022-02-15 01:46:21,088 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 01:46:21,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-02-15 01:46:21,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef610a24/934571ed79a74a1f907c612612914a8a/FLAG74baca456 [2022-02-15 01:46:21,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef610a24/934571ed79a74a1f907c612612914a8a [2022-02-15 01:46:21,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 01:46:21,122 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 01:46:21,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 01:46:21,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 01:46:21,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 01:46:21,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:46:21" (1/1) ... [2022-02-15 01:46:21,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb8fd6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21, skipping insertion in model container [2022-02-15 01:46:21,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:46:21" (1/1) ... [2022-02-15 01:46:21,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 01:46:21,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 01:46:21,328 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-02-15 01:46:21,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:46:21,372 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 01:46:21,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c[368,381] [2022-02-15 01:46:21,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:46:21,397 INFO L208 MainTranslator]: Completed translation [2022-02-15 01:46:21,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21 WrapperNode [2022-02-15 01:46:21,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 01:46:21,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 01:46:21,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 01:46:21,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 01:46:21,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21" (1/1) ... [2022-02-15 01:46:21,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21" (1/1) ... [2022-02-15 01:46:21,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21" (1/1) ... [2022-02-15 01:46:21,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21" (1/1) ... [2022-02-15 01:46:21,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21" (1/1) ... [2022-02-15 01:46:21,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21" (1/1) ... [2022-02-15 01:46:21,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21" (1/1) ... [2022-02-15 01:46:21,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 01:46:21,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 01:46:21,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 01:46:21,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 01:46:21,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21" (1/1) ... [2022-02-15 01:46:21,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:46:21,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 01:46:21,477 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-02-15 01:46:21,502 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-02-15 01:46:21,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 01:46:21,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 01:46:21,525 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 01:46:21,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-15 01:46:21,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 01:46:21,525 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 01:46:21,526 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 01:46:21,526 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 01:46:21,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 01:46:21,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-15 01:46:21,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 01:46:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 01:46:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 01:46:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 01:46:21,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 01:46:21,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 01:46:21,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 01:46:21,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 01:46:21,589 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 01:46:21,591 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 01:46:21,689 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 01:46:21,694 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 01:46:21,694 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-15 01:46:21,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:46:21 BoogieIcfgContainer [2022-02-15 01:46:21,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 01:46:21,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 01:46:21,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 01:46:21,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 01:46:21,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:46:21" (1/3) ... [2022-02-15 01:46:21,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b7bc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:46:21, skipping insertion in model container [2022-02-15 01:46:21,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:46:21" (2/3) ... [2022-02-15 01:46:21,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b7bc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:46:21, skipping insertion in model container [2022-02-15 01:46:21,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:46:21" (3/3) ... [2022-02-15 01:46:21,705 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de20.c [2022-02-15 01:46:21,709 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 01:46:21,709 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 01:46:21,757 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 01:46:21,762 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-02-15 01:46:21,763 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 01:46:21,773 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-02-15 01:46:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-15 01:46:21,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:46:21,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:46:21,780 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:46:21,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:46:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 1 times [2022-02-15 01:46:21,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:46:21,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2126366499] [2022-02-15 01:46:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:46:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:46:21,850 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:46:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:46:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:46:22,176 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:46:22,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2126366499] [2022-02-15 01:46:22,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2126366499] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:46:22,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:46:22,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 01:46:22,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198562774] [2022-02-15 01:46:22,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:46:22,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 01:46:22,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:46:22,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 01:46:22,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 01:46:22,211 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-02-15 01:46:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:46:22,403 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-02-15 01:46:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 01:46:22,408 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-02-15 01:46:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:46:22,413 INFO L225 Difference]: With dead ends: 46 [2022-02-15 01:46:22,414 INFO L226 Difference]: Without dead ends: 17 [2022-02-15 01:46:22,417 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-02-15 01:46:22,421 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-15 01:46:22,422 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-02-15 01:46:22,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-15 01:46:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-15 01:46:22,450 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-02-15 01:46:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-15 01:46:22,451 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-02-15 01:46:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:46:22,452 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-15 01:46:22,452 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-02-15 01:46:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-15 01:46:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-15 01:46:22,454 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:46:22,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:46:22,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 01:46:22,455 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:46:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:46:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 1 times [2022-02-15 01:46:22,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:46:22,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [221696362] [2022-02-15 01:46:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:46:22,630 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:46:22,631 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:46:22,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:46:22,647 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-02-15 01:46:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:22,712 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-02-15 01:46:22,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:46:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:46:22,893 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:46:22,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [221696362] [2022-02-15 01:46:22,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [221696362] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:46:22,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:46:22,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 01:46:22,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875064433] [2022-02-15 01:46:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:46:22,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 01:46:22,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:46:22,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 01:46:22,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-15 01:46:22,896 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-02-15 01:46:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:46:22,974 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-02-15 01:46:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 01:46:22,975 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-02-15 01:46:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:46:22,976 INFO L225 Difference]: With dead ends: 23 [2022-02-15 01:46:22,977 INFO L226 Difference]: Without dead ends: 15 [2022-02-15 01:46:22,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-15 01:46:22,983 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-02-15 01:46:22,984 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-02-15 01:46:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-15 01:46:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-15 01:46:22,996 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-02-15 01:46:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-02-15 01:46:22,996 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-02-15 01:46:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:46:22,997 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-02-15 01:46:22,997 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-02-15 01:46:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-15 01:46:22,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-15 01:46:22,998 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:46:22,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:46:22,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 01:46:22,998 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:46:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:46:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 1 times [2022-02-15 01:46:22,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:46:22,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [528824638] [2022-02-15 01:46:22,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:46:23,108 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:46:23,109 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:46:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:46:23,116 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-02-15 01:46:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:23,142 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-02-15 01:46:23,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:46:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:46:24,214 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:46:24,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [528824638] [2022-02-15 01:46:24,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [528824638] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:46:24,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:46:24,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 01:46:24,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762128893] [2022-02-15 01:46:24,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:46:24,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 01:46:24,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:46:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 01:46:24,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-15 01:46:24,217 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-02-15 01:46:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:46:26,560 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-15 01:46:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 01:46:26,561 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-02-15 01:46:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:46:26,562 INFO L225 Difference]: With dead ends: 22 [2022-02-15 01:46:26,562 INFO L226 Difference]: Without dead ends: 17 [2022-02-15 01:46:26,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-02-15 01:46:26,563 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-02-15 01:46:26,564 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-02-15 01:46:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-15 01:46:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-15 01:46:26,568 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-02-15 01:46:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-15 01:46:26,569 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-02-15 01:46:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:46:26,569 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-15 01:46:26,569 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-02-15 01:46:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-15 01:46:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-15 01:46:26,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:46:26,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:46:26,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 01:46:26,570 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:46:26,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:46:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 1 times [2022-02-15 01:46:26,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:46:26,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [549940887] [2022-02-15 01:46:26,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:46:26,626 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:46:26,626 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:46:26,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:46:26,634 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-02-15 01:46:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:26,670 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-02-15 01:46:26,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:46:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:46:27,598 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:46:27,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [549940887] [2022-02-15 01:46:27,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [549940887] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:46:27,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:46:27,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 01:46:27,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772189489] [2022-02-15 01:46:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:46:27,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 01:46:27,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:46:27,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 01:46:27,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-15 01:46:27,600 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-02-15 01:46:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:46:28,434 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-02-15 01:46:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 01:46:28,436 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-02-15 01:46:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:46:28,436 INFO L225 Difference]: With dead ends: 23 [2022-02-15 01:46:28,436 INFO L226 Difference]: Without dead ends: 18 [2022-02-15 01:46:28,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-02-15 01:46:28,438 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-15 01:46:28,438 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-02-15 01:46:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-15 01:46:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-02-15 01:46:28,450 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-02-15 01:46:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-02-15 01:46:28,451 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-02-15 01:46:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:46:28,451 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-15 01:46:28,451 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-02-15 01:46:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-15 01:46:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 01:46:28,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:46:28,452 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:46:28,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 01:46:28,453 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:46:28,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:46:28,453 INFO L85 PathProgramCache]: Analyzing trace with hash -834915316, now seen corresponding path program 2 times [2022-02-15 01:46:28,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:46:28,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719641726] [2022-02-15 01:46:28,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:46:28,528 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:46:28,529 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:46:28,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:46:28,535 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-02-15 01:46:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:28,587 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-02-15 01:46:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:46:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:46:29,195 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:46:29,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719641726] [2022-02-15 01:46:29,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1719641726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:46:29,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:46:29,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 01:46:29,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638295196] [2022-02-15 01:46:29,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:46:29,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 01:46:29,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:46:29,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 01:46:29,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:46:29,197 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-02-15 01:46:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:46:29,663 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-15 01:46:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 01:46:29,665 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-02-15 01:46:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:46:29,666 INFO L225 Difference]: With dead ends: 24 [2022-02-15 01:46:29,666 INFO L226 Difference]: Without dead ends: 19 [2022-02-15 01:46:29,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-02-15 01:46:29,667 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-02-15 01:46:29,668 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-02-15 01:46:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-15 01:46:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-15 01:46:29,678 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-02-15 01:46:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-15 01:46:29,678 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-02-15 01:46:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:46:29,678 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-15 01:46:29,679 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-02-15 01:46:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-15 01:46:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 01:46:29,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:46:29,679 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:46:29,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 01:46:29,680 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:46:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:46:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash -78075946, now seen corresponding path program 3 times [2022-02-15 01:46:29,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:46:29,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [985254529] [2022-02-15 01:46:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:46:29,726 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:46:29,727 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:46:29,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:46:29,744 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-02-15 01:46:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:29,802 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-02-15 01:46:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:46:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:46:32,807 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:46:32,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [985254529] [2022-02-15 01:46:32,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [985254529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:46:32,808 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:46:32,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 01:46:32,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458979307] [2022-02-15 01:46:32,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:46:32,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 01:46:32,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:46:32,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 01:46:32,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-15 01:46:32,809 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-02-15 01:46:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:46:33,809 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-02-15 01:46:33,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 01:46:33,809 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-02-15 01:46:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:46:33,810 INFO L225 Difference]: With dead ends: 25 [2022-02-15 01:46:33,810 INFO L226 Difference]: Without dead ends: 20 [2022-02-15 01:46:33,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-02-15 01:46:33,811 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-02-15 01:46:33,812 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-02-15 01:46:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-15 01:46:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-15 01:46:33,818 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-02-15 01:46:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-15 01:46:33,822 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2022-02-15 01:46:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:46:33,844 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-15 01:46:33,846 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-02-15 01:46:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-15 01:46:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 01:46:33,846 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:46:33,847 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:46:33,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 01:46:33,847 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:46:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:46:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1909108044, now seen corresponding path program 4 times [2022-02-15 01:46:33,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:46:33,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188954280] [2022-02-15 01:46:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:46:33,892 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:46:33,893 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:46:33,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:46:33,908 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-02-15 01:46:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:33,951 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-02-15 01:46:34,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:46:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:46:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:46:34,617 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:46:34,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188954280] [2022-02-15 01:46:34,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [188954280] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:46:34,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:46:34,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 01:46:34,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331110293] [2022-02-15 01:46:34,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:46:34,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 01:46:34,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:46:34,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 01:46:34,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-02-15 01:46:34,623 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-02-15 01:46:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:46:37,004 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-15 01:46:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 01:46:37,004 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-02-15 01:46:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:46:37,004 INFO L225 Difference]: With dead ends: 20 [2022-02-15 01:46:37,005 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 01:46:37,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-02-15 01:46:37,006 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-02-15 01:46:37,006 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-02-15 01:46:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 01:46:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 01:46:37,007 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-02-15 01:46:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 01:46:37,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-15 01:46:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:46:37,008 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 01:46:37,008 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-02-15 01:46:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 01:46:37,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 01:46:37,010 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 01:46:37,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 01:46:37,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-15 01:46:40,861 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-02-15 01:46:40,863 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-02-15 01:46:40,863 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-02-15 01:46:40,863 INFO L861 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-02-15 01:46:40,863 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 12 31) the Hoare annotation is: true [2022-02-15 01:46:40,863 INFO L854 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse12 (+ main_~z~0 main_~x~0)) (.cse13 (div main_~z~0 4294967296))) (let ((.cse3 (* .cse13 4294967296)) (.cse0 (<= main_~n~0 .cse12)) (.cse2 (* (div main_~n~0 4294967296) 4294967296)) (.cse4 (* (- 1) main_~z~0)) (.cse5 (* .cse13 (- 4294967296))) (.cse1 (<= .cse12 main_~n~0))) (or (and .cse0 .cse1 (<= (+ 3 .cse2) (+ main_~x~0 .cse3))) (and .cse1 (<= (+ 2 (* (div (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0 .cse4 .cse5 4294967293) 4294967296) 4294967296)) main_~x~0)) (let ((.cse8 (* 4294967296 (div main_~x~0 4294967296)))) (let ((.cse6 (let ((.cse11 (+ main_~n~0 .cse8))) (and (<= (+ main_~x~0 .cse2) .cse11) (< .cse11 (+ main_~x~0 .cse2 1))))) (.cse7 (+ main_~y~0 .cse8)) (.cse9 (+ .cse2 1))) (and (or .cse6 (<= .cse7 (+ 4294967295 (* (div (+ (- 1) main_~y~0 .cse8) 4294967296) 4294967296)))) (or (<= (+ .cse3 1) main_~z~0) .cse6) (or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (let ((.cse10 (+ main_~y~0 main_~x~0))) (and (<= .cse9 .cse7) (<= .cse10 main_~n~0) (<= main_~n~0 .cse10)))) (or (and .cse0 .cse1 (<= .cse9 (+ main_~z~0 .cse8))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))))) (and (<= (+ (* (div (+ main_~n~0 .cse4 4294967294 .cse5 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) 4294967296) 4294967296) 1) main_~x~0) .cse1)))) [2022-02-15 01:46:40,864 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-02-15 01:46:40,866 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 12 31) the Hoare annotation is: true [2022-02-15 01:46:40,866 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 12 31) the Hoare annotation is: true [2022-02-15 01:46:40,869 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-02-15 01:46:40,869 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-02-15 01:46:40,869 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-15 01:46:40,870 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-02-15 01:46:40,870 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-15 01:46:40,870 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-15 01:46:40,870 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-15 01:46:40,870 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-15 01:46:40,871 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-15 01:46:40,871 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-02-15 01:46:40,871 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-02-15 01:46:40,873 INFO L854 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-15 01:46:40,874 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-02-15 01:46:40,874 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-02-15 01:46:40,874 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-15 01:46:40,877 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2022-02-15 01:46:40,890 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 01:46:40,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:46:40 BoogieIcfgContainer [2022-02-15 01:46:40,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 01:46:40,908 INFO L158 Benchmark]: Toolchain (without parser) took 19786.29ms. Allocated memory was 164.6MB in the beginning and 213.9MB in the end (delta: 49.3MB). Free memory was 114.8MB in the beginning and 76.1MB in the end (delta: 38.8MB). Peak memory consumption was 88.4MB. Max. memory is 8.0GB. [2022-02-15 01:46:40,908 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 164.6MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 01:46:40,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.78ms. Allocated memory was 164.6MB in the beginning and 213.9MB in the end (delta: 49.3MB). Free memory was 114.7MB in the beginning and 191.0MB in the end (delta: -76.3MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-02-15 01:46:40,909 INFO L158 Benchmark]: Boogie Preprocessor took 37.39ms. Allocated memory is still 213.9MB. Free memory was 191.0MB in the beginning and 189.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 01:46:40,909 INFO L158 Benchmark]: RCFGBuilder took 258.47ms. Allocated memory is still 213.9MB. Free memory was 189.5MB in the beginning and 179.5MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-02-15 01:46:40,910 INFO L158 Benchmark]: TraceAbstraction took 19210.61ms. Allocated memory is still 213.9MB. Free memory was 179.0MB in the beginning and 76.1MB in the end (delta: 102.9MB). Peak memory consumption was 103.4MB. Max. memory is 8.0GB. [2022-02-15 01:46:40,911 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.13ms. Allocated memory is still 164.6MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.78ms. Allocated memory was 164.6MB in the beginning and 213.9MB in the end (delta: 49.3MB). Free memory was 114.7MB in the beginning and 191.0MB in the end (delta: -76.3MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.39ms. Allocated memory is still 213.9MB. Free memory was 191.0MB in the beginning and 189.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 258.47ms. Allocated memory is still 213.9MB. Free memory was 189.5MB in the beginning and 179.5MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 19210.61ms. Allocated memory is still 213.9MB. Free memory was 179.0MB in the beginning and 76.1MB in the end (delta: 102.9MB). Peak memory consumption was 103.4MB. 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: 19.1s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 294 SdHoareTripleChecker+Invalid, 0.5s 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, 404 ImplicationChecksByTransitivity, 11.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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 63 PreInvPairs, 98 NumberOfFragments, 499 HoareAnnotationTreeSize, 63 FomulaSimplifications, 43 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 913 FormulaSimplificationTreeSizeReductionInter, 3.8s 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-02-15 01:46:40,922 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,923 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,923 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,923 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,923 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_6,QUANTIFIED] [2022-02-15 01:46:40,923 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) || (z + x <= n && 2 + ((z + 2) / 4294967296 * 4294967296 + n + -1 * z + z / 4294967296 * -4294967296 + 4294967293) / 4294967296 * 4294967296 <= x)) || (((((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) && (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 <= y + x))) && (((n <= z + x && z + x <= n) && n / 4294967296 * 4294967296 + 1 <= z + 4294967296 * (x / 4294967296)) || (z <= 0 && 0 <= z)))) || ((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-02-15 01:46:40,945 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...