/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/mono-crafted_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:22:14,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:22:14,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:22:14,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:22:14,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:22:14,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:22:14,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:22:14,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:22:14,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:22:14,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:22:14,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:22:14,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:22:14,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:22:14,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:22:14,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:22:14,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:22:14,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:22:14,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:22:14,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:22:14,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:22:14,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:22:14,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:22:14,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:22:14,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:22:14,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:22:14,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:22:14,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:22:14,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:22:14,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:22:14,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:22:14,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:22:14,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:22:14,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:22:14,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:22:14,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:22:14,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:22:14,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:22:14,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:22:14,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:22:14,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:22:14,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:22:14,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:22:14,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:22:14,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:22:14,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:22:14,677 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:22:14,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:22:14,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:22:14,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:22:14,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:22:14,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:22:14,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:22:14,678 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:22:14,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:22:14,678 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:22:14,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:22:14,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:22:14,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:22:14,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:22:14,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:22:14,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:22:14,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:22:14,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:22:14,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:22:14,679 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:22:14,679 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 21:22:14,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:22:14,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:22:14,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:22:14,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:22:14,864 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:22:14,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-01-31 21:22:14,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd65dadae/bcc7735744414a15be8dc87ff1f945df/FLAGbfe86bc0f [2022-01-31 21:22:15,257 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:22:15,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-01-31 21:22:15,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd65dadae/bcc7735744414a15be8dc87ff1f945df/FLAGbfe86bc0f [2022-01-31 21:22:15,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd65dadae/bcc7735744414a15be8dc87ff1f945df [2022-01-31 21:22:15,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:22:15,290 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:22:15,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:22:15,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:22:15,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:22:15,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:22:15" (1/1) ... [2022-01-31 21:22:15,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245b07d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15, skipping insertion in model container [2022-01-31 21:22:15,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:22:15" (1/1) ... [2022-01-31 21:22:15,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:22:15,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:22:15,403 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/mono-crafted_11.c[319,332] [2022-01-31 21:22:15,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:22:15,452 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:22:15,459 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/mono-crafted_11.c[319,332] [2022-01-31 21:22:15,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:22:15,468 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:22:15,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15 WrapperNode [2022-01-31 21:22:15,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:22:15,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:22:15,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:22:15,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:22:15,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15" (1/1) ... [2022-01-31 21:22:15,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15" (1/1) ... [2022-01-31 21:22:15,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15" (1/1) ... [2022-01-31 21:22:15,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15" (1/1) ... [2022-01-31 21:22:15,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15" (1/1) ... [2022-01-31 21:22:15,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15" (1/1) ... [2022-01-31 21:22:15,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15" (1/1) ... [2022-01-31 21:22:15,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:22:15,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:22:15,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:22:15,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:22:15,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15" (1/1) ... [2022-01-31 21:22:15,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:22:15,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:22:15,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 21:22:15,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 21:22:15,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:22:15,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:22:15,538 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:22:15,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:22:15,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:22:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:22:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:22:15,588 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:22:15,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:22:15,662 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:22:15,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:22:15,665 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 21:22:15,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:22:15 BoogieIcfgContainer [2022-01-31 21:22:15,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:22:15,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:22:15,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:22:15,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:22:15,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:22:15" (1/3) ... [2022-01-31 21:22:15,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6409ea9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:22:15, skipping insertion in model container [2022-01-31 21:22:15,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:15" (2/3) ... [2022-01-31 21:22:15,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6409ea9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:22:15, skipping insertion in model container [2022-01-31 21:22:15,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:22:15" (3/3) ... [2022-01-31 21:22:15,690 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2022-01-31 21:22:15,693 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:22:15,693 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:22:15,726 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:22:15,739 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-01-31 21:22:15,739 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:22:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 21:22:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 21:22:15,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:15,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:15,762 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:15,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2022-01-31 21:22:15,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:15,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945814013] [2022-01-31 21:22:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:15,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:15,814 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:22:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:15,920 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:15,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [945814013] [2022-01-31 21:22:15,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [945814013] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:15,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:15,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 21:22:15,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416036648] [2022-01-31 21:22:15,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:15,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 21:22:15,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:15,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 21:22:15,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 21:22:15,956 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:15,996 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-01-31 21:22:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 21:22:15,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-01-31 21:22:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:16,002 INFO L225 Difference]: With dead ends: 32 [2022-01-31 21:22:16,002 INFO L226 Difference]: Without dead ends: 13 [2022-01-31 21:22:16,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 21:22:16,010 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:16,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:22:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-01-31 21:22:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-01-31 21:22:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-01-31 21:22:16,035 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-01-31 21:22:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:16,036 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-01-31 21:22:16,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-01-31 21:22:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 21:22:16,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:16,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:16,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:22:16,038 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-01-31 21:22:16,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:16,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [688007475] [2022-01-31 21:22:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:16,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:16,046 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:22:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:16,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:16,141 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:16,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [688007475] [2022-01-31 21:22:16,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [688007475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:16,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:16,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 21:22:16,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775209240] [2022-01-31 21:22:16,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:16,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 21:22:16,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:16,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 21:22:16,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 21:22:16,143 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:16,178 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-01-31 21:22:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 21:22:16,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-01-31 21:22:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:16,181 INFO L225 Difference]: With dead ends: 22 [2022-01-31 21:22:16,181 INFO L226 Difference]: Without dead ends: 15 [2022-01-31 21:22:16,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:22:16,185 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:16,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:22:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-01-31 21:22:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-01-31 21:22:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-01-31 21:22:16,193 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-01-31 21:22:16,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:16,195 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-01-31 21:22:16,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-01-31 21:22:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-31 21:22:16,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:16,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:16,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:22:16,196 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:16,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2022-01-31 21:22:16,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:16,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [329966060] [2022-01-31 21:22:16,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:16,319 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:16,325 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:16,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:16,516 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:16,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [329966060] [2022-01-31 21:22:16,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [329966060] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:16,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:16,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:22:16,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002658541] [2022-01-31 21:22:16,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:16,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:22:16,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:16,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:22:16,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:22:16,518 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:16,606 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-01-31 21:22:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:22:16,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-01-31 21:22:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:16,607 INFO L225 Difference]: With dead ends: 22 [2022-01-31 21:22:16,607 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 21:22:16,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:22:16,614 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:16,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:22:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 21:22:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 21:22:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-01-31 21:22:16,627 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-01-31 21:22:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:16,627 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-01-31 21:22:16,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-01-31 21:22:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 21:22:16,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:16,627 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:16,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:22:16,628 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:16,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:16,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1059749499, now seen corresponding path program 1 times [2022-01-31 21:22:16,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:16,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [417480467] [2022-01-31 21:22:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:16,755 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:16,755 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:16,810 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:17,274 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:17,275 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:17,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:17,284 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_4.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_4.0) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:22:17,286 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_4.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_4.0) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:22:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:17,351 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_4.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_4.1) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:22:17,351 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_4.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_4.1) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:22:17,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:19,731 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:19,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [417480467] [2022-01-31 21:22:19,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [417480467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:19,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:19,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:22:19,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598407379] [2022-01-31 21:22:19,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:19,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:22:19,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:19,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:22:19,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:22:19,733 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:19,992 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-01-31 21:22:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:22:19,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 21:22:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:19,993 INFO L225 Difference]: With dead ends: 31 [2022-01-31 21:22:19,993 INFO L226 Difference]: Without dead ends: 21 [2022-01-31 21:22:19,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:22:19,994 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:19,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:22:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-31 21:22:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-31 21:22:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-01-31 21:22:19,999 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-01-31 21:22:19,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:19,999 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-01-31 21:22:19,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-01-31 21:22:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 21:22:20,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:20,000 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:20,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:22:20,000 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:20,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1662437453, now seen corresponding path program 2 times [2022-01-31 21:22:20,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:20,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1977500232] [2022-01-31 21:22:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:20,088 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:20,167 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:20,167 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:20,227 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:20,403 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:20,404 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:20,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:20,410 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_8.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_8.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:20,410 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_8.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_8.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:20,441 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_8.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_8.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:20,441 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_8.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_8.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:20,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:20,864 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:20,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1977500232] [2022-01-31 21:22:20,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1977500232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:20,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:20,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:22:20,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176421484] [2022-01-31 21:22:20,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:20,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:22:20,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:20,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:22:20,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:22:20,865 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:21,141 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-01-31 21:22:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:22:21,141 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 19 [2022-01-31 21:22:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:21,142 INFO L225 Difference]: With dead ends: 30 [2022-01-31 21:22:21,142 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 21:22:21,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:22:21,143 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:21,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 43 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:22:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 21:22:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-31 21:22:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-01-31 21:22:21,148 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2022-01-31 21:22:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:21,148 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-01-31 21:22:21,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-01-31 21:22:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 21:22:21,148 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:21,148 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:21,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:22:21,149 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash 361874638, now seen corresponding path program 3 times [2022-01-31 21:22:21,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:21,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [134424939] [2022-01-31 21:22:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:21,215 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:21,291 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:21,291 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:21,335 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:21,395 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:21,396 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:21,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:21,402 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_12.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_12.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:21,402 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_12.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_12.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:21,420 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_12.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_12.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:21,420 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_12.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_12.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:21,937 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:21,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [134424939] [2022-01-31 21:22:21,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [134424939] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:21,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:21,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:22:21,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146810149] [2022-01-31 21:22:21,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:21,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:22:21,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:21,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:22:21,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:22:21,939 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:22,295 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-01-31 21:22:22,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:22:22,295 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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 21 [2022-01-31 21:22:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:22,296 INFO L225 Difference]: With dead ends: 32 [2022-01-31 21:22:22,296 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 21:22:22,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:22:22,297 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:22,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 53 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:22:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 21:22:22,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 21:22:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-01-31 21:22:22,305 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2022-01-31 21:22:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:22,305 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-01-31 21:22:22,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-01-31 21:22:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:22:22,306 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:22,306 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:22,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:22:22,306 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:22,307 INFO L85 PathProgramCache]: Analyzing trace with hash 105609001, now seen corresponding path program 4 times [2022-01-31 21:22:22,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:22,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1870506700] [2022-01-31 21:22:22,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:22,433 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:22,533 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:22,533 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:22,579 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:22,671 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:22,671 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:22,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:22,676 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_16.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_16.0) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:22:22,677 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_16.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_16.0) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:22:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:22,716 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_16.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_16.1) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:22:22,716 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_16.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_16.1) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:22:22,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:23,414 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:23,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1870506700] [2022-01-31 21:22:23,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1870506700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:23,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:23,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:22:23,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736056155] [2022-01-31 21:22:23,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:23,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:22:23,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:23,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:22:23,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:22:23,416 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:23,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:23,865 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-01-31 21:22:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:22:23,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 23 [2022-01-31 21:22:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:23,866 INFO L225 Difference]: With dead ends: 34 [2022-01-31 21:22:23,866 INFO L226 Difference]: Without dead ends: 27 [2022-01-31 21:22:23,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:22:23,867 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:23,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 43 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:22:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-31 21:22:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-31 21:22:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-01-31 21:22:23,872 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-01-31 21:22:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:23,872 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-01-31 21:22:23,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-01-31 21:22:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 21:22:23,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:23,872 INFO L514 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:23,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:22:23,873 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:23,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1352532284, now seen corresponding path program 5 times [2022-01-31 21:22:23,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:23,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1892922419] [2022-01-31 21:22:23,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:23,981 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:24,069 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:24,070 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:24,128 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:24,526 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:24,527 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:24,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:24,531 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_20.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_20.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:24,531 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_20.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_20.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:24,563 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_20.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_20.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:24,563 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_20.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_20.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:25,723 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:25,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1892922419] [2022-01-31 21:22:25,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1892922419] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:25,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:25,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:22:25,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853074505] [2022-01-31 21:22:25,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:25,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:22:25,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:25,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:22:25,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:22:25,725 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:26,354 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-01-31 21:22:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:22:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 25 [2022-01-31 21:22:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:26,354 INFO L225 Difference]: With dead ends: 36 [2022-01-31 21:22:26,354 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 21:22:26,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:22:26,355 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:26,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 63 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:22:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 21:22:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 21:22:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-01-31 21:22:26,361 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2022-01-31 21:22:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:26,361 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-01-31 21:22:26,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-01-31 21:22:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 21:22:26,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:26,361 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:26,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:22:26,362 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1827998623, now seen corresponding path program 6 times [2022-01-31 21:22:26,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:26,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995595050] [2022-01-31 21:22:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:26,444 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:26,524 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:26,524 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:26,570 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:26,615 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:26,616 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:26,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:26,620 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_24.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_24.0) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:22:26,620 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_24.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_24.0) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:22:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:26,634 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_24.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_24.1) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:22:26,634 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_24.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_24.1) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:22:26,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:27,430 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:27,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995595050] [2022-01-31 21:22:27,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1995595050] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:27,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:27,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:22:27,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531813962] [2022-01-31 21:22:27,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:27,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:22:27,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:27,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:22:27,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:22:27,432 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:28,049 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-01-31 21:22:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:22:28,049 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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 27 [2022-01-31 21:22:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:28,050 INFO L225 Difference]: With dead ends: 38 [2022-01-31 21:22:28,050 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 21:22:28,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:22:28,051 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:28,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 43 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:22:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 21:22:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-31 21:22:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-01-31 21:22:28,056 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2022-01-31 21:22:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:28,056 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-01-31 21:22:28,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-01-31 21:22:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:22:28,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:28,057 INFO L514 BasicCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:28,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:22:28,057 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:28,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:28,057 INFO L85 PathProgramCache]: Analyzing trace with hash 301485498, now seen corresponding path program 7 times [2022-01-31 21:22:28,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:28,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1254439817] [2022-01-31 21:22:28,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:28,124 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:28,222 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:28,222 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:28,270 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:28,329 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:28,329 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:28,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:28,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_28.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_28.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:28,334 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_28.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_28.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:28,347 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_28.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_28.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:28,347 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_28.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_28.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:29,161 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:29,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1254439817] [2022-01-31 21:22:29,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1254439817] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:29,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:29,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:22:29,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359245475] [2022-01-31 21:22:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:29,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:22:29,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:22:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:22:29,162 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:29,915 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-01-31 21:22:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:22:29,915 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 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 29 [2022-01-31 21:22:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:29,916 INFO L225 Difference]: With dead ends: 40 [2022-01-31 21:22:29,916 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 21:22:29,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:22:29,917 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:29,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 38 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:22:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 21:22:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-31 21:22:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-01-31 21:22:29,922 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-01-31 21:22:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:29,922 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-01-31 21:22:29,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-01-31 21:22:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:22:29,922 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:29,922 INFO L514 BasicCegarLoop]: trace histogram [10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:29,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:22:29,923 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:29,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2093779691, now seen corresponding path program 8 times [2022-01-31 21:22:29,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:29,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1992430639] [2022-01-31 21:22:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:30,005 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:30,070 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:30,070 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:30,129 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:30,213 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:30,213 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:30,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:30,217 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_32.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_32.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:30,217 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_32.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_32.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:30,230 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_32.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_32.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:30,230 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_32.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_32.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:30,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:31,487 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:31,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1992430639] [2022-01-31 21:22:31,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1992430639] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:31,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:31,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:22:31,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074857343] [2022-01-31 21:22:31,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:31,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:22:31,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:22:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:22:31,488 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:32,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:32,445 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-01-31 21:22:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:22:32,446 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 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 31 [2022-01-31 21:22:32,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:32,446 INFO L225 Difference]: With dead ends: 42 [2022-01-31 21:22:32,446 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 21:22:32,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:22:32,447 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:32,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 38 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:22:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 21:22:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-01-31 21:22:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-31 21:22:32,454 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 31 [2022-01-31 21:22:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:32,454 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-31 21:22:32,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-31 21:22:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 21:22:32,455 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:32,455 INFO L514 BasicCegarLoop]: trace histogram [11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:32,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:22:32,455 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1841155664, now seen corresponding path program 9 times [2022-01-31 21:22:32,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:32,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942984022] [2022-01-31 21:22:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:32,731 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:32,814 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:32,814 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:32,854 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:34,945 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:34,946 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:34,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:34,950 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_36.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_36.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:34,950 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_36.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_36.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:34,978 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_36.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_36.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:34,978 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_36.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_36.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:35,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:36,091 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942984022] [2022-01-31 21:22:36,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [942984022] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:36,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:36,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:22:36,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071307315] [2022-01-31 21:22:36,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:36,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:22:36,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:36,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:22:36,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:22:36,092 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:37,059 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-01-31 21:22:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:22:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 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 33 [2022-01-31 21:22:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:37,060 INFO L225 Difference]: With dead ends: 44 [2022-01-31 21:22:37,060 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 21:22:37,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:22:37,061 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:37,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 73 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:22:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 21:22:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-01-31 21:22:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-01-31 21:22:37,068 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2022-01-31 21:22:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:37,068 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-01-31 21:22:37,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-01-31 21:22:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:22:37,069 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:37,069 INFO L514 BasicCegarLoop]: trace histogram [12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:37,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:22:37,069 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash 412365707, now seen corresponding path program 10 times [2022-01-31 21:22:37,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:37,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1267128882] [2022-01-31 21:22:37,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:38,200 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:38,274 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:38,274 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:38,319 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:38,373 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:38,374 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:38,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:38,377 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_40.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_40.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:38,378 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_40.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_40.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:38,390 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_40.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_40.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:38,390 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_40.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_40.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:39,874 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:39,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1267128882] [2022-01-31 21:22:39,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1267128882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:39,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:39,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:22:39,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704218535] [2022-01-31 21:22:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:39,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:22:39,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:39,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:22:39,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:22:39,876 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:41,036 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-01-31 21:22:41,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:22:41,037 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 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 35 [2022-01-31 21:22:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:41,037 INFO L225 Difference]: With dead ends: 46 [2022-01-31 21:22:41,037 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 21:22:41,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:22:41,039 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:41,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 83 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:22:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 21:22:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-01-31 21:22:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-01-31 21:22:41,048 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 35 [2022-01-31 21:22:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:41,049 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-01-31 21:22:41,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-01-31 21:22:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:22:41,049 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:41,049 INFO L514 BasicCegarLoop]: trace histogram [13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:41,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:22:41,049 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:41,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1382886054, now seen corresponding path program 11 times [2022-01-31 21:22:41,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:41,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396824384] [2022-01-31 21:22:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:41,137 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:41,194 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:41,194 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:41,229 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:41,266 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:41,266 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:41,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:41,269 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_44.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_44.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:41,269 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_44.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_44.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:41,286 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_44.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_44.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:41,287 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_44.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_44.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:41,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:42,802 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:42,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396824384] [2022-01-31 21:22:42,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [396824384] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:42,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:42,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:22:42,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684149409] [2022-01-31 21:22:42,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:42,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:22:42,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:42,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:22:42,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:22:42,804 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:44,173 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-01-31 21:22:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:22:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 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 37 [2022-01-31 21:22:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:44,173 INFO L225 Difference]: With dead ends: 48 [2022-01-31 21:22:44,174 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 21:22:44,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:22:44,174 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:44,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:22:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 21:22:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-31 21:22:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-01-31 21:22:44,180 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2022-01-31 21:22:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:44,180 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-01-31 21:22:44,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-01-31 21:22:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 21:22:44,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:44,181 INFO L514 BasicCegarLoop]: trace histogram [14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:44,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:22:44,181 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2045036289, now seen corresponding path program 12 times [2022-01-31 21:22:44,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:44,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1575934285] [2022-01-31 21:22:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:44,272 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:44,405 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:44,406 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:44,444 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:44,522 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:44,523 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:44,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:44,526 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_48.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_48.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:44,526 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_48.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_48.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:44,555 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_48.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_48.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:44,555 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_48.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_48.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:44,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:46,767 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:46,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1575934285] [2022-01-31 21:22:46,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1575934285] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:46,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:46,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:22:46,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065668766] [2022-01-31 21:22:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:46,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:22:46,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:22:46,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:22:46,769 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:48,594 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-01-31 21:22:48,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:22:48,595 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 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 39 [2022-01-31 21:22:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:48,595 INFO L225 Difference]: With dead ends: 50 [2022-01-31 21:22:48,595 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 21:22:48,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 16 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 21:22:48,596 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:48,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 93 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:22:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 21:22:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-31 21:22:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-01-31 21:22:48,602 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 39 [2022-01-31 21:22:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:48,602 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-01-31 21:22:48,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-01-31 21:22:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:22:48,603 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:48,603 INFO L514 BasicCegarLoop]: trace histogram [15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:48,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:22:48,603 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:48,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:48,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1578714980, now seen corresponding path program 13 times [2022-01-31 21:22:48,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:48,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1612456199] [2022-01-31 21:22:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:48,807 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:48,875 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:48,875 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:48,918 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:48,968 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:48,969 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:48,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:48,972 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_52.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_52.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:48,972 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_52.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_52.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:48,986 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_52.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_52.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:48,987 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_52.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_52.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:49,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:50,788 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:50,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1612456199] [2022-01-31 21:22:50,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1612456199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:50,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:50,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:22:50,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027430195] [2022-01-31 21:22:50,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:50,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:22:50,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:22:50,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:22:50,790 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:52,462 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-01-31 21:22:52,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:22:52,462 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 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 41 [2022-01-31 21:22:52,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:52,463 INFO L225 Difference]: With dead ends: 52 [2022-01-31 21:22:52,463 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 21:22:52,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 17 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 21:22:52,464 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:52,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 78 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:22:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 21:22:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-01-31 21:22:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-01-31 21:22:52,472 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41 [2022-01-31 21:22:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:52,472 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-01-31 21:22:52,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-01-31 21:22:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 21:22:52,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:52,473 INFO L514 BasicCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:52,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:22:52,473 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:52,473 INFO L85 PathProgramCache]: Analyzing trace with hash -785207433, now seen corresponding path program 14 times [2022-01-31 21:22:52,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:52,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [251954829] [2022-01-31 21:22:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:52,537 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:52,617 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:52,618 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:52,669 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:52,720 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:52,720 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:52,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:52,724 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_56.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_56.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:52,724 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_56.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_56.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:52,733 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_56.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_56.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:52,734 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_56.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_56.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:52,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:54,427 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:54,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [251954829] [2022-01-31 21:22:54,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [251954829] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:54,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:54,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:22:54,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404561530] [2022-01-31 21:22:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:54,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:22:54,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:54,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:22:54,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:22:54,428 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:56,020 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-01-31 21:22:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:22:56,021 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 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 43 [2022-01-31 21:22:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:56,021 INFO L225 Difference]: With dead ends: 54 [2022-01-31 21:22:56,021 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 21:22:56,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 18 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=196, Invalid=1444, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 21:22:56,022 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:56,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 93 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:22:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 21:22:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-01-31 21:22:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-01-31 21:22:56,029 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 43 [2022-01-31 21:22:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:56,030 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-01-31 21:22:56,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-01-31 21:22:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:22:56,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:56,030 INFO L514 BasicCegarLoop]: trace histogram [17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:56,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:22:56,030 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:56,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:56,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1566333842, now seen corresponding path program 15 times [2022-01-31 21:22:56,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:56,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [469873209] [2022-01-31 21:22:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:56,193 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:56,260 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:56,260 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:56,296 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:22:56,342 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:56,343 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:22:56,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:56,346 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_60.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_60.0)) 4294967296)) 10000000) 0) [2022-01-31 21:22:56,346 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_60.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_60.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:56,358 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_60.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_60.1)) 4294967296)) 10000000) 0) [2022-01-31 21:22:56,359 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_60.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_60.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:22:56,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:58,602 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [469873209] [2022-01-31 21:22:58,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [469873209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:58,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:58,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:22:58,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101705049] [2022-01-31 21:22:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:58,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:22:58,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:58,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:22:58,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:22:58,603 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:00,917 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-01-31 21:23:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:23:00,917 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 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 45 [2022-01-31 21:23:00,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:00,918 INFO L225 Difference]: With dead ends: 56 [2022-01-31 21:23:00,918 INFO L226 Difference]: Without dead ends: 49 [2022-01-31 21:23:00,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 19 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=207, Invalid=1599, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 21:23:00,919 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:00,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 108 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:23:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-31 21:23:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-01-31 21:23:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-01-31 21:23:00,939 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 45 [2022-01-31 21:23:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:00,939 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-01-31 21:23:00,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-01-31 21:23:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:23:00,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:00,942 INFO L514 BasicCegarLoop]: trace histogram [18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:00,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:23:00,942 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:00,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:00,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2050265875, now seen corresponding path program 16 times [2022-01-31 21:23:00,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:00,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [790057812] [2022-01-31 21:23:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:01,015 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:01,227 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:01,228 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:01,274 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:01,328 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:01,328 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:01,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:01,332 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_64.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_64.0)) 4294967296)) 10000000) 0) [2022-01-31 21:23:01,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_64.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_64.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:01,344 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_64.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_64.1)) 4294967296)) 10000000) 0) [2022-01-31 21:23:01,344 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_64.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_64.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:23:04,222 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:04,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [790057812] [2022-01-31 21:23:04,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [790057812] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:04,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:04,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 21:23:04,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386605800] [2022-01-31 21:23:04,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:04,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 21:23:04,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 21:23:04,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:23:04,223 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:07,454 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-01-31 21:23:07,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:23:07,454 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 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 47 [2022-01-31 21:23:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:07,455 INFO L225 Difference]: With dead ends: 58 [2022-01-31 21:23:07,455 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 21:23:07,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 20 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=218, Invalid=1762, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 21:23:07,456 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:07,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 78 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 21:23:07,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 21:23:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-01-31 21:23:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-01-31 21:23:07,463 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 47 [2022-01-31 21:23:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:07,464 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-01-31 21:23:07,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-01-31 21:23:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:23:07,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:07,464 INFO L514 BasicCegarLoop]: trace histogram [19, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:07,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:23:07,464 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:07,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1320915848, now seen corresponding path program 17 times [2022-01-31 21:23:07,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:07,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [296145231] [2022-01-31 21:23:07,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:08,203 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:08,267 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:08,268 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:08,306 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:08,354 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:08,354 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:08,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:08,357 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_68.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_68.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:08,357 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_68.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_68.0)) 4294967296)) 10000000) 0) [2022-01-31 21:23:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:08,369 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_68.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_68.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:08,369 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_68.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_68.1)) 4294967296)) 10000000) 0) [2022-01-31 21:23:08,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:23:10,780 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:10,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [296145231] [2022-01-31 21:23:10,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [296145231] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:10,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:10,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:23:10,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745956854] [2022-01-31 21:23:10,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:10,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:23:10,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:10,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:23:10,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:23:10,781 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:13,164 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-01-31 21:23:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:23:13,165 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 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 49 [2022-01-31 21:23:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:13,165 INFO L225 Difference]: With dead ends: 60 [2022-01-31 21:23:13,165 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 21:23:13,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 4 SyntacticMatches, 21 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 21:23:13,166 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:13,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:23:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 21:23:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-31 21:23:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-01-31 21:23:13,175 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 49 [2022-01-31 21:23:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:13,175 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-01-31 21:23:13,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-01-31 21:23:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:23:13,175 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:13,175 INFO L514 BasicCegarLoop]: trace histogram [20, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:13,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:23:13,176 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1673756829, now seen corresponding path program 18 times [2022-01-31 21:23:13,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:13,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [877176449] [2022-01-31 21:23:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:13,260 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:13,325 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:13,325 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:13,362 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:13,405 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:13,405 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:13,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:13,408 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_72.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_72.0)) 4294967296)) 10000000) 0) [2022-01-31 21:23:13,408 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_72.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_72.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:13,417 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_72.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_72.1)) 4294967296)) 10000000) 0) [2022-01-31 21:23:13,417 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_72.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_72.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:13,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:23:15,812 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:15,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [877176449] [2022-01-31 21:23:15,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [877176449] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:15,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:15,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:23:15,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733976302] [2022-01-31 21:23:15,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:15,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:23:15,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:15,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:23:15,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:23:15,813 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:18,236 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-01-31 21:23:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:23:18,236 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 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 51 [2022-01-31 21:23:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:18,236 INFO L225 Difference]: With dead ends: 62 [2022-01-31 21:23:18,237 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 21:23:18,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 4 SyntacticMatches, 22 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=240, Invalid=2112, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 21:23:18,238 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:18,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 118 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 21:23:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 21:23:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-01-31 21:23:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-01-31 21:23:18,246 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 51 [2022-01-31 21:23:18,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:18,247 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-01-31 21:23:18,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-01-31 21:23:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:23:18,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:18,247 INFO L514 BasicCegarLoop]: trace histogram [21, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:18,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:23:18,248 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1926111106, now seen corresponding path program 19 times [2022-01-31 21:23:18,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:18,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1054901384] [2022-01-31 21:23:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:20,361 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:20,450 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:20,451 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:20,490 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:20,537 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:20,537 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:20,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:20,540 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_76.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_76.0)) 4294967296)) 10000000) 0) [2022-01-31 21:23:20,540 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_76.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_76.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:20,571 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_76.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_76.1)) 4294967296)) 10000000) 0) [2022-01-31 21:23:20,571 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_76.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_76.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:20,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:23:24,425 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:24,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1054901384] [2022-01-31 21:23:24,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1054901384] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:24,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:24,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-31 21:23:24,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852244070] [2022-01-31 21:23:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:24,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 21:23:24,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 21:23:24,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:23:24,427 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:27,928 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-01-31 21:23:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 21:23:27,939 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 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 53 [2022-01-31 21:23:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:27,940 INFO L225 Difference]: With dead ends: 64 [2022-01-31 21:23:27,940 INFO L226 Difference]: Without dead ends: 57 [2022-01-31 21:23:27,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 4 SyntacticMatches, 23 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=251, Invalid=2299, Unknown=0, NotChecked=0, Total=2550 [2022-01-31 21:23:27,941 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:27,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 58 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 21:23:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-31 21:23:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-01-31 21:23:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-01-31 21:23:27,950 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 53 [2022-01-31 21:23:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:27,950 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-01-31 21:23:27,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-01-31 21:23:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:23:27,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:27,950 INFO L514 BasicCegarLoop]: trace histogram [22, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:27,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:23:27,951 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:27,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash 374564569, now seen corresponding path program 20 times [2022-01-31 21:23:27,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:27,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1335075032] [2022-01-31 21:23:27,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:28,060 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:28,157 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:28,157 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:28,210 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:28,281 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:28,281 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:28,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:28,285 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_80.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_80.0)) 4294967296)) 10000000) 0) [2022-01-31 21:23:28,285 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_80.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_80.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:28,294 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_80.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_80.1)) 4294967296)) 10000000) 0) [2022-01-31 21:23:28,294 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_80.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_80.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:28,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:23:31,697 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:31,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1335075032] [2022-01-31 21:23:31,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1335075032] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:31,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:31,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 21:23:31,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139938254] [2022-01-31 21:23:31,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:31,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 21:23:31,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:31,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 21:23:31,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:23:31,698 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:35,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:35,144 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-01-31 21:23:35,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 21:23:35,144 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 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 55 [2022-01-31 21:23:35,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:35,145 INFO L225 Difference]: With dead ends: 66 [2022-01-31 21:23:35,145 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 21:23:35,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 4 SyntacticMatches, 24 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=262, Invalid=2494, Unknown=0, NotChecked=0, Total=2756 [2022-01-31 21:23:35,146 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:35,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 103 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 21:23:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 21:23:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-01-31 21:23:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-01-31 21:23:35,154 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 55 [2022-01-31 21:23:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:35,154 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-01-31 21:23:35,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-01-31 21:23:35,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 21:23:35,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:35,155 INFO L514 BasicCegarLoop]: trace histogram [23, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:35,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:23:35,155 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:35,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash -584269196, now seen corresponding path program 21 times [2022-01-31 21:23:35,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:35,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1666414282] [2022-01-31 21:23:35,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:35,228 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:35,294 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:35,295 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:35,337 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:35,474 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:35,474 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:35,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:35,477 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_84.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_84.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:35,477 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_84.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_84.0)) 4294967296)) 10000000) 0) [2022-01-31 21:23:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:35,485 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_84.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_84.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:35,485 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_84.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_84.1)) 4294967296)) 10000000) 0) [2022-01-31 21:23:35,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:23:40,105 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:40,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1666414282] [2022-01-31 21:23:40,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1666414282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:40,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:40,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 21:23:40,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948678806] [2022-01-31 21:23:40,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:40,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 21:23:40,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:40,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 21:23:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:23:40,106 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:44,328 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-01-31 21:23:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 21:23:44,328 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 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 57 [2022-01-31 21:23:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:44,328 INFO L225 Difference]: With dead ends: 68 [2022-01-31 21:23:44,328 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 21:23:44,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=273, Invalid=2697, Unknown=0, NotChecked=0, Total=2970 [2022-01-31 21:23:44,330 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:44,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 43 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 21:23:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 21:23:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-01-31 21:23:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-01-31 21:23:44,338 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 57 [2022-01-31 21:23:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:44,338 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-01-31 21:23:44,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-01-31 21:23:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 21:23:44,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:44,338 INFO L514 BasicCegarLoop]: trace histogram [24, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:44,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:23:44,339 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:44,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1394451279, now seen corresponding path program 22 times [2022-01-31 21:23:44,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:44,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1441744032] [2022-01-31 21:23:44,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:44,399 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:44,483 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:44,483 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:44,521 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:44,579 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:44,579 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:44,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:44,582 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_88.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_88.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:44,583 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_88.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_88.0)) 4294967296)) 10000000) 0) [2022-01-31 21:23:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:44,597 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_88.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_88.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:44,597 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_88.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_88.1)) 4294967296)) 10000000) 0) [2022-01-31 21:23:44,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:23:52,233 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:52,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1441744032] [2022-01-31 21:23:52,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1441744032] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:52,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:52,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-01-31 21:23:52,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942089621] [2022-01-31 21:23:52,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:52,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 21:23:52,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:52,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 21:23:52,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:23:52,234 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:57,379 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-01-31 21:23:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:23:57,379 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 states have internal predecessors, (55), 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 59 [2022-01-31 21:23:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:57,379 INFO L225 Difference]: With dead ends: 70 [2022-01-31 21:23:57,379 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 21:23:57,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 4 SyntacticMatches, 26 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=284, Invalid=2908, Unknown=0, NotChecked=0, Total=3192 [2022-01-31 21:23:57,381 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:57,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 73 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-01-31 21:23:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 21:23:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-01-31 21:23:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-01-31 21:23:57,393 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 59 [2022-01-31 21:23:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:57,394 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-01-31 21:23:57,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:23:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-01-31 21:23:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 21:23:57,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:57,394 INFO L514 BasicCegarLoop]: trace histogram [25, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:57,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:23:57,394 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash 274315626, now seen corresponding path program 23 times [2022-01-31 21:23:57,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:57,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [304219466] [2022-01-31 21:23:57,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:57,544 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:57,622 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:57,622 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:57,669 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:23:57,720 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:57,720 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:23:57,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:57,724 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_92.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_92.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:57,724 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_92.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_92.0)) 4294967296)) 10000000) 0) [2022-01-31 21:23:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:57,736 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_92.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_92.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:23:57,736 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_92.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_92.1)) 4294967296)) 10000000) 0) [2022-01-31 21:23:57,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:24:03,681 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:03,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [304219466] [2022-01-31 21:24:03,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [304219466] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:03,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:03,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:24:03,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90645551] [2022-01-31 21:24:03,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:03,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:24:03,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:03,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:24:03,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:24:03,683 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:24:09,635 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-01-31 21:24:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:24:09,636 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 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 61 [2022-01-31 21:24:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:24:09,636 INFO L225 Difference]: With dead ends: 72 [2022-01-31 21:24:09,636 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 21:24:09,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 27 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=295, Invalid=3127, Unknown=0, NotChecked=0, Total=3422 [2022-01-31 21:24:09,637 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:24:09,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 73 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-01-31 21:24:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 21:24:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-01-31 21:24:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-01-31 21:24:09,646 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 61 [2022-01-31 21:24:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:24:09,646 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-01-31 21:24:09,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-01-31 21:24:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 21:24:09,647 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:24:09,647 INFO L514 BasicCegarLoop]: trace histogram [26, 24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:24:09,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:24:09,647 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:24:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:24:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1860744389, now seen corresponding path program 24 times [2022-01-31 21:24:09,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:24:09,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484140837] [2022-01-31 21:24:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:24:09,718 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:09,783 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:24:09,783 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:24:09,825 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:24:09,875 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:09,875 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:24:09,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:24:09,878 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_96.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_96.0)) 4294967296)) 10000000) 0) [2022-01-31 21:24:09,878 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_96.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_96.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:24:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:09,885 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_96.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_96.1)) 4294967296)) 10000000) 0) [2022-01-31 21:24:09,886 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_96.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_96.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:24:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:24:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:24:16,318 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:16,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484140837] [2022-01-31 21:24:16,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1484140837] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:16,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:16,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:24:16,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105767700] [2022-01-31 21:24:16,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:16,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:24:16,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:16,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:24:16,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:24:16,320 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:24:22,473 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-01-31 21:24:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 21:24:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 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 63 [2022-01-31 21:24:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:24:22,473 INFO L225 Difference]: With dead ends: 74 [2022-01-31 21:24:22,474 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 21:24:22,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 4 SyntacticMatches, 28 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=306, Invalid=3354, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 21:24:22,475 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:24:22,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 73 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-01-31 21:24:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 21:24:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-31 21:24:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-01-31 21:24:22,486 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 63 [2022-01-31 21:24:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:24:22,487 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-01-31 21:24:22,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-01-31 21:24:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 21:24:22,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:24:22,487 INFO L514 BasicCegarLoop]: trace histogram [27, 25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:24:22,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:24:22,487 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:24:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:24:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1705395552, now seen corresponding path program 25 times [2022-01-31 21:24:22,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:24:22,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [929764206] [2022-01-31 21:24:22,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:24:24,318 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:24,429 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:24:24,429 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:24:24,472 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:24:24,524 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:24,524 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:24:24,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:24:24,527 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_100.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_100.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:24:24,527 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_100.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_100.0)) 4294967296)) 10000000) 0) [2022-01-31 21:24:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:24,551 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_100.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_100.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:24:24,551 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_100.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_100.1)) 4294967296)) 10000000) 0) [2022-01-31 21:24:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:24:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:24:31,000 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:31,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [929764206] [2022-01-31 21:24:31,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [929764206] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:31,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:31,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-31 21:24:31,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762820381] [2022-01-31 21:24:31,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:31,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 21:24:31,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:31,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 21:24:31,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:24:31,002 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:24:37,624 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-01-31 21:24:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-31 21:24:37,625 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 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 65 [2022-01-31 21:24:37,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:24:37,625 INFO L225 Difference]: With dead ends: 76 [2022-01-31 21:24:37,625 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 21:24:37,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 29 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=317, Invalid=3589, Unknown=0, NotChecked=0, Total=3906 [2022-01-31 21:24:37,627 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:24:37,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 68 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-01-31 21:24:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 21:24:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-01-31 21:24:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-01-31 21:24:37,635 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 65 [2022-01-31 21:24:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:24:37,636 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-01-31 21:24:37,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-01-31 21:24:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 21:24:37,636 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:24:37,636 INFO L514 BasicCegarLoop]: trace histogram [28, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:24:37,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:24:37,636 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:24:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:24:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1555948741, now seen corresponding path program 26 times [2022-01-31 21:24:37,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:24:37,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1539771239] [2022-01-31 21:24:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:24:37,698 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:37,764 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:24:37,765 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:24:37,805 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:24:37,853 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:37,853 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:24:37,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:24:37,858 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_104.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_104.0)) 4294967296)) 10000000) 0) [2022-01-31 21:24:37,859 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_104.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_104.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:24:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:37,871 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_104.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_104.1)) 4294967296)) 10000000) 0) [2022-01-31 21:24:37,873 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_104.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_104.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:24:37,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:24:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:24:43,687 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:43,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1539771239] [2022-01-31 21:24:43,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1539771239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:43,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:43,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-31 21:24:43,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328075585] [2022-01-31 21:24:43,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:43,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 21:24:43,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 21:24:43,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 21:24:43,689 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:24:49,374 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-01-31 21:24:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 21:24:49,375 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 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 67 [2022-01-31 21:24:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:24:49,375 INFO L225 Difference]: With dead ends: 78 [2022-01-31 21:24:49,375 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 21:24:49,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 29 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=328, Invalid=3832, Unknown=0, NotChecked=0, Total=4160 [2022-01-31 21:24:49,377 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:24:49,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 153 Invalid, 1939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1875 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-01-31 21:24:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 21:24:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-01-31 21:24:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-01-31 21:24:49,386 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 67 [2022-01-31 21:24:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:24:49,386 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-01-31 21:24:49,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-01-31 21:24:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 21:24:49,387 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:24:49,387 INFO L514 BasicCegarLoop]: trace histogram [29, 27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:24:49,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:24:49,387 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:24:49,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:24:49,387 INFO L85 PathProgramCache]: Analyzing trace with hash -381688234, now seen corresponding path program 27 times [2022-01-31 21:24:49,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:24:49,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1367688449] [2022-01-31 21:24:49,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:24:51,444 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:51,504 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:24:51,505 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:24:51,545 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:24:51,611 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:51,612 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:24:51,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:24:51,614 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_108.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_108.0)) 4294967296)) 10000000) 0) [2022-01-31 21:24:51,615 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_108.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_108.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:24:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:51,621 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_108.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_108.1)) 4294967296)) 10000000) 0) [2022-01-31 21:24:51,621 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_108.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_108.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:24:51,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:24:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:24:57,392 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:57,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1367688449] [2022-01-31 21:24:57,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1367688449] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:57,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:57,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-01-31 21:24:57,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845040622] [2022-01-31 21:24:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:57,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 21:24:57,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 21:24:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1200, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 21:24:57,393 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:03,191 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-01-31 21:25:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 21:25:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 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 69 [2022-01-31 21:25:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:03,192 INFO L225 Difference]: With dead ends: 80 [2022-01-31 21:25:03,192 INFO L226 Difference]: Without dead ends: 73 [2022-01-31 21:25:03,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 4 SyntacticMatches, 31 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=339, Invalid=4083, Unknown=0, NotChecked=0, Total=4422 [2022-01-31 21:25:03,193 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:03,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 98 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-01-31 21:25:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-31 21:25:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-01-31 21:25:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-01-31 21:25:03,202 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 69 [2022-01-31 21:25:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:03,202 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-01-31 21:25:03,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-01-31 21:25:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 21:25:03,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:03,202 INFO L514 BasicCegarLoop]: trace histogram [30, 28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:25:03,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:25:03,203 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:03,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1493739855, now seen corresponding path program 28 times [2022-01-31 21:25:03,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:03,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1080694827] [2022-01-31 21:25:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:03,254 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:03,413 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:25:03,413 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:25:03,459 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:25:03,509 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:03,509 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:25:03,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:03,512 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_112.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_112.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:25:03,512 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_112.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_112.0)) 4294967296)) 10000000) 0) [2022-01-31 21:25:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:03,520 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_112.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_112.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:25:03,521 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_112.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_112.1)) 4294967296)) 10000000) 0) [2022-01-31 21:25:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:25:09,112 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:25:09,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1080694827] [2022-01-31 21:25:09,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1080694827] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:25:09,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:25:09,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-31 21:25:09,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039472069] [2022-01-31 21:25:09,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:25:09,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 21:25:09,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:25:09,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 21:25:09,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1270, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 21:25:09,113 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:14,768 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-01-31 21:25:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 21:25:14,769 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 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 71 [2022-01-31 21:25:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:14,769 INFO L225 Difference]: With dead ends: 82 [2022-01-31 21:25:14,769 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 21:25:14,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 4 SyntacticMatches, 32 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=350, Invalid=4342, Unknown=0, NotChecked=0, Total=4692 [2022-01-31 21:25:14,770 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:14,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 68 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-01-31 21:25:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 21:25:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-01-31 21:25:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-01-31 21:25:14,780 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 71 [2022-01-31 21:25:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:14,780 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-01-31 21:25:14,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-01-31 21:25:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 21:25:14,780 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:14,780 INFO L514 BasicCegarLoop]: trace histogram [31, 29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:25:14,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:25:14,780 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:14,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash -728490932, now seen corresponding path program 29 times [2022-01-31 21:25:14,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:14,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [843125581] [2022-01-31 21:25:14,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:14,871 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:14,948 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:25:14,948 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:25:14,987 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:25:15,029 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:15,029 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:25:15,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:15,032 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_116.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_116.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:25:15,032 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_116.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_116.0)) 4294967296)) 10000000) 0) [2022-01-31 21:25:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:15,040 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_116.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_116.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:25:15,040 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_116.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_116.1)) 4294967296)) 10000000) 0) [2022-01-31 21:25:15,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:25:20,234 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:25:20,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [843125581] [2022-01-31 21:25:20,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [843125581] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:25:20,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:25:20,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-31 21:25:20,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649538725] [2022-01-31 21:25:20,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:25:20,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-31 21:25:20,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:25:20,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-31 21:25:20,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1342, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 21:25:20,235 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:25,692 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-01-31 21:25:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 21:25:25,692 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 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 73 [2022-01-31 21:25:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:25,693 INFO L225 Difference]: With dead ends: 84 [2022-01-31 21:25:25,693 INFO L226 Difference]: Without dead ends: 77 [2022-01-31 21:25:25,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 4 SyntacticMatches, 33 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=361, Invalid=4609, Unknown=0, NotChecked=0, Total=4970 [2022-01-31 21:25:25,694 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:25,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 88 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-01-31 21:25:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-31 21:25:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-01-31 21:25:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-01-31 21:25:25,704 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 73 [2022-01-31 21:25:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:25,704 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-01-31 21:25:25,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-01-31 21:25:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-31 21:25:25,704 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:25,704 INFO L514 BasicCegarLoop]: trace histogram [32, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:25:25,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:25:25,704 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:25,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash 236316455, now seen corresponding path program 30 times [2022-01-31 21:25:25,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:25,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1852510869] [2022-01-31 21:25:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:25,777 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:25,837 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:25:25,837 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:25:25,879 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:25:25,934 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:25,934 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:25:25,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:25,937 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_120.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_120.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:25:25,938 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_120.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_120.0)) 4294967296)) 10000000) 0) [2022-01-31 21:25:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:25,948 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_120.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_120.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:25:25,949 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_120.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_120.1)) 4294967296)) 10000000) 0) [2022-01-31 21:25:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:25:32,948 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:25:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1852510869] [2022-01-31 21:25:32,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1852510869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:25:32,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:25:32,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-01-31 21:25:32,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895382844] [2022-01-31 21:25:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:25:32,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 21:25:32,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:25:32,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 21:25:32,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1416, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 21:25:32,950 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:40,308 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-01-31 21:25:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 21:25:40,309 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 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 75 [2022-01-31 21:25:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:40,309 INFO L225 Difference]: With dead ends: 86 [2022-01-31 21:25:40,309 INFO L226 Difference]: Without dead ends: 79 [2022-01-31 21:25:40,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 34 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=372, Invalid=4884, Unknown=0, NotChecked=0, Total=5256 [2022-01-31 21:25:40,310 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 73 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:40,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 98 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2220 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-01-31 21:25:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-31 21:25:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-01-31 21:25:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-01-31 21:25:40,321 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 75 [2022-01-31 21:25:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:40,321 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-01-31 21:25:40,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-01-31 21:25:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-31 21:25:40,321 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:40,322 INFO L514 BasicCegarLoop]: trace histogram [33, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:25:40,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:25:40,322 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:40,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:40,322 INFO L85 PathProgramCache]: Analyzing trace with hash -296720574, now seen corresponding path program 31 times [2022-01-31 21:25:40,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:40,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1822678016] [2022-01-31 21:25:40,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:40,408 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:40,475 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:25:40,475 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:25:40,520 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:25:40,575 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:40,576 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:25:40,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:40,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_124.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_124.0)) 4294967296)) 10000000) 0) [2022-01-31 21:25:40,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_124.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_124.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:25:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:40,585 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_124.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_124.1)) 4294967296)) 10000000) 0) [2022-01-31 21:25:40,585 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_124.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_124.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:25:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:25:49,117 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:25:49,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1822678016] [2022-01-31 21:25:49,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1822678016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:25:49,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:25:49,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-01-31 21:25:49,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867057134] [2022-01-31 21:25:49,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:25:49,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-31 21:25:49,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:25:49,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-31 21:25:49,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1492, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 21:25:49,118 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:56,144 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-01-31 21:25:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 21:25:56,144 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 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 77 [2022-01-31 21:25:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:56,145 INFO L225 Difference]: With dead ends: 88 [2022-01-31 21:25:56,145 INFO L226 Difference]: Without dead ends: 81 [2022-01-31 21:25:56,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 4 SyntacticMatches, 35 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=383, Invalid=5167, Unknown=0, NotChecked=0, Total=5550 [2022-01-31 21:25:56,145 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 75 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:56,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 158 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-01-31 21:25:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-31 21:25:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-01-31 21:25:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-01-31 21:25:56,155 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 77 [2022-01-31 21:25:56,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:56,155 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-01-31 21:25:56,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:25:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-01-31 21:25:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-31 21:25:56,156 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:56,156 INFO L514 BasicCegarLoop]: trace histogram [34, 32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:25:56,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 21:25:56,156 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1444197219, now seen corresponding path program 32 times [2022-01-31 21:25:56,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:56,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [173576104] [2022-01-31 21:25:56,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:56,225 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:56,289 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:25:56,289 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:25:56,343 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:25:56,390 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:56,390 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:25:56,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:56,393 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_128.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_128.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:25:56,393 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_128.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_128.0)) 4294967296)) 10000000) 0) [2022-01-31 21:25:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:56,401 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_128.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_128.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:25:56,401 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_128.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_128.1)) 4294967296)) 10000000) 0) [2022-01-31 21:25:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:26:05,556 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:26:05,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [173576104] [2022-01-31 21:26:05,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [173576104] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:26:05,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:26:05,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-01-31 21:26:05,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478026518] [2022-01-31 21:26:05,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:26:05,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-31 21:26:05,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:26:05,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-31 21:26:05,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1570, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 21:26:05,558 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:26:15,485 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-01-31 21:26:15,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 21:26:15,485 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 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 79 [2022-01-31 21:26:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:26:15,486 INFO L225 Difference]: With dead ends: 90 [2022-01-31 21:26:15,486 INFO L226 Difference]: Without dead ends: 83 [2022-01-31 21:26:15,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 4 SyntacticMatches, 36 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=394, Invalid=5458, Unknown=0, NotChecked=0, Total=5852 [2022-01-31 21:26:15,486 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2517 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:26:15,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 78 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2517 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-01-31 21:26:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-31 21:26:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-01-31 21:26:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-01-31 21:26:15,497 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 79 [2022-01-31 21:26:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:26:15,497 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-01-31 21:26:15,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-01-31 21:26:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-31 21:26:15,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:26:15,497 INFO L514 BasicCegarLoop]: trace histogram [35, 33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:26:15,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 21:26:15,498 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:26:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:26:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash -362657992, now seen corresponding path program 33 times [2022-01-31 21:26:15,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:26:15,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [407371384] [2022-01-31 21:26:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:26:15,615 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:26:15,700 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:26:15,700 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:26:15,738 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:26:16,121 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:26:16,121 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:26:16,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:26:16,124 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_132.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_132.0)) 4294967296)) 10000000) 0) [2022-01-31 21:26:16,124 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_132.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_132.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:26:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:16,131 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_132.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_132.1)) 4294967296)) 10000000) 0) [2022-01-31 21:26:16,131 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_132.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_132.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:26:16,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:26:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:26:23,563 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:26:23,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [407371384] [2022-01-31 21:26:23,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [407371384] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:26:23,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:26:23,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-01-31 21:26:23,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76392256] [2022-01-31 21:26:23,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:26:23,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-31 21:26:23,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:26:23,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-31 21:26:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1650, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 21:26:23,564 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:26:31,122 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-01-31 21:26:31,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 21:26:31,122 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 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 81 [2022-01-31 21:26:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:26:31,123 INFO L225 Difference]: With dead ends: 92 [2022-01-31 21:26:31,123 INFO L226 Difference]: Without dead ends: 85 [2022-01-31 21:26:31,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 4 SyntacticMatches, 37 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=405, Invalid=5757, Unknown=0, NotChecked=0, Total=6162 [2022-01-31 21:26:31,124 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:26:31,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 113 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-01-31 21:26:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-31 21:26:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-01-31 21:26:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-01-31 21:26:31,135 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 81 [2022-01-31 21:26:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:26:31,135 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-01-31 21:26:31,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-01-31 21:26:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-31 21:26:31,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:26:31,136 INFO L514 BasicCegarLoop]: trace histogram [36, 34, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:26:31,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 21:26:31,136 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:26:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:26:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -385546477, now seen corresponding path program 34 times [2022-01-31 21:26:31,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:26:31,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1071496343] [2022-01-31 21:26:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:26:31,213 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:26:31,304 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:26:31,304 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:26:31,342 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:26:31,434 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:26:31,434 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:26:31,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:26:31,437 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_136.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_136.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:26:31,437 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_136.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_136.0)) 4294967296)) 10000000) 0) [2022-01-31 21:26:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:31,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_136.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_136.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:26:31,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_136.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_136.1)) 4294967296)) 10000000) 0) [2022-01-31 21:26:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:26:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:26:38,646 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:26:38,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1071496343] [2022-01-31 21:26:38,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1071496343] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:26:38,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:26:38,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-01-31 21:26:38,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469409496] [2022-01-31 21:26:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:26:38,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 21:26:38,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:26:38,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 21:26:38,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1732, Unknown=0, NotChecked=0, Total=1892 [2022-01-31 21:26:38,647 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:26:46,390 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-01-31 21:26:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 21:26:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 states have internal predecessors, (79), 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 83 [2022-01-31 21:26:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:26:46,392 INFO L225 Difference]: With dead ends: 94 [2022-01-31 21:26:46,392 INFO L226 Difference]: Without dead ends: 87 [2022-01-31 21:26:46,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 4 SyntacticMatches, 38 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=416, Invalid=6064, Unknown=0, NotChecked=0, Total=6480 [2022-01-31 21:26:46,393 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:26:46,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 38 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2672 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-01-31 21:26:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-31 21:26:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-01-31 21:26:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2022-01-31 21:26:46,404 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 83 [2022-01-31 21:26:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:26:46,404 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2022-01-31 21:26:46,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:26:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-01-31 21:26:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-31 21:26:46,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:26:46,404 INFO L514 BasicCegarLoop]: trace histogram [37, 35, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:26:46,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 21:26:46,404 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:26:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:26:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -906544082, now seen corresponding path program 35 times [2022-01-31 21:26:46,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:26:46,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1917380092] [2022-01-31 21:26:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:26:46,951 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:26:47,003 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:26:47,004 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:26:47,040 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:26:47,085 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:26:47,085 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:26:47,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:26:47,088 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_140.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_140.0)) 4294967296)) 10000000) 0) [2022-01-31 21:26:47,088 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_140.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_140.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:26:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:47,094 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_140.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_140.1)) 4294967296)) 10000000) 0) [2022-01-31 21:26:47,094 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_140.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_140.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:26:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:26:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:26:58,508 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:26:58,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1917380092] [2022-01-31 21:26:58,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1917380092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:26:58,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:26:58,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-01-31 21:26:58,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601048159] [2022-01-31 21:26:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:26:58,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-31 21:26:58,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:26:58,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-31 21:26:58,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1816, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 21:26:58,510 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:27:10,407 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-01-31 21:27:10,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 21:27:10,407 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 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 85 [2022-01-31 21:27:10,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:27:10,407 INFO L225 Difference]: With dead ends: 96 [2022-01-31 21:27:10,407 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 21:27:10,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 4 SyntacticMatches, 39 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=427, Invalid=6379, Unknown=0, NotChecked=0, Total=6806 [2022-01-31 21:27:10,408 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 3170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:27:10,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 163 Invalid, 3170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3088 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-01-31 21:27:10,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 21:27:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-01-31 21:27:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-01-31 21:27:10,420 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 85 [2022-01-31 21:27:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:27:10,420 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-01-31 21:27:10,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-01-31 21:27:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-31 21:27:10,420 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:27:10,420 INFO L514 BasicCegarLoop]: trace histogram [38, 36, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:27:10,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 21:27:10,421 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:27:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:27:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash 925931145, now seen corresponding path program 36 times [2022-01-31 21:27:10,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:27:10,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [75190165] [2022-01-31 21:27:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:27:10,527 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:27:10,587 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:27:10,587 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:27:10,626 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:27:10,672 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:27:10,673 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:27:10,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:27:10,675 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_144.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_144.0)) 4294967296)) 10000000) 0) [2022-01-31 21:27:10,676 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_144.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_144.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:27:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:27:10,681 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_144.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_144.1)) 4294967296)) 10000000) 0) [2022-01-31 21:27:10,681 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_144.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_144.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:27:10,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:27:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:27:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:27:18,403 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:27:18,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [75190165] [2022-01-31 21:27:18,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [75190165] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:27:18,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:27:18,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-01-31 21:27:18,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23115921] [2022-01-31 21:27:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:27:18,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-31 21:27:18,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:27:18,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-31 21:27:18,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1902, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 21:27:18,404 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:27:26,834 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-01-31 21:27:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-31 21:27:26,835 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 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 87 [2022-01-31 21:27:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:27:26,835 INFO L225 Difference]: With dead ends: 98 [2022-01-31 21:27:26,835 INFO L226 Difference]: Without dead ends: 91 [2022-01-31 21:27:26,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 4 SyntacticMatches, 40 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=438, Invalid=6702, Unknown=0, NotChecked=0, Total=7140 [2022-01-31 21:27:26,836 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:27:26,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 88 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-01-31 21:27:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-31 21:27:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-01-31 21:27:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2022-01-31 21:27:26,847 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 87 [2022-01-31 21:27:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:27:26,848 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2022-01-31 21:27:26,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-01-31 21:27:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-31 21:27:26,848 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:27:26,848 INFO L514 BasicCegarLoop]: trace histogram [39, 37, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:27:26,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 21:27:26,848 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:27:26,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:27:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash 998032932, now seen corresponding path program 37 times [2022-01-31 21:27:26,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:27:26,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [82067209] [2022-01-31 21:27:26,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:27:26,938 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:27:27,088 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:27:27,088 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:27:27,130 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:27:27,232 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:27:27,233 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:27:27,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:27:27,236 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_148.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_148.0)) 4294967296)) 10000000) 0) [2022-01-31 21:27:27,236 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_148.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_148.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:27:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:27:27,244 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_148.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_148.1)) 4294967296)) 10000000) 0) [2022-01-31 21:27:27,244 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_148.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_148.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:27:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:27:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:27:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:27:39,539 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:27:39,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [82067209] [2022-01-31 21:27:39,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [82067209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:27:39,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:27:39,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-01-31 21:27:39,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325395221] [2022-01-31 21:27:39,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:27:39,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-31 21:27:39,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:27:39,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-31 21:27:39,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1990, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 21:27:39,541 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:27:52,220 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-01-31 21:27:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-31 21:27:52,221 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 states have internal predecessors, (85), 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 89 [2022-01-31 21:27:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:27:52,221 INFO L225 Difference]: With dead ends: 100 [2022-01-31 21:27:52,221 INFO L226 Difference]: Without dead ends: 93 [2022-01-31 21:27:52,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 4 SyntacticMatches, 41 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=449, Invalid=7033, Unknown=0, NotChecked=0, Total=7482 [2022-01-31 21:27:52,222 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 87 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3125 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 3125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:27:52,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 38 Invalid, 3211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 3125 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-01-31 21:27:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-31 21:27:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-01-31 21:27:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-01-31 21:27:52,243 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 89 [2022-01-31 21:27:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:27:52,243 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-01-31 21:27:52,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-01-31 21:27:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-31 21:27:52,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:27:52,247 INFO L514 BasicCegarLoop]: trace histogram [40, 38, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:27:52,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 21:27:52,247 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:27:52,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:27:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1568373503, now seen corresponding path program 38 times [2022-01-31 21:27:52,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:27:52,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177531057] [2022-01-31 21:27:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:27:52,409 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:27:52,547 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:27:52,548 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:27:52,586 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:27:52,635 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:27:52,635 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:27:52,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:27:52,638 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_152.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_152.0) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:27:52,638 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_152.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_152.0) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:27:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:27:52,645 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_152.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_152.1) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:27:52,645 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_152.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_152.1) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:27:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:27:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:27:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:28:01,019 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:28:01,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177531057] [2022-01-31 21:28:01,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1177531057] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:28:01,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:28:01,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-01-31 21:28:01,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404870885] [2022-01-31 21:28:01,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:28:01,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-31 21:28:01,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:28:01,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-31 21:28:01,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2080, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 21:28:01,020 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:28:10,710 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-01-31 21:28:10,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-31 21:28:10,711 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 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 91 [2022-01-31 21:28:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:28:10,711 INFO L225 Difference]: With dead ends: 102 [2022-01-31 21:28:10,711 INFO L226 Difference]: Without dead ends: 95 [2022-01-31 21:28:10,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 4 SyntacticMatches, 42 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=460, Invalid=7372, Unknown=0, NotChecked=0, Total=7832 [2022-01-31 21:28:10,712 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 3572 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 3660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 3572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:28:10,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 218 Invalid, 3660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 3572 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-01-31 21:28:10,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-31 21:28:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-01-31 21:28:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-01-31 21:28:10,724 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 91 [2022-01-31 21:28:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:28:10,724 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-01-31 21:28:10,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-01-31 21:28:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-31 21:28:10,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:28:10,725 INFO L514 BasicCegarLoop]: trace histogram [41, 39, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:28:10,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 21:28:10,725 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:28:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:28:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash -90151654, now seen corresponding path program 39 times [2022-01-31 21:28:10,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:28:10,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [478093044] [2022-01-31 21:28:10,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:28:10,779 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:28:10,841 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:28:10,842 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:28:10,885 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:28:11,112 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:28:11,112 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:28:11,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:28:11,115 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_156.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_156.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:28:11,115 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_156.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_156.0)) 4294967296)) 10000000) 0) [2022-01-31 21:28:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:28:11,121 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_156.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_156.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:28:11,121 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_156.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_156.1)) 4294967296)) 10000000) 0) [2022-01-31 21:28:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:28:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:28:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:28:22,021 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:28:22,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [478093044] [2022-01-31 21:28:22,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [478093044] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:28:22,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:28:22,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-31 21:28:22,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220494262] [2022-01-31 21:28:22,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:28:22,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-31 21:28:22,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:28:22,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-31 21:28:22,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2172, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 21:28:22,022 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:28:33,648 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-01-31 21:28:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-31 21:28:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 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 93 [2022-01-31 21:28:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:28:33,648 INFO L225 Difference]: With dead ends: 104 [2022-01-31 21:28:33,648 INFO L226 Difference]: Without dead ends: 97 [2022-01-31 21:28:33,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 4 SyntacticMatches, 43 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=471, Invalid=7719, Unknown=0, NotChecked=0, Total=8190 [2022-01-31 21:28:33,649 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 91 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 3684 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:28:33,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 138 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3684 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-01-31 21:28:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-31 21:28:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-01-31 21:28:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2022-01-31 21:28:33,662 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 93 [2022-01-31 21:28:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:28:33,662 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2022-01-31 21:28:33,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-01-31 21:28:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-01-31 21:28:33,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:28:33,662 INFO L514 BasicCegarLoop]: trace histogram [42, 40, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:28:33,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 21:28:33,663 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:28:33,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:28:33,663 INFO L85 PathProgramCache]: Analyzing trace with hash -499960715, now seen corresponding path program 40 times [2022-01-31 21:28:33,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:28:33,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1175210336] [2022-01-31 21:28:33,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:28:33,716 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:28:33,783 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:28:33,783 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:28:33,820 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:28:33,884 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:28:33,885 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:28:33,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:28:33,887 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_160.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_160.0)) 4294967296)) 10000000) 0) [2022-01-31 21:28:33,887 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_160.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_160.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:28:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:28:33,894 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_160.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_160.1)) 4294967296)) 10000000) 0) [2022-01-31 21:28:33,894 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_160.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_160.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:28:33,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:28:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:28:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:28:44,454 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:28:44,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1175210336] [2022-01-31 21:28:44,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1175210336] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:28:44,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:28:44,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-31 21:28:44,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094490807] [2022-01-31 21:28:44,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:28:44,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 21:28:44,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:28:44,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 21:28:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2266, Unknown=0, NotChecked=0, Total=2450 [2022-01-31 21:28:44,455 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:28:55,284 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-01-31 21:28:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 21:28:55,284 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 states have internal predecessors, (91), 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 95 [2022-01-31 21:28:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:28:55,285 INFO L225 Difference]: With dead ends: 106 [2022-01-31 21:28:55,285 INFO L226 Difference]: Without dead ends: 99 [2022-01-31 21:28:55,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 4 SyntacticMatches, 44 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=482, Invalid=8074, Unknown=0, NotChecked=0, Total=8556 [2022-01-31 21:28:55,285 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 93 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3813 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:28:55,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 113 Invalid, 3905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 3813 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-01-31 21:28:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-31 21:28:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-01-31 21:28:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2022-01-31 21:28:55,299 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 95 [2022-01-31 21:28:55,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:28:55,299 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2022-01-31 21:28:55,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-01-31 21:28:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-31 21:28:55,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:28:55,299 INFO L514 BasicCegarLoop]: trace histogram [43, 41, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:28:55,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 21:28:55,299 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:28:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:28:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash 810522896, now seen corresponding path program 41 times [2022-01-31 21:28:55,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:28:55,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [10182409] [2022-01-31 21:28:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:28:55,506 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:28:55,574 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:28:55,575 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:28:55,613 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:28:55,662 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:28:55,662 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:28:55,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:28:55,665 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_164.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_164.0)) 4294967296)) 10000000) 0) [2022-01-31 21:28:55,665 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_164.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_164.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:28:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:28:55,671 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_164.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_164.1)) 4294967296)) 10000000) 0) [2022-01-31 21:28:55,671 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_164.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_164.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:28:55,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:28:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:28:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:29:09,899 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:29:09,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [10182409] [2022-01-31 21:29:09,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [10182409] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:29:09,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:29:09,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-01-31 21:29:09,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049678910] [2022-01-31 21:29:09,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:29:09,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-01-31 21:29:09,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:29:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-01-31 21:29:09,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2362, Unknown=0, NotChecked=0, Total=2550 [2022-01-31 21:29:09,900 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:29:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:29:25,301 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-01-31 21:29:25,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 21:29:25,301 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 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 97 [2022-01-31 21:29:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:29:25,302 INFO L225 Difference]: With dead ends: 108 [2022-01-31 21:29:25,302 INFO L226 Difference]: Without dead ends: 101 [2022-01-31 21:29:25,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 4 SyntacticMatches, 45 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=493, Invalid=8437, Unknown=0, NotChecked=0, Total=8930 [2022-01-31 21:29:25,303 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 95 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4130 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 4224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 4130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:29:25,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 203 Invalid, 4224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 4130 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-01-31 21:29:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-01-31 21:29:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-01-31 21:29:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:29:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2022-01-31 21:29:25,317 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 97 [2022-01-31 21:29:25,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:29:25,317 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2022-01-31 21:29:25,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:29:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-01-31 21:29:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-31 21:29:25,317 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:29:25,317 INFO L514 BasicCegarLoop]: trace histogram [44, 42, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:29:25,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 21:29:25,318 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:29:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:29:25,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1759855339, now seen corresponding path program 42 times [2022-01-31 21:29:25,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:29:25,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1524648238] [2022-01-31 21:29:25,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:29:27,381 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:29:27,447 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:29:27,448 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:29:27,488 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:29:27,533 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:29:27,534 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:29:27,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:29:27,536 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_168.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_168.0)) 4294967296)) 10000000) 0) [2022-01-31 21:29:27,536 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_168.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_168.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:29:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:29:27,542 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_168.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_168.1)) 4294967296)) 10000000) 0) [2022-01-31 21:29:27,542 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_168.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_168.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:29:27,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:29:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:29:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:29:45,706 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:29:45,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1524648238] [2022-01-31 21:29:45,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1524648238] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:29:45,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:29:45,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-01-31 21:29:45,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435136033] [2022-01-31 21:29:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:29:45,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-31 21:29:45,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:29:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-31 21:29:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2460, Unknown=0, NotChecked=0, Total=2652 [2022-01-31 21:29:45,708 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:30:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:30:03,669 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-01-31 21:30:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-31 21:30:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 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 99 [2022-01-31 21:30:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:30:03,670 INFO L225 Difference]: With dead ends: 110 [2022-01-31 21:30:03,670 INFO L226 Difference]: Without dead ends: 103 [2022-01-31 21:30:03,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 4 SyntacticMatches, 46 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=504, Invalid=8808, Unknown=0, NotChecked=0, Total=9312 [2022-01-31 21:30:03,671 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 97 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4224 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 4320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 4224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:30:03,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 203 Invalid, 4320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 4224 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2022-01-31 21:30:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-31 21:30:03,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-01-31 21:30:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:30:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2022-01-31 21:30:03,686 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 99 [2022-01-31 21:30:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:30:03,686 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2022-01-31 21:30:03,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:30:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-01-31 21:30:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-31 21:30:03,687 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:30:03,687 INFO L514 BasicCegarLoop]: trace histogram [45, 43, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:30:03,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 21:30:03,687 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:30:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:30:03,687 INFO L85 PathProgramCache]: Analyzing trace with hash -759700986, now seen corresponding path program 43 times [2022-01-31 21:30:03,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:30:03,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [374371559] [2022-01-31 21:30:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:30:03,745 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:30:03,830 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:30:03,831 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:30:03,873 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:30:03,923 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:30:03,924 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:30:03,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:30:03,926 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_172.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_172.0) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:30:03,926 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_172.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_172.0) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:30:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:30:03,933 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_172.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_172.1) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:30:03,933 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_172.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_172.1) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:30:04,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:30:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:30:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:30:21,530 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:30:21,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [374371559] [2022-01-31 21:30:21,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [374371559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:30:21,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:30:21,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-01-31 21:30:21,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034980717] [2022-01-31 21:30:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:30:21,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-31 21:30:21,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:30:21,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-31 21:30:21,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2022-01-31 21:30:21,531 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:30:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:30:40,006 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-01-31 21:30:40,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-31 21:30:40,007 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 states have internal predecessors, (97), 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 101 [2022-01-31 21:30:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:30:40,007 INFO L225 Difference]: With dead ends: 112 [2022-01-31 21:30:40,007 INFO L226 Difference]: Without dead ends: 105 [2022-01-31 21:30:40,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 4 SyntacticMatches, 47 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=515, Invalid=9187, Unknown=0, NotChecked=0, Total=9702 [2022-01-31 21:30:40,008 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 99 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4235 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 4333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:30:40,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 98 Invalid, 4333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4235 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2022-01-31 21:30:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-31 21:30:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-01-31 21:30:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:30:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2022-01-31 21:30:40,023 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 101 [2022-01-31 21:30:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:30:40,024 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2022-01-31 21:30:40,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:30:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2022-01-31 21:30:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-31 21:30:40,024 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:30:40,024 INFO L514 BasicCegarLoop]: trace histogram [46, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:30:40,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 21:30:40,025 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:30:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:30:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash 308225633, now seen corresponding path program 44 times [2022-01-31 21:30:40,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:30:40,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942952973] [2022-01-31 21:30:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:30:40,117 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:30:40,185 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:30:40,185 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:30:40,228 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:30:40,284 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:30:40,284 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:30:40,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:30:40,287 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_176.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_176.0) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:30:40,288 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_176.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_176.0) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:30:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:30:40,296 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_176.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_176.1) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:30:40,297 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_176.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_176.1) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:30:40,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:30:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:30:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:30:51,459 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:30:51,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942952973] [2022-01-31 21:30:51,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [942952973] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:30:51,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:30:51,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-01-31 21:30:51,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772998364] [2022-01-31 21:30:51,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:30:51,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-31 21:30:51,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:30:51,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-31 21:30:51,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2662, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 21:30:51,461 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:31:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:31:05,027 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2022-01-31 21:31:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-31 21:31:05,027 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 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 103 [2022-01-31 21:31:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:31:05,028 INFO L225 Difference]: With dead ends: 114 [2022-01-31 21:31:05,028 INFO L226 Difference]: Without dead ends: 107 [2022-01-31 21:31:05,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 4 SyntacticMatches, 48 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=526, Invalid=9574, Unknown=0, NotChecked=0, Total=10100 [2022-01-31 21:31:05,028 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 101 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4538 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 4638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 4538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:31:05,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 173 Invalid, 4638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 4538 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-01-31 21:31:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-31 21:31:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-01-31 21:31:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:31:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2022-01-31 21:31:05,043 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 103 [2022-01-31 21:31:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:31:05,043 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2022-01-31 21:31:05,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:31:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-01-31 21:31:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-31 21:31:05,044 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:31:05,044 INFO L514 BasicCegarLoop]: trace histogram [47, 45, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:31:05,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 21:31:05,044 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:31:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:31:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash 88522748, now seen corresponding path program 45 times [2022-01-31 21:31:05,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:31:05,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2035451166] [2022-01-31 21:31:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:31:05,439 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:31:05,515 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:31:05,515 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:31:05,556 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:31:05,622 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:31:05,623 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:31:05,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:31:05,626 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_180.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_180.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:31:05,626 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_180.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_180.0)) 4294967296)) 10000000) 0) [2022-01-31 21:31:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:31:05,633 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_180.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_180.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:31:05,634 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_180.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_180.1)) 4294967296)) 10000000) 0) [2022-01-31 21:31:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:31:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:31:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:31:24,000 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:31:24,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2035451166] [2022-01-31 21:31:24,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2035451166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:31:24,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:31:24,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-01-31 21:31:24,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62261573] [2022-01-31 21:31:24,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:31:24,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-31 21:31:24,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:31:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-31 21:31:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2766, Unknown=0, NotChecked=0, Total=2970 [2022-01-31 21:31:24,001 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:31:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:31:44,724 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2022-01-31 21:31:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-31 21:31:44,724 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 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 105 [2022-01-31 21:31:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:31:44,724 INFO L225 Difference]: With dead ends: 116 [2022-01-31 21:31:44,725 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 21:31:44,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 4 SyntacticMatches, 49 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=537, Invalid=9969, Unknown=0, NotChecked=0, Total=10506 [2022-01-31 21:31:44,725 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 103 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4846 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 4948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 4846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:31:44,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 193 Invalid, 4948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 4846 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2022-01-31 21:31:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 21:31:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-01-31 21:31:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:31:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2022-01-31 21:31:44,740 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 105 [2022-01-31 21:31:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:31:44,740 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2022-01-31 21:31:44,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:31:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-01-31 21:31:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-31 21:31:44,740 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:31:44,740 INFO L514 BasicCegarLoop]: trace histogram [48, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:31:44,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 21:31:44,741 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:31:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:31:44,741 INFO L85 PathProgramCache]: Analyzing trace with hash -592552233, now seen corresponding path program 46 times [2022-01-31 21:31:44,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:31:44,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038971381] [2022-01-31 21:31:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:31:44,802 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:31:44,861 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:31:44,861 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:31:44,902 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:31:44,943 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:31:44,943 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:31:44,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:31:44,945 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_184.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_184.0) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:31:44,946 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_184.0) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_184.0) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:31:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:31:44,954 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_184.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_184.1) main_~x~0_6) 4294967296)) 10000000) 0) [2022-01-31 21:31:44,954 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_184.1) (- main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_184.1) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-01-31 21:31:45,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:31:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:31:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:32:04,710 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:32:04,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038971381] [2022-01-31 21:32:04,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2038971381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:32:04,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:32:04,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-01-31 21:32:04,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404929651] [2022-01-31 21:32:04,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:32:04,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-31 21:32:04,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:32:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-31 21:32:04,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2872, Unknown=0, NotChecked=0, Total=3080 [2022-01-31 21:32:04,712 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:32:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:32:24,333 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2022-01-31 21:32:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-31 21:32:24,333 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 states have internal predecessors, (103), 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 107 [2022-01-31 21:32:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:32:24,334 INFO L225 Difference]: With dead ends: 118 [2022-01-31 21:32:24,334 INFO L226 Difference]: Without dead ends: 111 [2022-01-31 21:32:24,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 4 SyntacticMatches, 50 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=548, Invalid=10372, Unknown=0, NotChecked=0, Total=10920 [2022-01-31 21:32:24,335 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 5060 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 5164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 5060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:32:24,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 263 Invalid, 5164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 5060 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2022-01-31 21:32:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-31 21:32:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-01-31 21:32:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:32:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2022-01-31 21:32:24,349 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 107 [2022-01-31 21:32:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:32:24,349 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2022-01-31 21:32:24,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:32:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2022-01-31 21:32:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-31 21:32:24,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:32:24,349 INFO L514 BasicCegarLoop]: trace histogram [49, 47, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:32:24,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 21:32:24,351 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:32:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:32:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2024387314, now seen corresponding path program 47 times [2022-01-31 21:32:24,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:32:24,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849618999] [2022-01-31 21:32:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:32:24,433 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:32:24,523 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:32:24,523 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:32:24,561 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:32:24,606 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:32:24,606 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:32:24,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:32:24,609 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_188.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_188.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:32:24,609 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_188.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_188.0)) 4294967296)) 10000000) 0) [2022-01-31 21:32:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:32:24,615 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_188.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_188.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:32:24,615 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_188.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_188.1)) 4294967296)) 10000000) 0) [2022-01-31 21:32:24,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:32:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:32:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:32:39,030 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:32:39,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849618999] [2022-01-31 21:32:39,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1849618999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:32:39,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:32:39,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-01-31 21:32:39,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40782439] [2022-01-31 21:32:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:32:39,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-01-31 21:32:39,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:32:39,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-01-31 21:32:39,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2980, Unknown=0, NotChecked=0, Total=3192 [2022-01-31 21:32:39,032 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:32:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:32:54,116 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-01-31 21:32:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-31 21:32:54,116 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 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 109 [2022-01-31 21:32:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:32:54,117 INFO L225 Difference]: With dead ends: 120 [2022-01-31 21:32:54,117 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 21:32:54,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 4 SyntacticMatches, 51 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=559, Invalid=10783, Unknown=0, NotChecked=0, Total=11342 [2022-01-31 21:32:54,118 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 107 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 4919 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 4919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:32:54,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 53 Invalid, 5025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 4919 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-01-31 21:32:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 21:32:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-01-31 21:32:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:32:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2022-01-31 21:32:54,132 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 109 [2022-01-31 21:32:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:32:54,132 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2022-01-31 21:32:54,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:32:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-01-31 21:32:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-31 21:32:54,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:32:54,133 INFO L514 BasicCegarLoop]: trace histogram [50, 48, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:32:54,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 21:32:54,133 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:32:54,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:32:54,133 INFO L85 PathProgramCache]: Analyzing trace with hash 52456525, now seen corresponding path program 48 times [2022-01-31 21:32:54,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:32:54,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [771383231] [2022-01-31 21:32:54,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:32:54,211 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:32:54,304 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:32:54,305 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:32:54,365 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:32:54,433 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:32:54,434 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:32:54,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:32:54,436 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_192.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_192.0)) 4294967296)) 10000000) 0) [2022-01-31 21:32:54,437 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_192.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_192.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:32:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:32:54,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_192.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_192.1)) 4294967296)) 10000000) 0) [2022-01-31 21:32:54,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_192.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_192.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:32:54,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:32:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:32:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:33:11,671 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:33:11,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [771383231] [2022-01-31 21:33:11,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [771383231] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:33:11,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:33:11,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-01-31 21:33:11,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680289609] [2022-01-31 21:33:11,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:33:11,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-31 21:33:11,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:33:11,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-31 21:33:11,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3090, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 21:33:11,672 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:33:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:33:31,657 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2022-01-31 21:33:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-31 21:33:31,657 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 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 111 [2022-01-31 21:33:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:33:31,657 INFO L225 Difference]: With dead ends: 122 [2022-01-31 21:33:31,658 INFO L226 Difference]: Without dead ends: 115 [2022-01-31 21:33:31,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 4 SyntacticMatches, 52 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=570, Invalid=11202, Unknown=0, NotChecked=0, Total=11772 [2022-01-31 21:33:31,658 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 109 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 5454 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 5562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 5454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:33:31,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 263 Invalid, 5562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 5454 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2022-01-31 21:33:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-01-31 21:33:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-01-31 21:33:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:33:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2022-01-31 21:33:31,678 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 111 [2022-01-31 21:33:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:33:31,679 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2022-01-31 21:33:31,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:33:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-01-31 21:33:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-31 21:33:31,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:33:31,679 INFO L514 BasicCegarLoop]: trace histogram [51, 49, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:33:31,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 21:33:31,680 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:33:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:33:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash -892454168, now seen corresponding path program 49 times [2022-01-31 21:33:31,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:33:31,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371180678] [2022-01-31 21:33:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:33:31,750 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:33:31,818 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:33:31,819 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:33:31,861 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:33:31,922 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:33:31,922 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:33:31,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:33:31,925 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_196.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_196.0)) 4294967296)) 10000000) 0) [2022-01-31 21:33:31,925 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_196.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_196.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:33:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:33:31,931 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_196.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_196.1)) 4294967296)) 10000000) 0) [2022-01-31 21:33:31,931 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_196.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_196.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:33:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:33:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:33:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:33:53,947 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:33:53,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371180678] [2022-01-31 21:33:53,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1371180678] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:33:53,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:33:53,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-01-31 21:33:53,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336713868] [2022-01-31 21:33:53,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:33:53,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-01-31 21:33:53,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:33:53,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-01-31 21:33:53,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3202, Unknown=0, NotChecked=0, Total=3422 [2022-01-31 21:33:53,949 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:34:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:34:17,644 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-01-31 21:34:17,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-01-31 21:34:17,645 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 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 113 [2022-01-31 21:34:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:34:17,645 INFO L225 Difference]: With dead ends: 124 [2022-01-31 21:34:17,646 INFO L226 Difference]: Without dead ends: 117 [2022-01-31 21:34:17,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 4 SyntacticMatches, 53 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=581, Invalid=11629, Unknown=0, NotChecked=0, Total=12210 [2022-01-31 21:34:17,647 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 111 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5465 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 5575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 5465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:34:17,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 143 Invalid, 5575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 5465 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2022-01-31 21:34:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-01-31 21:34:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-01-31 21:34:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:34:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2022-01-31 21:34:17,665 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 113 [2022-01-31 21:34:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:34:17,665 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2022-01-31 21:34:17,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:34:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-01-31 21:34:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-31 21:34:17,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:34:17,665 INFO L514 BasicCegarLoop]: trace histogram [52, 50, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:34:17,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 21:34:17,665 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:34:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:34:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1581436611, now seen corresponding path program 50 times [2022-01-31 21:34:17,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:34:17,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2144476062] [2022-01-31 21:34:17,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:34:17,743 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:34:17,845 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:34:17,846 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:34:17,893 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:34:17,963 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:34:17,964 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:34:17,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:34:17,966 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_200.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_200.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:34:17,966 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_200.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_200.0)) 4294967296)) 10000000) 0) [2022-01-31 21:34:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:34:17,972 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_200.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_200.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:34:17,972 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_200.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_200.1)) 4294967296)) 10000000) 0) [2022-01-31 21:34:18,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:34:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:34:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:34:40,553 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:34:40,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2144476062] [2022-01-31 21:34:40,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2144476062] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:34:40,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:34:40,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-01-31 21:34:40,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276841496] [2022-01-31 21:34:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:34:40,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-31 21:34:40,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:34:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-31 21:34:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3316, Unknown=0, NotChecked=0, Total=3540 [2022-01-31 21:34:40,555 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:35:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:35:04,767 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2022-01-31 21:35:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-01-31 21:35:04,768 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 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 115 [2022-01-31 21:35:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:35:04,768 INFO L225 Difference]: With dead ends: 126 [2022-01-31 21:35:04,768 INFO L226 Difference]: Without dead ends: 119 [2022-01-31 21:35:04,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 4 SyntacticMatches, 54 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=592, Invalid=12064, Unknown=0, NotChecked=0, Total=12656 [2022-01-31 21:35:04,769 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 113 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 5939 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 6051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 5939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:35:04,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 248 Invalid, 6051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 5939 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2022-01-31 21:35:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-01-31 21:35:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-01-31 21:35:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:35:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2022-01-31 21:35:04,786 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 115 [2022-01-31 21:35:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:35:04,786 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2022-01-31 21:35:04,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:35:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2022-01-31 21:35:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-31 21:35:04,786 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:35:04,786 INFO L514 BasicCegarLoop]: trace histogram [53, 51, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:35:04,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 21:35:04,787 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:35:04,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:35:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash -421406754, now seen corresponding path program 51 times [2022-01-31 21:35:04,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:35:04,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923932761] [2022-01-31 21:35:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:35:04,881 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:35:04,947 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:35:04,947 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:35:04,993 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:35:05,067 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:35:05,068 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:35:05,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:35:05,070 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_204.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_204.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:35:05,070 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_204.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_204.0)) 4294967296)) 10000000) 0) [2022-01-31 21:35:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:35:05,077 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_204.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_204.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:35:05,077 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_204.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_204.1)) 4294967296)) 10000000) 0) [2022-01-31 21:35:05,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:35:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:35:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:35:23,159 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:35:23,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923932761] [2022-01-31 21:35:23,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1923932761] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:35:23,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:35:23,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-01-31 21:35:23,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453669605] [2022-01-31 21:35:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:35:23,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-31 21:35:23,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:35:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-31 21:35:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=3432, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 21:35:23,160 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:35:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:35:42,875 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-01-31 21:35:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-01-31 21:35:42,875 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 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 117 [2022-01-31 21:35:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:35:42,876 INFO L225 Difference]: With dead ends: 128 [2022-01-31 21:35:42,876 INFO L226 Difference]: Without dead ends: 121 [2022-01-31 21:35:42,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 4 SyntacticMatches, 55 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=603, Invalid=12507, Unknown=0, NotChecked=0, Total=13110 [2022-01-31 21:35:42,878 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 115 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 6056 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 6056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:35:42,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 188 Invalid, 6170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 6056 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2022-01-31 21:35:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-31 21:35:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-31 21:35:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:35:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2022-01-31 21:35:42,893 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 117 [2022-01-31 21:35:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:35:42,893 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2022-01-31 21:35:42,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:35:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2022-01-31 21:35:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-31 21:35:42,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:35:42,893 INFO L514 BasicCegarLoop]: trace histogram [54, 52, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:35:42,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 21:35:42,894 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:35:42,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:35:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1008531911, now seen corresponding path program 52 times [2022-01-31 21:35:42,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:35:42,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [621182521] [2022-01-31 21:35:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:35:43,202 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:35:43,302 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:35:43,303 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:35:43,349 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:35:43,474 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:35:43,475 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 21:35:43,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:35:43,478 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_208.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_208.0)) 4294967296)) 10000000) 0) [2022-01-31 21:35:43,478 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_208.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_208.0)) 4294967296)) 100000000) 0)) [2022-01-31 21:35:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:35:43,485 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (- main_~x~0_6) (* (- 2) .v_it_208.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_208.1)) 4294967296)) 10000000) 0) [2022-01-31 21:35:43,485 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (- main_~x~0_6) (* (- 2) .v_it_208.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_208.1)) 4294967296)) 100000000) 0)) [2022-01-31 21:35:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:35:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:35:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:36:07,266 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:36:07,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [621182521] [2022-01-31 21:36:07,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [621182521] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:36:07,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:36:07,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-01-31 21:36:07,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694034517] [2022-01-31 21:36:07,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:36:07,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-01-31 21:36:07,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:36:07,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-01-31 21:36:07,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3550, Unknown=0, NotChecked=0, Total=3782 [2022-01-31 21:36:07,267 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 states have internal predecessors, (115), 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)