/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:16:16,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:16:16,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:16:16,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:16:16,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:16:16,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:16:16,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:16:16,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:16:16,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:16:16,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:16:16,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:16:16,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:16:16,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:16:16,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:16:16,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:16:16,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:16:16,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:16:16,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:16:16,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:16:16,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:16:16,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:16:16,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:16:16,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:16:16,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:16:16,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:16:16,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:16:16,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:16:16,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:16:16,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:16:16,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:16:16,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:16:16,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:16:16,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:16:16,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:16:16,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:16:16,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:16:16,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:16:16,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:16:16,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:16:16,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:16:16,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:16:16,675 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:16:16,680 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:16:16,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:16:16,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:16:16,681 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:16:16,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:16:16,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:16:16,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:16:16,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:16:16,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:16:16,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:16:16,682 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:16:16,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:16:16,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:16:16,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:16:16,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:16:16,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:16:16,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:16:16,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:16:16,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:16:16,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:16:16,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:16:16,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:16:16,683 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:16:16,684 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:16:16,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:16:16,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:16:16,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:16:16,930 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:16:16,932 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:16:16,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-01-31 21:16:16,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13abc09bc/99591c74167f4449a4c2d9707c4acb88/FLAG047587752 [2022-01-31 21:16:17,320 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:16:17,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-01-31 21:16:17,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13abc09bc/99591c74167f4449a4c2d9707c4acb88/FLAG047587752 [2022-01-31 21:16:17,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13abc09bc/99591c74167f4449a4c2d9707c4acb88 [2022-01-31 21:16:17,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:16:17,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:16:17,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:16:17,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:16:17,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:16:17,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:16:17" (1/1) ... [2022-01-31 21:16:17,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5b9b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17, skipping insertion in model container [2022-01-31 21:16:17,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:16:17" (1/1) ... [2022-01-31 21:16:17,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:16:17,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:16:17,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c[368,381] [2022-01-31 21:16:17,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:16:17,904 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:16:17,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c[368,381] [2022-01-31 21:16:17,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:16:17,933 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:16:17,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17 WrapperNode [2022-01-31 21:16:17,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:16:17,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:16:17,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:16:17,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:16:17,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17" (1/1) ... [2022-01-31 21:16:17,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17" (1/1) ... [2022-01-31 21:16:17,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17" (1/1) ... [2022-01-31 21:16:17,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17" (1/1) ... [2022-01-31 21:16:17,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17" (1/1) ... [2022-01-31 21:16:17,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17" (1/1) ... [2022-01-31 21:16:17,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17" (1/1) ... [2022-01-31 21:16:17,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:16:17,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:16:17,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:16:17,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:16:17,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17" (1/1) ... [2022-01-31 21:16:17,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:16:17,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:16:17,991 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:16:17,996 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:16:18,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:16:18,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:16:18,026 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:16:18,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:16:18,026 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:16:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:16:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:16:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:16:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:16:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 21:16:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:16:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:16:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:16:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:16:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:16:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:16:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:16:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:16:18,075 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:16:18,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:16:18,210 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:16:18,214 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:16:18,214 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-31 21:16:18,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:16:18 BoogieIcfgContainer [2022-01-31 21:16:18,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:16:18,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:16:18,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:16:18,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:16:18,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:16:17" (1/3) ... [2022-01-31 21:16:18,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e17809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:16:18, skipping insertion in model container [2022-01-31 21:16:18,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:16:17" (2/3) ... [2022-01-31 21:16:18,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e17809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:16:18, skipping insertion in model container [2022-01-31 21:16:18,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:16:18" (3/3) ... [2022-01-31 21:16:18,238 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.c [2022-01-31 21:16:18,241 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:16:18,242 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:16:18,291 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:16:18,295 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:16:18,296 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:16:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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:16:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:16:18,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:18,327 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:18,327 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:18,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:18,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-01-31 21:16:18,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:18,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [192613321] [2022-01-31 21:16:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:18,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:18,427 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:16:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:18,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:18,544 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:16:18,545 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:18,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [192613321] [2022-01-31 21:16:18,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [192613321] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:18,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:18,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 21:16:18,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980080204] [2022-01-31 21:16:18,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:18,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 21:16:18,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:18,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 21:16:18,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 21:16:18,575 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:16:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:18,621 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-01-31 21:16:18,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 21:16:18,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 21:16:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:18,627 INFO L225 Difference]: With dead ends: 43 [2022-01-31 21:16:18,627 INFO L226 Difference]: Without dead ends: 18 [2022-01-31 21:16:18,628 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:16:18,631 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 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:16:18,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-31 21:16:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-31 21:16:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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:16:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-01-31 21:16:18,663 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-01-31 21:16:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:18,663 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-01-31 21:16:18,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 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:16:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-01-31 21:16:18,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:16:18,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:18,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:18,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:16:18,665 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:18,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-01-31 21:16:18,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:18,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [275713610] [2022-01-31 21:16:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:18,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:18,668 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:16:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:18,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:18,986 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:16:18,987 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [275713610] [2022-01-31 21:16:18,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [275713610] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:18,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:18,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:16:19,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933378054] [2022-01-31 21:16:19,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:19,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:16:19,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:19,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:16:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:16:19,003 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:16:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:19,170 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-01-31 21:16:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:16:19,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 21:16:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:19,171 INFO L225 Difference]: With dead ends: 38 [2022-01-31 21:16:19,171 INFO L226 Difference]: Without dead ends: 19 [2022-01-31 21:16:19,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:16:19,173 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:19,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-31 21:16:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-31 21:16:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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:16:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-01-31 21:16:19,178 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 17 [2022-01-31 21:16:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:19,178 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-01-31 21:16:19,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:16:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-01-31 21:16:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:16:19,179 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:19,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:19,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:16:19,179 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash -121895178, now seen corresponding path program 1 times [2022-01-31 21:16:19,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:19,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [142826984] [2022-01-31 21:16:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:19,278 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:19,279 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:19,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:19,287 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:19,310 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:19,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:19,465 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:16:19,761 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:19,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [142826984] [2022-01-31 21:16:19,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [142826984] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:19,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:19,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:16:19,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937288499] [2022-01-31 21:16:19,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:19,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:16:19,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:19,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:16:19,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:16:19,763 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:16:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:20,074 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-01-31 21:16:20,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:16:20,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 21:16:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:20,076 INFO L225 Difference]: With dead ends: 39 [2022-01-31 21:16:20,076 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 21:16:20,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:16:20,078 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:20,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 41 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 94 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2022-01-31 21:16:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 21:16:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2022-01-31 21:16:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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:16:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-01-31 21:16:20,087 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 18 [2022-01-31 21:16:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:20,088 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-01-31 21:16:20,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:16:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-01-31 21:16:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 21:16:20,088 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:20,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:20,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:16:20,089 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:20,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:20,089 INFO L85 PathProgramCache]: Analyzing trace with hash 550711896, now seen corresponding path program 1 times [2022-01-31 21:16:20,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:20,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990117075] [2022-01-31 21:16:20,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:20,152 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:20,153 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:20,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:20,158 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:20,167 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:20,190 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:16:20,208 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:20,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990117075] [2022-01-31 21:16:20,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1990117075] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:20,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:20,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:16:20,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101686004] [2022-01-31 21:16:20,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:20,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:16:20,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:20,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:16:20,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:16:20,210 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:16:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:20,296 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2022-01-31 21:16:20,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:16:20,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:16:20,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:20,297 INFO L225 Difference]: With dead ends: 45 [2022-01-31 21:16:20,297 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 21:16:20,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:16:20,298 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:20,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 21:16:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-01-31 21:16:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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:16:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-01-31 21:16:20,310 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 19 [2022-01-31 21:16:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:20,310 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-01-31 21:16:20,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:16:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-01-31 21:16:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 21:16:20,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:20,311 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:20,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:16:20,311 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1953540295, now seen corresponding path program 1 times [2022-01-31 21:16:20,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:20,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [714075709] [2022-01-31 21:16:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:20,377 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:20,378 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:20,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:20,383 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:20,388 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:20,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:16:20,418 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:20,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [714075709] [2022-01-31 21:16:20,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [714075709] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:20,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:20,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:16:20,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416388003] [2022-01-31 21:16:20,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:20,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:16:20,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:16:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:16:20,420 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:16:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:20,503 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-01-31 21:16:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:16:20,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:16:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:20,504 INFO L225 Difference]: With dead ends: 51 [2022-01-31 21:16:20,504 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 21:16:20,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:16:20,505 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:20,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 27 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 21:16:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2022-01-31 21:16:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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:16:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-01-31 21:16:20,517 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 19 [2022-01-31 21:16:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:20,517 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-01-31 21:16:20,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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:16:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-01-31 21:16:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 21:16:20,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:20,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:20,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:16:20,518 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:20,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1989908199, now seen corresponding path program 1 times [2022-01-31 21:16:20,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:20,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1784808210] [2022-01-31 21:16:20,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:20,555 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:20,555 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:20,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:20,560 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:16:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:20,569 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:16:20,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:20,596 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:16:20,613 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:20,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1784808210] [2022-01-31 21:16:20,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1784808210] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:20,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:20,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:16:20,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044800392] [2022-01-31 21:16:20,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:20,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:16:20,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:20,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:16:20,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:16:20,615 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:16:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:20,694 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-01-31 21:16:20,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:16:20,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:16:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:20,695 INFO L225 Difference]: With dead ends: 47 [2022-01-31 21:16:20,695 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 21:16:20,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:16:20,696 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:20,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 33 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:20,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 21:16:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-01-31 21:16:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 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:16:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-01-31 21:16:20,707 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2022-01-31 21:16:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:20,708 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-01-31 21:16:20,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:16:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-01-31 21:16:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:16:20,708 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:20,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:20,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:16:20,709 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash -36937386, now seen corresponding path program 1 times [2022-01-31 21:16:20,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:20,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2041357895] [2022-01-31 21:16:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:20,745 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:20,746 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:20,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:20,750 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:20,755 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:20,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:20,770 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:16:20,783 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:20,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2041357895] [2022-01-31 21:16:20,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2041357895] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:20,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:20,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:16:20,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907603179] [2022-01-31 21:16:20,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:20,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:16:20,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:20,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:16:20,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:16:20,785 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 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:16:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:20,884 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-01-31 21:16:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:16:20,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 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 20 [2022-01-31 21:16:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:20,885 INFO L225 Difference]: With dead ends: 54 [2022-01-31 21:16:20,885 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 21:16:20,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:16:20,886 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:20,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 25 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 21:16:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2022-01-31 21:16:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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:16:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-01-31 21:16:20,896 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 20 [2022-01-31 21:16:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:20,896 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-01-31 21:16:20,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 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:16:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-01-31 21:16:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:16:20,897 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:20,897 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:20,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:16:20,897 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1992076293, now seen corresponding path program 1 times [2022-01-31 21:16:20,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:20,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [529025572] [2022-01-31 21:16:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:20,953 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:20,953 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:20,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:20,963 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:20,976 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:21,022 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:16:21,046 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:21,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [529025572] [2022-01-31 21:16:21,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [529025572] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:21,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:21,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:16:21,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157370878] [2022-01-31 21:16:21,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:21,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:16:21,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:21,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:16:21,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:16:21,048 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:16:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:21,209 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2022-01-31 21:16:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:16:21,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2022-01-31 21:16:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:21,213 INFO L225 Difference]: With dead ends: 60 [2022-01-31 21:16:21,213 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 21:16:21,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:16:21,214 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 54 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:21,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 34 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 21:16:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-01-31 21:16:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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:16:21,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-01-31 21:16:21,237 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 20 [2022-01-31 21:16:21,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:21,238 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-01-31 21:16:21,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:16:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-01-31 21:16:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 21:16:21,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:21,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:21,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:16:21,239 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:21,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash 30273528, now seen corresponding path program 1 times [2022-01-31 21:16:21,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:21,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1294083760] [2022-01-31 21:16:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:21,281 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:21,285 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:21,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:21,293 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:21,313 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:21,336 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:16:21,346 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:21,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1294083760] [2022-01-31 21:16:21,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1294083760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:21,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:21,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:16:21,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477712354] [2022-01-31 21:16:21,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:21,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:16:21,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:16:21,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:16:21,348 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:16:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:21,420 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-01-31 21:16:21,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:16:21,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:16:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:21,421 INFO L225 Difference]: With dead ends: 44 [2022-01-31 21:16:21,421 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 21:16:21,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:16:21,423 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:21,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:16:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 21:16:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-01-31 21:16:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 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:16:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-01-31 21:16:21,438 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 21 [2022-01-31 21:16:21,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:21,438 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-01-31 21:16:21,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:16:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-01-31 21:16:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 21:16:21,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:21,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:21,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:16:21,439 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash -694813431, now seen corresponding path program 1 times [2022-01-31 21:16:21,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:21,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2140869258] [2022-01-31 21:16:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:21,474 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:21,475 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:21,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:21,481 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:16:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:21,498 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:16:21,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:21,539 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:16:21,557 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:21,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2140869258] [2022-01-31 21:16:21,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2140869258] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:21,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:21,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:16:21,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757698084] [2022-01-31 21:16:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:21,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:16:21,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:21,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:16:21,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:16:21,559 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:16:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:21,675 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-01-31 21:16:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:16:21,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:16:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:21,676 INFO L225 Difference]: With dead ends: 45 [2022-01-31 21:16:21,676 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 21:16:21,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:16:21,676 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:21,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 21:16:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-01-31 21:16:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 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:16:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-01-31 21:16:21,687 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 21 [2022-01-31 21:16:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:21,687 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-01-31 21:16:21,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:16:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-01-31 21:16:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 21:16:21,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:21,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:21,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:16:21,688 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:21,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1372943636, now seen corresponding path program 1 times [2022-01-31 21:16:21,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:21,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [77625410] [2022-01-31 21:16:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:21,732 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:21,733 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:21,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:21,736 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:21,748 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:21,840 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:16:22,389 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:22,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [77625410] [2022-01-31 21:16:22,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [77625410] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:22,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:22,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:16:22,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389864668] [2022-01-31 21:16:22,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:22,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:16:22,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:22,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:16:22,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:16:22,391 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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:16:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:22,578 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-01-31 21:16:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:16:22,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 22 [2022-01-31 21:16:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:22,578 INFO L225 Difference]: With dead ends: 45 [2022-01-31 21:16:22,579 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 21:16:22,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:16:22,579 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:22,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 50 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 75 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2022-01-31 21:16:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 21:16:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-01-31 21:16:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 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:16:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-01-31 21:16:22,591 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 22 [2022-01-31 21:16:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:22,591 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-01-31 21:16:22,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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:16:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-01-31 21:16:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 21:16:22,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:22,592 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:22,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:16:22,592 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash -152141755, now seen corresponding path program 2 times [2022-01-31 21:16:22,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:22,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1204998275] [2022-01-31 21:16:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:22,624 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:22,624 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:22,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:22,628 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:22,635 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:22,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:22,670 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:16:22,686 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:22,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1204998275] [2022-01-31 21:16:22,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1204998275] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:22,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:22,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:16:22,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739766818] [2022-01-31 21:16:22,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:22,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:16:22,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:22,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:16:22,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:16:22,687 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:16:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:22,849 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-01-31 21:16:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:16:22,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 22 [2022-01-31 21:16:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:22,851 INFO L225 Difference]: With dead ends: 63 [2022-01-31 21:16:22,851 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 21:16:22,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:16:22,851 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:22,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 50 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 21:16:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-01-31 21:16:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 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:16:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2022-01-31 21:16:22,862 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 22 [2022-01-31 21:16:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:22,863 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2022-01-31 21:16:22,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:16:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-01-31 21:16:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:16:22,866 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:22,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:22,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:16:22,866 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:22,866 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 1 times [2022-01-31 21:16:22,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:22,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038579639] [2022-01-31 21:16:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:22,900 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:22,900 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:22,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:22,906 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:22,943 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:23,087 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:16:23,367 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:23,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038579639] [2022-01-31 21:16:23,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2038579639] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:23,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:23,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:16:23,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427190216] [2022-01-31 21:16:23,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:23,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:16:23,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:23,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:16:23,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:16:23,369 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 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:16:23,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:23,681 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2022-01-31 21:16:23,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:16:23,682 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 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:16:23,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:23,682 INFO L225 Difference]: With dead ends: 52 [2022-01-31 21:16:23,682 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 21:16:23,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:16:23,683 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:23,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 136 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2022-01-31 21:16:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 21:16:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-01-31 21:16:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.475) internal successors, (59), 40 states have internal predecessors, (59), 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:16:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2022-01-31 21:16:23,695 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 23 [2022-01-31 21:16:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:23,696 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2022-01-31 21:16:23,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 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:16:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2022-01-31 21:16:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:16:23,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:23,696 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:23,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:16:23,696 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:23,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:23,697 INFO L85 PathProgramCache]: Analyzing trace with hash 547263768, now seen corresponding path program 2 times [2022-01-31 21:16:23,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:23,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333652794] [2022-01-31 21:16:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:23,733 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:23,733 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:23,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:23,736 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:23,743 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:23,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:23,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:16:23,776 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:23,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333652794] [2022-01-31 21:16:23,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [333652794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:23,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:23,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:16:23,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338878387] [2022-01-31 21:16:23,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:23,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:16:23,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:23,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:16:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:16:23,777 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:16:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:23,867 INFO L93 Difference]: Finished difference Result 78 states and 112 transitions. [2022-01-31 21:16:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:16:23,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:16:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:23,868 INFO L225 Difference]: With dead ends: 78 [2022-01-31 21:16:23,868 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 21:16:23,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:16:23,869 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:23,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 29 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 21:16:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2022-01-31 21:16:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 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:16:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-01-31 21:16:23,881 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 23 [2022-01-31 21:16:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:23,881 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-01-31 21:16:23,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:16:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-01-31 21:16:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:16:23,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:23,881 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:23,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:16:23,882 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:23,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:23,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1894791784, now seen corresponding path program 1 times [2022-01-31 21:16:23,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:23,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1969154513] [2022-01-31 21:16:23,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:23,927 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:23,927 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:23,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:23,930 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:23,937 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:23,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:23,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:16:23,996 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:23,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1969154513] [2022-01-31 21:16:23,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1969154513] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:23,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:23,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:16:23,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773110046] [2022-01-31 21:16:23,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:23,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:16:23,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:23,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:16:23,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:16:23,997 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:16:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:24,165 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2022-01-31 21:16:24,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:16:24,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:16:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:24,166 INFO L225 Difference]: With dead ends: 62 [2022-01-31 21:16:24,166 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 21:16:24,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:16:24,167 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:24,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 48 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 21:16:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-01-31 21:16:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 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:16:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-01-31 21:16:24,179 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 23 [2022-01-31 21:16:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:24,179 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-01-31 21:16:24,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:16:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-01-31 21:16:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:16:24,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:24,180 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:24,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:16:24,180 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1052264312, now seen corresponding path program 3 times [2022-01-31 21:16:24,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:24,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902934782] [2022-01-31 21:16:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:24,222 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:24,222 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:24,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:24,225 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:24,232 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:24,267 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:16:24,286 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:24,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1902934782] [2022-01-31 21:16:24,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1902934782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:24,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:24,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:16:24,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524545860] [2022-01-31 21:16:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:24,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:16:24,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:24,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:16:24,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:16:24,287 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:16:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:24,503 INFO L93 Difference]: Finished difference Result 107 states and 155 transitions. [2022-01-31 21:16:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:16:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:16:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:24,504 INFO L225 Difference]: With dead ends: 107 [2022-01-31 21:16:24,504 INFO L226 Difference]: Without dead ends: 95 [2022-01-31 21:16:24,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:16:24,504 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 76 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:24,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 63 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-31 21:16:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 56. [2022-01-31 21:16:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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:16:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2022-01-31 21:16:24,519 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 23 [2022-01-31 21:16:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:24,519 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2022-01-31 21:16:24,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:16:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-01-31 21:16:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 21:16:24,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:24,520 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:24,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:16:24,520 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1947718100, now seen corresponding path program 2 times [2022-01-31 21:16:24,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:24,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796521965] [2022-01-31 21:16:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:24,551 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:24,551 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:24,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:24,555 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:24,562 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:24,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:24,602 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:16:24,612 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:24,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796521965] [2022-01-31 21:16:24,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1796521965] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:24,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:24,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:16:24,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397390685] [2022-01-31 21:16:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:24,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:16:24,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:24,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:16:24,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:16:24,613 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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:16:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:24,793 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2022-01-31 21:16:24,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:16:24,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 24 [2022-01-31 21:16:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:24,794 INFO L225 Difference]: With dead ends: 101 [2022-01-31 21:16:24,794 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 21:16:24,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:16:24,795 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:24,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 45 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 21:16:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-01-31 21:16:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 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:16:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2022-01-31 21:16:24,827 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 24 [2022-01-31 21:16:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:24,828 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2022-01-31 21:16:24,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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:16:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2022-01-31 21:16:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 21:16:24,828 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:24,828 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:24,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:16:24,828 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:24,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1809241787, now seen corresponding path program 3 times [2022-01-31 21:16:24,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:24,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1784336660] [2022-01-31 21:16:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:24,863 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:24,863 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:24,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:24,866 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:24,874 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:24,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:24,914 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:16:24,930 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:24,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1784336660] [2022-01-31 21:16:24,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1784336660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:24,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:24,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:16:24,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684233866] [2022-01-31 21:16:24,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:24,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:16:24,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:24,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:16:24,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:16:24,931 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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:16:25,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:25,101 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2022-01-31 21:16:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:16:25,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 24 [2022-01-31 21:16:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:25,101 INFO L225 Difference]: With dead ends: 77 [2022-01-31 21:16:25,102 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 21:16:25,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:16:25,102 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:25,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 21:16:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-01-31 21:16:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 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:16:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-01-31 21:16:25,114 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 24 [2022-01-31 21:16:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:25,114 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2022-01-31 21:16:25,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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:16:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-01-31 21:16:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 21:16:25,114 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:25,114 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:25,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:16:25,114 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash -529458535, now seen corresponding path program 2 times [2022-01-31 21:16:25,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:25,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2058611632] [2022-01-31 21:16:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:25,163 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:25,163 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:25,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:25,166 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:16:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:25,179 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:16:25,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:25,226 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:16:25,249 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:25,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2058611632] [2022-01-31 21:16:25,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2058611632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:25,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:25,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:16:25,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269565582] [2022-01-31 21:16:25,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:25,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:16:25,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:25,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:16:25,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:16:25,250 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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:16:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:25,510 INFO L93 Difference]: Finished difference Result 102 states and 145 transitions. [2022-01-31 21:16:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:16:25,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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:16:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:25,511 INFO L225 Difference]: With dead ends: 102 [2022-01-31 21:16:25,511 INFO L226 Difference]: Without dead ends: 94 [2022-01-31 21:16:25,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:16:25,512 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:25,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 42 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-31 21:16:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 59. [2022-01-31 21:16:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 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:16:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2022-01-31 21:16:25,554 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 25 [2022-01-31 21:16:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:25,554 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2022-01-31 21:16:25,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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:16:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2022-01-31 21:16:25,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 21:16:25,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:25,555 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:25,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:16:25,555 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:25,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1702758372, now seen corresponding path program 3 times [2022-01-31 21:16:25,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:25,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545246100] [2022-01-31 21:16:25,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:25,587 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:25,588 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:25,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:25,591 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:25,599 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:25,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:25,653 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:16:25,685 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:25,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545246100] [2022-01-31 21:16:25,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [545246100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:25,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:25,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:16:25,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713409782] [2022-01-31 21:16:25,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:25,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:16:25,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:16:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:16:25,686 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:16:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:25,987 INFO L93 Difference]: Finished difference Result 80 states and 109 transitions. [2022-01-31 21:16:25,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:16:25,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 26 [2022-01-31 21:16:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:25,988 INFO L225 Difference]: With dead ends: 80 [2022-01-31 21:16:25,988 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 21:16:25,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:16:25,989 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:25,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 58 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:16:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 21:16:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2022-01-31 21:16:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 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:16:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2022-01-31 21:16:26,005 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 26 [2022-01-31 21:16:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:26,005 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2022-01-31 21:16:26,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:16:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2022-01-31 21:16:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 21:16:26,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:26,005 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:26,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:16:26,005 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1041168377, now seen corresponding path program 3 times [2022-01-31 21:16:26,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:26,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804882468] [2022-01-31 21:16:26,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:28,052 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:28,053 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:28,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:28,056 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:28,069 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:28,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:28,249 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:16:29,978 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:29,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804882468] [2022-01-31 21:16:29,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [804882468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:29,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:29,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:16:29,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831606524] [2022-01-31 21:16:29,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:29,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:16:29,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:29,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:16:29,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:16:29,979 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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:16:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:49,217 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2022-01-31 21:16:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:16:49,218 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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:16:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:49,218 INFO L225 Difference]: With dead ends: 97 [2022-01-31 21:16:49,218 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 21:16:49,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=160, Invalid=591, Unknown=5, NotChecked=0, Total=756 [2022-01-31 21:16:49,219 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:49,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 67 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 148 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-01-31 21:16:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 21:16:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2022-01-31 21:16:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 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:16:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions. [2022-01-31 21:16:49,253 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 27 [2022-01-31 21:16:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:49,253 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions. [2022-01-31 21:16:49,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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:16:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2022-01-31 21:16:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:16:49,254 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:49,254 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:49,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:16:49,254 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:49,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:49,254 INFO L85 PathProgramCache]: Analyzing trace with hash 836656981, now seen corresponding path program 4 times [2022-01-31 21:16:49,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:49,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2035687458] [2022-01-31 21:16:49,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:49,285 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:49,286 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:49,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:49,289 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:49,296 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:49,342 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:16:49,371 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:49,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2035687458] [2022-01-31 21:16:49,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2035687458] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:49,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:49,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:16:49,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374474313] [2022-01-31 21:16:49,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:49,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:16:49,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:49,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:16:49,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:16:49,373 INFO L87 Difference]: Start difference. First operand 75 states and 101 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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:16:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:49,715 INFO L93 Difference]: Finished difference Result 200 states and 289 transitions. [2022-01-31 21:16:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:16:49,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 28 [2022-01-31 21:16:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:49,718 INFO L225 Difference]: With dead ends: 200 [2022-01-31 21:16:49,718 INFO L226 Difference]: Without dead ends: 177 [2022-01-31 21:16:49,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:16:49,719 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 151 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:49,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 50 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:16:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-31 21:16:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 94. [2022-01-31 21:16:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 89 states have internal predecessors, (122), 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:16:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2022-01-31 21:16:49,751 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 28 [2022-01-31 21:16:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:49,751 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2022-01-31 21:16:49,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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:16:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2022-01-31 21:16:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:16:49,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:49,751 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:49,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:16:49,752 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:49,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 5 times [2022-01-31 21:16:49,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:49,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [732398221] [2022-01-31 21:16:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:49,798 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:16:49,798 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:49,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:49,801 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:49,831 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:16:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:50,112 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:16:54,028 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:54,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [732398221] [2022-01-31 21:16:54,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [732398221] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:54,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:54,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:16:54,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660624376] [2022-01-31 21:16:54,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:54,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:16:54,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:54,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:16:54,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=199, Unknown=1, NotChecked=0, Total=240 [2022-01-31 21:16:54,029 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 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:17:07,638 WARN L228 SmtUtils]: Spent 11.44s on a formula simplification. DAG size of input: 58 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:17:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:08,149 INFO L93 Difference]: Finished difference Result 105 states and 137 transitions. [2022-01-31 21:17:08,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:17:08,149 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 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:17:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:08,150 INFO L225 Difference]: With dead ends: 105 [2022-01-31 21:17:08,150 INFO L226 Difference]: Without dead ends: 97 [2022-01-31 21:17:08,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=95, Invalid=553, Unknown=2, NotChecked=0, Total=650 [2022-01-31 21:17:08,150 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:08,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 60 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 153 Invalid, 0 Unknown, 38 Unchecked, 0.2s Time] [2022-01-31 21:17:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-31 21:17:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-01-31 21:17:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 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:17:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2022-01-31 21:17:08,186 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 29 [2022-01-31 21:17:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:08,187 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2022-01-31 21:17:08,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 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:17:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2022-01-31 21:17:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:17:08,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:08,187 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:08,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:17:08,187 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:08,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:08,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1563256359, now seen corresponding path program 4 times [2022-01-31 21:17:08,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:08,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [947279927] [2022-01-31 21:17:08,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:08,220 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:08,220 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:08,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:08,223 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:08,234 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:08,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:08,271 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:17:08,295 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:08,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [947279927] [2022-01-31 21:17:08,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [947279927] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:08,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:08,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:17:08,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095223703] [2022-01-31 21:17:08,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:08,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:17:08,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:08,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:17:08,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:17:08,296 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:17:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:08,710 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. [2022-01-31 21:17:08,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:17:08,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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 29 [2022-01-31 21:17:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:08,711 INFO L225 Difference]: With dead ends: 147 [2022-01-31 21:17:08,711 INFO L226 Difference]: Without dead ends: 142 [2022-01-31 21:17:08,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:17:08,712 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:08,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 54 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-01-31 21:17:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2022-01-31 21:17:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 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:17:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2022-01-31 21:17:08,751 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 29 [2022-01-31 21:17:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:08,751 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2022-01-31 21:17:08,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:17:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2022-01-31 21:17:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:17:08,755 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:08,755 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:08,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:17:08,755 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1709448743, now seen corresponding path program 6 times [2022-01-31 21:17:08,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:08,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1322145088] [2022-01-31 21:17:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:08,788 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:08,789 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:08,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:08,795 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:08,811 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:08,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:08,895 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:17:08,928 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:08,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1322145088] [2022-01-31 21:17:08,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1322145088] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:08,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:08,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:17:08,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663855084] [2022-01-31 21:17:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:08,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:17:08,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:08,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:17:08,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:17:08,929 INFO L87 Difference]: Start difference. First operand 101 states and 136 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:09,371 INFO L93 Difference]: Finished difference Result 257 states and 367 transitions. [2022-01-31 21:17:09,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:17:09,372 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 29 [2022-01-31 21:17:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:09,374 INFO L225 Difference]: With dead ends: 257 [2022-01-31 21:17:09,374 INFO L226 Difference]: Without dead ends: 230 [2022-01-31 21:17:09,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:17:09,375 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 145 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:09,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 67 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-01-31 21:17:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 120. [2022-01-31 21:17:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 115 states have internal predecessors, (155), 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:17:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2022-01-31 21:17:09,458 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 29 [2022-01-31 21:17:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:09,458 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2022-01-31 21:17:09,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2022-01-31 21:17:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:17:09,459 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:09,459 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:09,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:17:09,459 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1414418204, now seen corresponding path program 7 times [2022-01-31 21:17:09,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:09,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223173582] [2022-01-31 21:17:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:09,496 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:09,497 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:09,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:09,500 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:09,508 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:09,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:09,551 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:17:09,575 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:09,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223173582] [2022-01-31 21:17:09,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [223173582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:09,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:09,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:17:09,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327440326] [2022-01-31 21:17:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:09,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:17:09,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:09,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:17:09,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:17:09,577 INFO L87 Difference]: Start difference. First operand 120 states and 159 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:17:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:09,945 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2022-01-31 21:17:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:17:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 30 [2022-01-31 21:17:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:09,946 INFO L225 Difference]: With dead ends: 191 [2022-01-31 21:17:09,946 INFO L226 Difference]: Without dead ends: 167 [2022-01-31 21:17:09,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:17:09,946 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 62 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:09,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 49 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:17:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-01-31 21:17:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 118. [2022-01-31 21:17:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.336283185840708) internal successors, (151), 113 states have internal predecessors, (151), 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:17:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 155 transitions. [2022-01-31 21:17:09,993 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 155 transitions. Word has length 30 [2022-01-31 21:17:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:09,993 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 155 transitions. [2022-01-31 21:17:09,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:17:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 155 transitions. [2022-01-31 21:17:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:17:09,993 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:09,994 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:09,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:17:09,994 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:09,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1181811755, now seen corresponding path program 8 times [2022-01-31 21:17:09,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:09,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626459309] [2022-01-31 21:17:09,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:10,020 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:10,020 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:10,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:10,023 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:10,033 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:10,088 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:17:10,117 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:10,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626459309] [2022-01-31 21:17:10,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [626459309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:10,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:10,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:17:10,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14040375] [2022-01-31 21:17:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:10,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:17:10,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:10,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:17:10,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:17:10,118 INFO L87 Difference]: Start difference. First operand 118 states and 155 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:10,563 INFO L93 Difference]: Finished difference Result 159 states and 208 transitions. [2022-01-31 21:17:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:17:10,563 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 30 [2022-01-31 21:17:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:10,564 INFO L225 Difference]: With dead ends: 159 [2022-01-31 21:17:10,564 INFO L226 Difference]: Without dead ends: 97 [2022-01-31 21:17:10,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:17:10,564 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:10,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:17:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-31 21:17:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2022-01-31 21:17:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 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:17:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2022-01-31 21:17:10,591 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 30 [2022-01-31 21:17:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:10,591 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2022-01-31 21:17:10,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:17:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2022-01-31 21:17:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:17:10,591 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:10,591 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:10,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:17:10,591 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash -427337179, now seen corresponding path program 2 times [2022-01-31 21:17:10,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:10,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1447145684] [2022-01-31 21:17:10,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:10,621 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:10,621 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:10,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:10,624 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:10,632 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:10,715 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:17:10,764 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:10,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1447145684] [2022-01-31 21:17:10,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1447145684] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:10,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:10,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:17:10,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317926129] [2022-01-31 21:17:10,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:10,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:17:10,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:10,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:17:10,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:17:10,765 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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:17:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:11,754 INFO L93 Difference]: Finished difference Result 147 states and 210 transitions. [2022-01-31 21:17:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 21:17:11,757 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 30 [2022-01-31 21:17:11,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:11,757 INFO L225 Difference]: With dead ends: 147 [2022-01-31 21:17:11,757 INFO L226 Difference]: Without dead ends: 137 [2022-01-31 21:17:11,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 21:17:11,758 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 57 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:11,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:17:11,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-01-31 21:17:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 100. [2022-01-31 21:17:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 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:17:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2022-01-31 21:17:11,801 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 30 [2022-01-31 21:17:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:11,801 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2022-01-31 21:17:11,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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:17:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2022-01-31 21:17:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:17:11,802 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:11,802 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:11,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:17:11,802 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1738398296, now seen corresponding path program 3 times [2022-01-31 21:17:11,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:11,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [402184928] [2022-01-31 21:17:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:11,840 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:11,841 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:11,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:11,845 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:11,855 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:11,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:11,984 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:17:12,039 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:12,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [402184928] [2022-01-31 21:17:12,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [402184928] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:12,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:12,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:17:12,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729081094] [2022-01-31 21:17:12,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:12,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:17:12,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:12,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:17:12,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:17:12,040 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 14 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:17:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:12,743 INFO L93 Difference]: Finished difference Result 141 states and 190 transitions. [2022-01-31 21:17:12,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:17:12,743 INFO L78 Accepts]: Start accepts. Automaton has has 14 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 31 [2022-01-31 21:17:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:12,747 INFO L225 Difference]: With dead ends: 141 [2022-01-31 21:17:12,747 INFO L226 Difference]: Without dead ends: 128 [2022-01-31 21:17:12,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:17:12,749 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 83 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:12,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 62 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:17:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-31 21:17:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2022-01-31 21:17:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 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:17:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2022-01-31 21:17:12,797 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 31 [2022-01-31 21:17:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:12,798 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2022-01-31 21:17:12,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 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:17:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-01-31 21:17:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:17:12,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:12,798 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:12,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:17:12,798 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:12,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:12,799 INFO L85 PathProgramCache]: Analyzing trace with hash 157124184, now seen corresponding path program 4 times [2022-01-31 21:17:12,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:12,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [588887361] [2022-01-31 21:17:12,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:12,843 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:12,844 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:12,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:12,847 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:12,859 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:12,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:12,950 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:17:13,012 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:13,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [588887361] [2022-01-31 21:17:13,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [588887361] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:13,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:13,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:17:13,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681558049] [2022-01-31 21:17:13,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:13,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:17:13,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:13,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:17:13,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:17:13,015 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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:17:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:13,733 INFO L93 Difference]: Finished difference Result 283 states and 408 transitions. [2022-01-31 21:17:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:17:13,734 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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:17:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:13,735 INFO L225 Difference]: With dead ends: 283 [2022-01-31 21:17:13,735 INFO L226 Difference]: Without dead ends: 251 [2022-01-31 21:17:13,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:17:13,736 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 224 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:13,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 56 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:17:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-01-31 21:17:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 104. [2022-01-31 21:17:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 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:17:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2022-01-31 21:17:13,794 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 31 [2022-01-31 21:17:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:13,795 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2022-01-31 21:17:13,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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:17:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2022-01-31 21:17:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 21:17:13,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:13,798 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:13,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:17:13,798 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash -309744490, now seen corresponding path program 4 times [2022-01-31 21:17:13,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:13,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1314255289] [2022-01-31 21:17:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:13,854 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:13,854 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:13,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:13,857 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:13,868 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:13,954 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:17:14,004 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:14,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1314255289] [2022-01-31 21:17:14,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1314255289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:14,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:14,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:17:14,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445754466] [2022-01-31 21:17:14,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:14,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:17:14,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:17:14,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:17:14,005 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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:17:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:14,998 INFO L93 Difference]: Finished difference Result 249 states and 353 transitions. [2022-01-31 21:17:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 21:17:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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 32 [2022-01-31 21:17:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:14,999 INFO L225 Difference]: With dead ends: 249 [2022-01-31 21:17:14,999 INFO L226 Difference]: Without dead ends: 239 [2022-01-31 21:17:14,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=1432, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 21:17:15,000 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 93 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:15,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 71 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:17:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-01-31 21:17:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 125. [2022-01-31 21:17:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.35) internal successors, (162), 120 states have internal predecessors, (162), 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:17:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2022-01-31 21:17:15,063 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 32 [2022-01-31 21:17:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:15,063 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2022-01-31 21:17:15,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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:17:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2022-01-31 21:17:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 21:17:15,063 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:15,063 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:15,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:17:15,064 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:15,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1040491994, now seen corresponding path program 9 times [2022-01-31 21:17:15,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:15,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [815322117] [2022-01-31 21:17:15,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:15,099 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:15,099 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:15,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:15,106 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:15,141 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:15,217 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:17:15,258 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:15,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [815322117] [2022-01-31 21:17:15,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [815322117] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:15,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:15,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:17:15,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758811427] [2022-01-31 21:17:15,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:15,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:17:15,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:15,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:17:15,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:17:15,259 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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:17:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:16,251 INFO L93 Difference]: Finished difference Result 238 states and 321 transitions. [2022-01-31 21:17:16,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 21:17:16,252 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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 33 [2022-01-31 21:17:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:16,253 INFO L225 Difference]: With dead ends: 238 [2022-01-31 21:17:16,253 INFO L226 Difference]: Without dead ends: 233 [2022-01-31 21:17:16,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 21:17:16,254 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 82 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:16,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 50 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:17:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-01-31 21:17:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 127. [2022-01-31 21:17:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 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:17:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 168 transitions. [2022-01-31 21:17:16,324 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 168 transitions. Word has length 33 [2022-01-31 21:17:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:16,324 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 168 transitions. [2022-01-31 21:17:16,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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:17:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2022-01-31 21:17:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 21:17:16,324 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:16,324 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:16,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:17:16,325 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:16,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1301695033, now seen corresponding path program 5 times [2022-01-31 21:17:16,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:16,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1779103662] [2022-01-31 21:17:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:16,356 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:16,356 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:16,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:16,359 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:16,369 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:16,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17: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:17:16,525 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:16,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1779103662] [2022-01-31 21:17:16,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1779103662] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:16,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:16,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:17:16,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154190387] [2022-01-31 21:17:16,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:16,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:17:16,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:16,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:17:16,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:17:16,526 INFO L87 Difference]: Start difference. First operand 127 states and 168 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:17:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:17,539 INFO L93 Difference]: Finished difference Result 298 states and 401 transitions. [2022-01-31 21:17:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 21:17:17,539 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:17:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:17,540 INFO L225 Difference]: With dead ends: 298 [2022-01-31 21:17:17,540 INFO L226 Difference]: Without dead ends: 194 [2022-01-31 21:17:17,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=1967, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 21:17:17,543 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 89 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:17,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 83 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:17:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-01-31 21:17:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 130. [2022-01-31 21:17:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.32) internal successors, (165), 125 states have internal predecessors, (165), 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:17:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 169 transitions. [2022-01-31 21:17:17,636 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 169 transitions. Word has length 33 [2022-01-31 21:17:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:17,636 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 169 transitions. [2022-01-31 21:17:17,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:17:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 169 transitions. [2022-01-31 21:17:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 21:17:17,638 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:17,638 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:17,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:17:17,638 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:17,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash 430243332, now seen corresponding path program 5 times [2022-01-31 21:17:17,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:17,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839917379] [2022-01-31 21:17:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:17,699 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:17,699 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:17,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:17,704 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:17,722 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:17,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:17,805 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:17:17,921 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:17,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839917379] [2022-01-31 21:17:17,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1839917379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:17,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:17,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:17:17,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043766358] [2022-01-31 21:17:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:17,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:17:17,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:17,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:17:17,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:17:17,922 INFO L87 Difference]: Start difference. First operand 130 states and 169 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 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:17:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:19,173 INFO L93 Difference]: Finished difference Result 398 states and 576 transitions. [2022-01-31 21:17:19,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:17:19,173 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 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 34 [2022-01-31 21:17:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:19,174 INFO L225 Difference]: With dead ends: 398 [2022-01-31 21:17:19,175 INFO L226 Difference]: Without dead ends: 360 [2022-01-31 21:17:19,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:17:19,176 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 253 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:19,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 73 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:17:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-01-31 21:17:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 141. [2022-01-31 21:17:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.3308823529411764) internal successors, (181), 136 states have internal predecessors, (181), 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:17:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 185 transitions. [2022-01-31 21:17:19,265 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 185 transitions. Word has length 34 [2022-01-31 21:17:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:19,265 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 185 transitions. [2022-01-31 21:17:19,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 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:17:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 185 transitions. [2022-01-31 21:17:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:17:19,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:19,268 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:19,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 21:17:19,268 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:19,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 10 times [2022-01-31 21:17:19,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:19,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113273804] [2022-01-31 21:17:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:19,294 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:19,294 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:19,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:19,297 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:19,316 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:19,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:19,475 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:17:20,924 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:20,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2113273804] [2022-01-31 21:17:20,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2113273804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:20,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:20,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:17:20,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232516806] [2022-01-31 21:17:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:20,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:17:20,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:20,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:17:20,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:17:20,925 INFO L87 Difference]: Start difference. First operand 141 states and 185 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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:17:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:21,382 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2022-01-31 21:17:21,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:17:21,383 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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 35 [2022-01-31 21:17:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:21,383 INFO L225 Difference]: With dead ends: 154 [2022-01-31 21:17:21,383 INFO L226 Difference]: Without dead ends: 145 [2022-01-31 21:17:21,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:17:21,384 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:21,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 65 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 215 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-01-31 21:17:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-31 21:17:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2022-01-31 21:17:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.3308823529411764) internal successors, (181), 136 states have internal predecessors, (181), 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:17:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 185 transitions. [2022-01-31 21:17:21,469 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 185 transitions. Word has length 35 [2022-01-31 21:17:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:21,469 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 185 transitions. [2022-01-31 21:17:21,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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:17:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 185 transitions. [2022-01-31 21:17:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:17:21,469 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:21,469 INFO L514 BasicCegarLoop]: trace histogram [7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:21,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 21:17:21,470 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash 237906376, now seen corresponding path program 6 times [2022-01-31 21:17:21,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:21,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1660146243] [2022-01-31 21:17:21,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:21,502 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:21,502 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:21,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:21,505 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:21,515 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:21,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:21,607 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:17:21,738 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:21,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1660146243] [2022-01-31 21:17:21,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1660146243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:21,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:21,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:17:21,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246779529] [2022-01-31 21:17:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:21,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:17:21,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:21,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:17:21,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:17:21,739 INFO L87 Difference]: Start difference. First operand 141 states and 185 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:17:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:23,193 INFO L93 Difference]: Finished difference Result 422 states and 610 transitions. [2022-01-31 21:17:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:17:23,193 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 35 [2022-01-31 21:17:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:23,194 INFO L225 Difference]: With dead ends: 422 [2022-01-31 21:17:23,194 INFO L226 Difference]: Without dead ends: 384 [2022-01-31 21:17:23,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:17:23,195 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 269 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:23,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 75 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:17:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-01-31 21:17:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 151. [2022-01-31 21:17:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 146 states have internal predecessors, (195), 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:17:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 199 transitions. [2022-01-31 21:17:23,295 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 199 transitions. Word has length 35 [2022-01-31 21:17:23,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:23,295 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 199 transitions. [2022-01-31 21:17:23,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:17:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 199 transitions. [2022-01-31 21:17:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:17:23,295 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:23,295 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:23,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 21:17:23,296 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:23,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:23,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2040976357, now seen corresponding path program 11 times [2022-01-31 21:17:23,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:23,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1948134891] [2022-01-31 21:17:23,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:23,344 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:23,344 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:23,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:23,348 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:23,367 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:23,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:23,414 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:17:23,456 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:23,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1948134891] [2022-01-31 21:17:23,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1948134891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:23,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:23,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:17:23,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364020393] [2022-01-31 21:17:23,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:23,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:17:23,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:17:23,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:17:23,458 INFO L87 Difference]: Start difference. First operand 151 states and 199 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:17:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:24,286 INFO L93 Difference]: Finished difference Result 300 states and 392 transitions. [2022-01-31 21:17:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:17:24,286 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 36 [2022-01-31 21:17:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:24,287 INFO L225 Difference]: With dead ends: 300 [2022-01-31 21:17:24,287 INFO L226 Difference]: Without dead ends: 268 [2022-01-31 21:17:24,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:17:24,289 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 82 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:24,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:17:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-01-31 21:17:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 158. [2022-01-31 21:17:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.3071895424836601) internal successors, (200), 153 states have internal predecessors, (200), 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:17:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 204 transitions. [2022-01-31 21:17:24,407 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 204 transitions. Word has length 36 [2022-01-31 21:17:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:24,407 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 204 transitions. [2022-01-31 21:17:24,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:17:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 204 transitions. [2022-01-31 21:17:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:17:24,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:24,408 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:24,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 21:17:24,408 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:24,408 INFO L85 PathProgramCache]: Analyzing trace with hash 642285958, now seen corresponding path program 6 times [2022-01-31 21:17:24,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:24,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1342346215] [2022-01-31 21:17:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:24,458 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:24,458 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:24,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:24,462 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:24,475 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:24,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:24,616 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:17:24,719 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:24,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1342346215] [2022-01-31 21:17:24,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1342346215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:24,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:24,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:17:24,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102137834] [2022-01-31 21:17:24,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:24,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:17:24,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:24,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:17:24,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:17:24,720 INFO L87 Difference]: Start difference. First operand 158 states and 204 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 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:17:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:27,449 INFO L93 Difference]: Finished difference Result 302 states and 407 transitions. [2022-01-31 21:17:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-01-31 21:17:27,449 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 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 36 [2022-01-31 21:17:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:27,451 INFO L225 Difference]: With dead ends: 302 [2022-01-31 21:17:27,451 INFO L226 Difference]: Without dead ends: 292 [2022-01-31 21:17:27,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=628, Invalid=4484, Unknown=0, NotChecked=0, Total=5112 [2022-01-31 21:17:27,452 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:27,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:17:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-31 21:17:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 182. [2022-01-31 21:17:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 177 states have internal predecessors, (234), 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:17:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 238 transitions. [2022-01-31 21:17:27,612 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 238 transitions. Word has length 36 [2022-01-31 21:17:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:27,613 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 238 transitions. [2022-01-31 21:17:27,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 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:17:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2022-01-31 21:17:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:17:27,616 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:27,617 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:27,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 21:17:27,618 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash 784665945, now seen corresponding path program 5 times [2022-01-31 21:17:27,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:27,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1470534295] [2022-01-31 21:17:27,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:27,713 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:27,714 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:27,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:27,717 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:27,731 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:27,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:27,946 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:17:45,222 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:45,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1470534295] [2022-01-31 21:17:45,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1470534295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:45,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:45,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:17:45,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645101274] [2022-01-31 21:17:45,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:45,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:17:45,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:45,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:17:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=303, Unknown=6, NotChecked=0, Total=380 [2022-01-31 21:17:45,224 INFO L87 Difference]: Start difference. First operand 182 states and 238 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 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:17:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:45,892 INFO L93 Difference]: Finished difference Result 244 states and 309 transitions. [2022-01-31 21:17:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:17:45,893 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 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:17:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:45,893 INFO L225 Difference]: With dead ends: 244 [2022-01-31 21:17:45,893 INFO L226 Difference]: Without dead ends: 200 [2022-01-31 21:17:45,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=151, Invalid=835, Unknown=6, NotChecked=0, Total=992 [2022-01-31 21:17:45,894 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:45,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 81 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 328 Invalid, 0 Unknown, 40 Unchecked, 0.3s Time] [2022-01-31 21:17:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-01-31 21:17:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 166. [2022-01-31 21:17:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3167701863354038) internal successors, (212), 161 states have internal predecessors, (212), 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:17:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2022-01-31 21:17:46,031 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 37 [2022-01-31 21:17:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:46,031 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2022-01-31 21:17:46,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 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:17:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2022-01-31 21:17:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:17:46,032 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:46,032 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:46,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 21:17:46,033 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:46,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:46,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1080486311, now seen corresponding path program 7 times [2022-01-31 21:17:46,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:46,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [369724351] [2022-01-31 21:17:46,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:46,059 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:46,060 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:46,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:46,063 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:46,080 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:46,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:46,242 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:17:46,360 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:46,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [369724351] [2022-01-31 21:17:46,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [369724351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:46,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:46,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:17:46,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95653341] [2022-01-31 21:17:46,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:46,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:17:46,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:46,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:17:46,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:17:46,361 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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:17:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:48,530 INFO L93 Difference]: Finished difference Result 424 states and 556 transitions. [2022-01-31 21:17:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-31 21:17:48,530 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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 37 [2022-01-31 21:17:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:48,531 INFO L225 Difference]: With dead ends: 424 [2022-01-31 21:17:48,531 INFO L226 Difference]: Without dead ends: 285 [2022-01-31 21:17:48,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=459, Invalid=3573, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 21:17:48,533 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 137 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:48,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 89 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:17:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-01-31 21:17:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 169. [2022-01-31 21:17:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.298780487804878) internal successors, (213), 164 states have internal predecessors, (213), 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:17:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 217 transitions. [2022-01-31 21:17:48,669 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 217 transitions. Word has length 37 [2022-01-31 21:17:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:48,670 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 217 transitions. [2022-01-31 21:17:48,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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:17:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 217 transitions. [2022-01-31 21:17:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 21:17:48,670 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:48,670 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:48,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 21:17:48,670 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:48,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash -727706250, now seen corresponding path program 7 times [2022-01-31 21:17:48,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:48,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [181835411] [2022-01-31 21:17:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:48,706 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:48,706 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:48,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:48,709 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:48,722 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:48,832 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:17:49,040 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:49,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [181835411] [2022-01-31 21:17:49,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [181835411] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:49,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:49,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:17:49,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406738221] [2022-01-31 21:17:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:49,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:17:49,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:49,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:17:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:17:49,041 INFO L87 Difference]: Start difference. First operand 169 states and 217 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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:17:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:51,197 INFO L93 Difference]: Finished difference Result 554 states and 796 transitions. [2022-01-31 21:17:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:17:51,198 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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 38 [2022-01-31 21:17:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:51,200 INFO L225 Difference]: With dead ends: 554 [2022-01-31 21:17:51,200 INFO L226 Difference]: Without dead ends: 504 [2022-01-31 21:17:51,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 21:17:51,201 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 273 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:51,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 84 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:17:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-01-31 21:17:51,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 181. [2022-01-31 21:17:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.3068181818181819) internal successors, (230), 176 states have internal predecessors, (230), 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:17:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 234 transitions. [2022-01-31 21:17:51,356 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 234 transitions. Word has length 38 [2022-01-31 21:17:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:51,356 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 234 transitions. [2022-01-31 21:17:51,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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:17:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 234 transitions. [2022-01-31 21:17:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 21:17:51,357 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:51,357 INFO L514 BasicCegarLoop]: trace histogram [9, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:51,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 21:17:51,357 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -164755688, now seen corresponding path program 8 times [2022-01-31 21:17:51,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:51,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [168738505] [2022-01-31 21:17:51,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:51,393 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:51,394 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:51,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:51,397 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:51,409 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:51,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:51,565 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:17:51,813 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:51,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [168738505] [2022-01-31 21:17:51,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [168738505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:51,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:51,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:17:51,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697258556] [2022-01-31 21:17:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:51,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:17:51,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:17:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:17:51,814 INFO L87 Difference]: Start difference. First operand 181 states and 234 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 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:17:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:54,948 INFO L93 Difference]: Finished difference Result 581 states and 834 transitions. [2022-01-31 21:17:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:17:54,949 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 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:17:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:54,950 INFO L225 Difference]: With dead ends: 581 [2022-01-31 21:17:54,950 INFO L226 Difference]: Without dead ends: 531 [2022-01-31 21:17:54,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=360, Invalid=1200, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 21:17:54,951 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 413 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:54,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 81 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:17:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-01-31 21:17:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 192. [2022-01-31 21:17:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.3101604278074865) internal successors, (245), 187 states have internal predecessors, (245), 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:17:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 249 transitions. [2022-01-31 21:17:55,121 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 249 transitions. Word has length 39 [2022-01-31 21:17:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:55,121 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 249 transitions. [2022-01-31 21:17:55,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 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:17:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 249 transitions. [2022-01-31 21:17:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:17:55,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:55,124 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:55,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 21:17:55,124 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1411174294, now seen corresponding path program 8 times [2022-01-31 21:17:55,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:55,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [983588092] [2022-01-31 21:17:55,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:55,158 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:17:55,158 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:55,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:55,162 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:17:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:55,198 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 21:17:55,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:55,411 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:17:55,620 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:55,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [983588092] [2022-01-31 21:17:55,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [983588092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:55,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:55,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:17:55,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240568255] [2022-01-31 21:17:55,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:55,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:17:55,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:55,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:17:55,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:17:55,621 INFO L87 Difference]: Start difference. First operand 192 states and 249 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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:18:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:00,608 INFO L93 Difference]: Finished difference Result 432 states and 572 transitions. [2022-01-31 21:18:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-01-31 21:18:00,608 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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 40 [2022-01-31 21:18:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:00,610 INFO L225 Difference]: With dead ends: 432 [2022-01-31 21:18:00,610 INFO L226 Difference]: Without dead ends: 421 [2022-01-31 21:18:00,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=873, Invalid=6959, Unknown=0, NotChecked=0, Total=7832 [2022-01-31 21:18:00,611 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 80 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:00,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 92 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 21:18:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-01-31 21:18:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 221. [2022-01-31 21:18:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.3240740740740742) internal successors, (286), 216 states have internal predecessors, (286), 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:18:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 290 transitions. [2022-01-31 21:18:00,828 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 290 transitions. Word has length 40 [2022-01-31 21:18:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:00,828 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 290 transitions. [2022-01-31 21:18:00,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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:18:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 290 transitions. [2022-01-31 21:18:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:18:00,829 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:00,829 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:00,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 21:18:00,829 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 12 times [2022-01-31 21:18:00,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:00,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51153036] [2022-01-31 21:18:00,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:00,861 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:00,861 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:00,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:00,864 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:00,897 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:01,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:01,088 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:18:13,739 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:13,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [51153036] [2022-01-31 21:18:13,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [51153036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:13,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:13,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:18:13,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687263112] [2022-01-31 21:18:13,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:13,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:18:13,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:13,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:18:13,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=321, Unknown=2, NotChecked=0, Total=380 [2022-01-31 21:18:13,740 INFO L87 Difference]: Start difference. First operand 221 states and 290 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 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:18:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:14,334 INFO L93 Difference]: Finished difference Result 236 states and 305 transitions. [2022-01-31 21:18:14,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:18:14,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 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:18:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:14,335 INFO L225 Difference]: With dead ends: 236 [2022-01-31 21:18:14,335 INFO L226 Difference]: Without dead ends: 226 [2022-01-31 21:18:14,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=104, Invalid=764, Unknown=2, NotChecked=0, Total=870 [2022-01-31 21:18:14,336 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:14,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 275 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-01-31 21:18:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-01-31 21:18:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2022-01-31 21:18:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.3240740740740742) internal successors, (286), 216 states have internal predecessors, (286), 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:18:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 290 transitions. [2022-01-31 21:18:14,539 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 290 transitions. Word has length 41 [2022-01-31 21:18:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:14,539 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 290 transitions. [2022-01-31 21:18:14,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 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:18:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 290 transitions. [2022-01-31 21:18:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:18:14,540 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:14,540 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:14,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 21:18:14,540 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:14,541 INFO L85 PathProgramCache]: Analyzing trace with hash -525475065, now seen corresponding path program 9 times [2022-01-31 21:18:14,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:14,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065017402] [2022-01-31 21:18:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:14,571 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:14,571 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:14,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:14,574 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:14,591 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:14,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:14,679 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:18:14,826 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:14,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065017402] [2022-01-31 21:18:14,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1065017402] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:14,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:14,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:18:14,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006529246] [2022-01-31 21:18:14,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:14,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:18:14,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:18:14,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:18:14,827 INFO L87 Difference]: Start difference. First operand 221 states and 290 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:18:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:19,597 INFO L93 Difference]: Finished difference Result 639 states and 827 transitions. [2022-01-31 21:18:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-01-31 21:18:19,597 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 41 [2022-01-31 21:18:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:19,599 INFO L225 Difference]: With dead ends: 639 [2022-01-31 21:18:19,599 INFO L226 Difference]: Without dead ends: 601 [2022-01-31 21:18:19,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=631, Invalid=4061, Unknown=0, NotChecked=0, Total=4692 [2022-01-31 21:18:19,600 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 166 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:19,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 135 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 21:18:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-01-31 21:18:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 240. [2022-01-31 21:18:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.3404255319148937) internal successors, (315), 235 states have internal predecessors, (315), 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:18:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 319 transitions. [2022-01-31 21:18:19,855 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 319 transitions. Word has length 41 [2022-01-31 21:18:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:19,855 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 319 transitions. [2022-01-31 21:18:19,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:18:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 319 transitions. [2022-01-31 21:18:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:18:19,856 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:19,856 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:19,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 21:18:19,856 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:19,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash 29751636, now seen corresponding path program 6 times [2022-01-31 21:18:19,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:19,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1898711626] [2022-01-31 21:18:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:19,887 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:19,887 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:19,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:19,890 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:19,908 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:19,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:19,997 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:18:20,116 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:20,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1898711626] [2022-01-31 21:18:20,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1898711626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:20,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:20,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:18:20,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240240875] [2022-01-31 21:18:20,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:20,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:18:20,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:20,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:18:20,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:18:20,117 INFO L87 Difference]: Start difference. First operand 240 states and 319 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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:18:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:25,106 INFO L93 Difference]: Finished difference Result 779 states and 1030 transitions. [2022-01-31 21:18:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-01-31 21:18:25,107 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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 42 [2022-01-31 21:18:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:25,110 INFO L225 Difference]: With dead ends: 779 [2022-01-31 21:18:25,110 INFO L226 Difference]: Without dead ends: 774 [2022-01-31 21:18:25,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1701, Invalid=7041, Unknown=0, NotChecked=0, Total=8742 [2022-01-31 21:18:25,112 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 354 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:25,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 58 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 21:18:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-01-31 21:18:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 315. [2022-01-31 21:18:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 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:18:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 415 transitions. [2022-01-31 21:18:25,419 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 415 transitions. Word has length 42 [2022-01-31 21:18:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:25,420 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 415 transitions. [2022-01-31 21:18:25,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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:18:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 415 transitions. [2022-01-31 21:18:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:18:25,420 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:25,420 INFO L514 BasicCegarLoop]: trace histogram [10, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:25,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 21:18:25,421 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:25,421 INFO L85 PathProgramCache]: Analyzing trace with hash -906022826, now seen corresponding path program 13 times [2022-01-31 21:18:25,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:25,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1204498305] [2022-01-31 21:18:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:25,455 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:25,456 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:25,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:25,461 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_45.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:25,496 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_45.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:25,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:25,637 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:18:25,874 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:25,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1204498305] [2022-01-31 21:18:25,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1204498305] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:25,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:25,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:18:25,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600396879] [2022-01-31 21:18:25,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:25,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:18:25,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:25,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:18:25,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:18:25,875 INFO L87 Difference]: Start difference. First operand 315 states and 415 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:18:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:29,046 INFO L93 Difference]: Finished difference Result 912 states and 1296 transitions. [2022-01-31 21:18:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 21:18:29,046 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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 42 [2022-01-31 21:18:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:29,048 INFO L225 Difference]: With dead ends: 912 [2022-01-31 21:18:29,049 INFO L226 Difference]: Without dead ends: 832 [2022-01-31 21:18:29,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 21:18:29,049 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 321 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:29,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 120 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:18:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-01-31 21:18:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 330. [2022-01-31 21:18:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 325 states have (on average 1.3292307692307692) internal successors, (432), 325 states have internal predecessors, (432), 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:18:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 436 transitions. [2022-01-31 21:18:29,397 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 436 transitions. Word has length 42 [2022-01-31 21:18:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:29,397 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 436 transitions. [2022-01-31 21:18:29,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:18:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 436 transitions. [2022-01-31 21:18:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 21:18:29,398 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:29,398 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:29,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 21:18:29,398 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:29,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash 956795834, now seen corresponding path program 14 times [2022-01-31 21:18:29,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:29,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [307938890] [2022-01-31 21:18:29,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:31,443 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:31,444 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:31,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:31,447 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:31,481 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:31,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:31,634 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:18:31,822 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:31,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [307938890] [2022-01-31 21:18:31,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [307938890] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:31,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:31,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:18:31,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084041079] [2022-01-31 21:18:31,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:31,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:18:31,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:31,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:18:31,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:18:31,823 INFO L87 Difference]: Start difference. First operand 330 states and 436 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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:18:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:35,968 INFO L93 Difference]: Finished difference Result 627 states and 810 transitions. [2022-01-31 21:18:35,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-01-31 21:18:35,969 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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 43 [2022-01-31 21:18:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:35,970 INFO L225 Difference]: With dead ends: 627 [2022-01-31 21:18:35,970 INFO L226 Difference]: Without dead ends: 549 [2022-01-31 21:18:35,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1591 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=678, Invalid=4578, Unknown=0, NotChecked=0, Total=5256 [2022-01-31 21:18:35,971 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 95 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:35,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 98 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 21:18:35,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-01-31 21:18:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 318. [2022-01-31 21:18:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.29073482428115) internal successors, (404), 313 states have internal predecessors, (404), 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:18:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 408 transitions. [2022-01-31 21:18:36,354 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 408 transitions. Word has length 43 [2022-01-31 21:18:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:36,355 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 408 transitions. [2022-01-31 21:18:36,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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:18:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 408 transitions. [2022-01-31 21:18:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 21:18:36,355 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:36,355 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:36,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 21:18:36,356 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:36,356 INFO L85 PathProgramCache]: Analyzing trace with hash -828512648, now seen corresponding path program 15 times [2022-01-31 21:18:36,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:36,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519127502] [2022-01-31 21:18:36,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:36,429 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:36,430 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:36,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:36,433 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_47.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:36,452 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_47.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:36,541 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:18:36,692 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:36,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519127502] [2022-01-31 21:18:36,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [519127502] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:36,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:36,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:18:36,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464104549] [2022-01-31 21:18:36,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:36,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:18:36,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:36,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:18:36,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:18:36,694 INFO L87 Difference]: Start difference. First operand 318 states and 408 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:18:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:42,135 INFO L93 Difference]: Finished difference Result 833 states and 1111 transitions. [2022-01-31 21:18:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-31 21:18:42,135 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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 43 [2022-01-31 21:18:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:42,137 INFO L225 Difference]: With dead ends: 833 [2022-01-31 21:18:42,137 INFO L226 Difference]: Without dead ends: 809 [2022-01-31 21:18:42,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2022-01-31 21:18:42,138 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 191 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:42,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 115 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 21:18:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-01-31 21:18:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 364. [2022-01-31 21:18:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 359 states have (on average 1.3008356545961002) internal successors, (467), 359 states have internal predecessors, (467), 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:18:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 471 transitions. [2022-01-31 21:18:42,573 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 471 transitions. Word has length 43 [2022-01-31 21:18:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:42,573 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 471 transitions. [2022-01-31 21:18:42,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:18:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 471 transitions. [2022-01-31 21:18:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:18:42,574 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:42,574 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:42,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 21:18:42,574 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1253879449, now seen corresponding path program 16 times [2022-01-31 21:18:42,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:42,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054847072] [2022-01-31 21:18:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:42,604 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:42,604 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:42,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:42,607 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_48.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:42,627 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_48.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:42,818 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:18:43,041 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:43,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054847072] [2022-01-31 21:18:43,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2054847072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:43,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:43,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:18:43,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614916931] [2022-01-31 21:18:43,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:43,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:18:43,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:43,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:18:43,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:18:43,042 INFO L87 Difference]: Start difference. First operand 364 states and 471 transitions. Second operand has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 21 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:18:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:47,765 INFO L93 Difference]: Finished difference Result 960 states and 1222 transitions. [2022-01-31 21:18:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-31 21:18:47,787 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 21 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 44 [2022-01-31 21:18:47,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:47,788 INFO L225 Difference]: With dead ends: 960 [2022-01-31 21:18:47,788 INFO L226 Difference]: Without dead ends: 627 [2022-01-31 21:18:47,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=687, Invalid=5955, Unknown=0, NotChecked=0, Total=6642 [2022-01-31 21:18:47,789 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 154 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:47,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 102 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 21:18:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-01-31 21:18:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 366. [2022-01-31 21:18:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 361 states have (on average 1.2880886426592797) internal successors, (465), 361 states have internal predecessors, (465), 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:18:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 469 transitions. [2022-01-31 21:18:48,212 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 469 transitions. Word has length 44 [2022-01-31 21:18:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:48,212 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 469 transitions. [2022-01-31 21:18:48,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 21 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:18:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 469 transitions. [2022-01-31 21:18:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:18:48,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:48,213 INFO L514 BasicCegarLoop]: trace histogram [11, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:48,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 21:18:48,213 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:48,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1426367990, now seen corresponding path program 17 times [2022-01-31 21:18:48,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:48,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [363888419] [2022-01-31 21:18:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:48,259 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:48,259 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:48,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:48,262 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_49.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:48,280 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_49.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:48,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:48,435 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:18:48,867 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:48,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [363888419] [2022-01-31 21:18:48,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [363888419] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:48,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:48,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:18:48,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223167087] [2022-01-31 21:18:48,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:48,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:18:48,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:48,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:18:48,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:18:48,868 INFO L87 Difference]: Start difference. First operand 366 states and 469 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 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:18:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:54,108 INFO L93 Difference]: Finished difference Result 1128 states and 1592 transitions. [2022-01-31 21:18:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:18:54,109 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 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:18:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:54,112 INFO L225 Difference]: With dead ends: 1128 [2022-01-31 21:18:54,112 INFO L226 Difference]: Without dead ends: 1030 [2022-01-31 21:18:54,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=483, Invalid=1679, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 21:18:54,113 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 455 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:54,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 97 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 21:18:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2022-01-31 21:18:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 383. [2022-01-31 21:18:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 378 states have (on average 1.2936507936507937) internal successors, (489), 378 states have internal predecessors, (489), 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:18:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 493 transitions. [2022-01-31 21:18:54,568 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 493 transitions. Word has length 45 [2022-01-31 21:18:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:54,568 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 493 transitions. [2022-01-31 21:18:54,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 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:18:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 493 transitions. [2022-01-31 21:18:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:18:54,570 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:54,570 INFO L514 BasicCegarLoop]: trace histogram [12, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:54,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 21:18:54,570 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:54,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash 224991110, now seen corresponding path program 18 times [2022-01-31 21:18:54,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:54,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1481816893] [2022-01-31 21:18:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:54,604 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:18:54,604 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:54,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:54,612 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_50.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:54,632 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_50.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:54,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:54,821 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:18:55,298 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:55,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1481816893] [2022-01-31 21:18:55,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1481816893] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:55,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:55,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:18:55,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949800365] [2022-01-31 21:18:55,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:55,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:18:55,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:55,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:18:55,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:18:55,299 INFO L87 Difference]: Start difference. First operand 383 states and 493 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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:19:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:00,741 INFO L93 Difference]: Finished difference Result 1166 states and 1645 transitions. [2022-01-31 21:19:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:19:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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 46 [2022-01-31 21:19:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:00,744 INFO L225 Difference]: With dead ends: 1166 [2022-01-31 21:19:00,744 INFO L226 Difference]: Without dead ends: 1068 [2022-01-31 21:19:00,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 21:19:00,744 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 433 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:00,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 104 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:19:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-01-31 21:19:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 399. [2022-01-31 21:19:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 394 states have (on average 1.2969543147208122) internal successors, (511), 394 states have internal predecessors, (511), 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:19:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 515 transitions. [2022-01-31 21:19:01,223 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 515 transitions. Word has length 46 [2022-01-31 21:19:01,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:01,223 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 515 transitions. [2022-01-31 21:19:01,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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:19:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 515 transitions. [2022-01-31 21:19:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:19:01,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:01,224 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:19:01,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 21:19:01,225 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1284526650, now seen corresponding path program 19 times [2022-01-31 21:19:01,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:01,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1787091735] [2022-01-31 21:19:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:01,267 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:19:01,268 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:01,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:01,271 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_51.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:01,313 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_51.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:01,500 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:19:26,027 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:26,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1787091735] [2022-01-31 21:19:26,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1787091735] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:26,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:26,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:19:26,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889075576] [2022-01-31 21:19:26,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:26,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:19:26,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:26,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:19:26,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:19:26,028 INFO L87 Difference]: Start difference. First operand 399 states and 515 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 17 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:19:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:27,111 INFO L93 Difference]: Finished difference Result 416 states and 531 transitions. [2022-01-31 21:19:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:19:27,111 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 17 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 47 [2022-01-31 21:19:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:27,112 INFO L225 Difference]: With dead ends: 416 [2022-01-31 21:19:27,112 INFO L226 Difference]: Without dead ends: 380 [2022-01-31 21:19:27,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:19:27,113 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:27,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 302 Invalid, 0 Unknown, 121 Unchecked, 0.2s Time] [2022-01-31 21:19:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-01-31 21:19:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-01-31 21:19:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 375 states have (on average 1.3066666666666666) internal successors, (490), 375 states have internal predecessors, (490), 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:19:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 494 transitions. [2022-01-31 21:19:27,598 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 494 transitions. Word has length 47 [2022-01-31 21:19:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:27,598 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 494 transitions. [2022-01-31 21:19:27,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 17 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:19:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 494 transitions. [2022-01-31 21:19:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:19:27,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:27,599 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:19:27,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 21:19:27,599 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2120852086, now seen corresponding path program 20 times [2022-01-31 21:19:27,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:27,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [814073078] [2022-01-31 21:19:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:27,636 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:19:27,637 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:27,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:27,640 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_52.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:27,663 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_52.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:27,881 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:19:28,264 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:28,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [814073078] [2022-01-31 21:19:28,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [814073078] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:28,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:28,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:19:28,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052170905] [2022-01-31 21:19:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:28,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:19:28,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:28,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:19:28,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:19:28,265 INFO L87 Difference]: Start difference. First operand 380 states and 494 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 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:19:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:38,095 INFO L93 Difference]: Finished difference Result 1133 states and 1462 transitions. [2022-01-31 21:19:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-01-31 21:19:38,095 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 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 47 [2022-01-31 21:19:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:38,097 INFO L225 Difference]: With dead ends: 1133 [2022-01-31 21:19:38,097 INFO L226 Difference]: Without dead ends: 781 [2022-01-31 21:19:38,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3141 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=982, Invalid=9320, Unknown=0, NotChecked=0, Total=10302 [2022-01-31 21:19:38,101 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 163 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:38,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 119 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-01-31 21:19:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-01-31 21:19:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 405. [2022-01-31 21:19:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 400 states have (on average 1.28) internal successors, (512), 400 states have internal predecessors, (512), 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:19:38,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 516 transitions. [2022-01-31 21:19:38,631 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 516 transitions. Word has length 47 [2022-01-31 21:19:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:38,631 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 516 transitions. [2022-01-31 21:19:38,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 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:19:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 516 transitions. [2022-01-31 21:19:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:19:38,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:38,632 INFO L514 BasicCegarLoop]: trace histogram [13, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:19:38,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 21:19:38,632 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:38,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:38,632 INFO L85 PathProgramCache]: Analyzing trace with hash -806132441, now seen corresponding path program 21 times [2022-01-31 21:19:38,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:38,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1296551547] [2022-01-31 21:19:38,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:38,675 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:19:38,675 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:38,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:38,684 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_53.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:38,704 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_53.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:38,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:38,899 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:19:39,608 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:39,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1296551547] [2022-01-31 21:19:39,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1296551547] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:39,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:39,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:19:39,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867881406] [2022-01-31 21:19:39,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:39,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:19:39,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:39,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:19:39,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:19:39,612 INFO L87 Difference]: Start difference. First operand 405 states and 516 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 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:19:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:46,340 INFO L93 Difference]: Finished difference Result 1341 states and 1908 transitions. [2022-01-31 21:19:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 21:19:46,340 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 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 48 [2022-01-31 21:19:46,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:46,343 INFO L225 Difference]: With dead ends: 1341 [2022-01-31 21:19:46,343 INFO L226 Difference]: Without dead ends: 1232 [2022-01-31 21:19:46,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=624, Invalid=2238, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 21:19:46,345 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 489 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:46,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 108 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 21:19:46,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-01-31 21:19:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 422. [2022-01-31 21:19:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.2853717026378897) internal successors, (536), 417 states have internal predecessors, (536), 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:19:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 540 transitions. [2022-01-31 21:19:46,960 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 540 transitions. Word has length 48 [2022-01-31 21:19:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:46,962 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 540 transitions. [2022-01-31 21:19:46,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 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:19:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 540 transitions. [2022-01-31 21:19:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:19:46,977 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:46,977 INFO L514 BasicCegarLoop]: trace histogram [14, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:19:46,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 21:19:46,977 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:46,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2022543351, now seen corresponding path program 22 times [2022-01-31 21:19:46,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:46,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1761686265] [2022-01-31 21:19:46,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:47,020 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:19:47,020 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:47,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:47,024 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_54.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:47,056 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_54.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:47,286 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:19:48,266 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:48,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1761686265] [2022-01-31 21:19:48,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1761686265] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:48,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:48,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:19:48,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825346158] [2022-01-31 21:19:48,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:48,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:19:48,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:48,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:19:48,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:19:48,267 INFO L87 Difference]: Start difference. First operand 422 states and 540 transitions. Second operand has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 25 states have internal predecessors, (38), 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:19:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:56,191 INFO L93 Difference]: Finished difference Result 1381 states and 1964 transitions. [2022-01-31 21:19:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 21:19:56,191 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 25 states have internal predecessors, (38), 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:19:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:56,195 INFO L225 Difference]: With dead ends: 1381 [2022-01-31 21:19:56,195 INFO L226 Difference]: Without dead ends: 1272 [2022-01-31 21:19:56,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=651, Invalid=2429, Unknown=0, NotChecked=0, Total=3080 [2022-01-31 21:19:56,195 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 443 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:56,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 125 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-31 21:19:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2022-01-31 21:19:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 438. [2022-01-31 21:19:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.2886836027713626) internal successors, (558), 433 states have internal predecessors, (558), 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:19:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 562 transitions. [2022-01-31 21:19:56,815 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 562 transitions. Word has length 49 [2022-01-31 21:19:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:56,815 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 562 transitions. [2022-01-31 21:19:56,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 25 states have internal predecessors, (38), 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:19:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 562 transitions. [2022-01-31 21:19:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:19:56,816 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:56,816 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:19:56,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 21:19:56,816 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:56,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:56,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2107354695, now seen corresponding path program 23 times [2022-01-31 21:19:56,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:56,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1256300495] [2022-01-31 21:19:56,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:56,842 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:19:56,843 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:56,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:56,854 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_55.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:56,918 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_55.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:57,128 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:19:57,561 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:57,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1256300495] [2022-01-31 21:19:57,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1256300495] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:57,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:57,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-31 21:19:57,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974467197] [2022-01-31 21:19:57,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:57,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 21:19:57,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 21:19:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:19:57,562 INFO L87 Difference]: Start difference. First operand 438 states and 562 transitions. Second operand has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 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:20:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:14,181 INFO L93 Difference]: Finished difference Result 1268 states and 1606 transitions. [2022-01-31 21:20:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-01-31 21:20:14,182 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 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 50 [2022-01-31 21:20:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:14,185 INFO L225 Difference]: With dead ends: 1268 [2022-01-31 21:20:14,185 INFO L226 Difference]: Without dead ends: 1254 [2022-01-31 21:20:14,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1778, Invalid=10878, Unknown=0, NotChecked=0, Total=12656 [2022-01-31 21:20:14,186 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 319 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:14,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 96 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-01-31 21:20:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-01-31 21:20:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 501. [2022-01-31 21:20:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 496 states have (on average 1.252016129032258) internal successors, (621), 496 states have internal predecessors, (621), 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:20:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 625 transitions. [2022-01-31 21:20:15,017 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 625 transitions. Word has length 50 [2022-01-31 21:20:15,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:15,017 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 625 transitions. [2022-01-31 21:20:15,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 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:20:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 625 transitions. [2022-01-31 21:20:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:20:15,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:15,018 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:20:15,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 21:20:15,018 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:15,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash -801586393, now seen corresponding path program 9 times [2022-01-31 21:20:15,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:15,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [472104469] [2022-01-31 21:20:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:15,088 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:20:15,088 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:15,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:15,091 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_56.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:15,115 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_56.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:15,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:15,228 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:20:15,805 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:15,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [472104469] [2022-01-31 21:20:15,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [472104469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:15,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:15,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:20:15,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704513248] [2022-01-31 21:20:15,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:15,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:20:15,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:15,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:20:15,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:20:15,806 INFO L87 Difference]: Start difference. First operand 501 states and 625 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:20:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:36,787 INFO L93 Difference]: Finished difference Result 1381 states and 1701 transitions. [2022-01-31 21:20:36,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-01-31 21:20:36,788 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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 50 [2022-01-31 21:20:36,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:36,791 INFO L225 Difference]: With dead ends: 1381 [2022-01-31 21:20:36,791 INFO L226 Difference]: Without dead ends: 1358 [2022-01-31 21:20:36,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3489 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1288, Invalid=10054, Unknown=0, NotChecked=0, Total=11342 [2022-01-31 21:20:36,792 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 247 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:36,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 152 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2022-01-31 21:20:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-01-31 21:20:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 491. [2022-01-31 21:20:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 486 states have (on average 1.2962962962962963) internal successors, (630), 486 states have internal predecessors, (630), 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:20:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 634 transitions. [2022-01-31 21:20:37,560 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 634 transitions. Word has length 50 [2022-01-31 21:20:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:37,560 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 634 transitions. [2022-01-31 21:20:37,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:20:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 634 transitions. [2022-01-31 21:20:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:20:37,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:37,561 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:20:37,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 21:20:37,561 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:37,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:37,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2142860360, now seen corresponding path program 24 times [2022-01-31 21:20:37,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:37,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [479412611] [2022-01-31 21:20:37,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:37,589 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:20:37,590 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:37,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:37,593 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_57.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:37,625 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_57.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:37,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:37,884 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:20:57,015 WARN L228 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:21:19,008 WARN L228 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:21:54,872 WARN L228 SmtUtils]: Spent 9.35s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:22:43,518 WARN L228 SmtUtils]: Spent 21.86s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:22:43,521 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:43,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [479412611] [2022-01-31 21:22:43,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [479412611] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:43,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:43,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:22:43,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072898651] [2022-01-31 21:22:43,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:43,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:22:43,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:22:43,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=596, Unknown=11, NotChecked=0, Total=756 [2022-01-31 21:22:43,522 INFO L87 Difference]: Start difference. First operand 491 states and 634 transitions. Second operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 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:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:51,199 INFO L93 Difference]: Finished difference Result 577 states and 720 transitions. [2022-01-31 21:22:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 21:22:51,199 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 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:22:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:51,200 INFO L225 Difference]: With dead ends: 577 [2022-01-31 21:22:51,200 INFO L226 Difference]: Without dead ends: 474 [2022-01-31 21:22:51,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 132.3s TimeCoverageRelationStatistics Valid=436, Invalid=1904, Unknown=12, NotChecked=0, Total=2352 [2022-01-31 21:22:51,201 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:51,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 60 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 331 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2022-01-31 21:22:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-01-31 21:22:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 456. [2022-01-31 21:22:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 451 states have (on average 1.2771618625277161) internal successors, (576), 451 states have internal predecessors, (576), 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:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 580 transitions. [2022-01-31 21:22:51,920 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 580 transitions. Word has length 51 [2022-01-31 21:22:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:51,920 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 580 transitions. [2022-01-31 21:22:51,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 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:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 580 transitions. [2022-01-31 21:22:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:22:51,921 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:51,921 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:22:51,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 21:22:51,921 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1493128120, now seen corresponding path program 25 times [2022-01-31 21:22:51,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:51,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2058503697] [2022-01-31 21:22:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:51,948 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:22:51,948 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:51,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:51,951 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_58.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:22:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:51,985 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_58.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:22:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:52,235 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:52,918 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:52,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2058503697] [2022-01-31 21:22:52,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2058503697] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:52,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:52,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 21:22:52,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534926023] [2022-01-31 21:22:52,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:52,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 21:22:52,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:52,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 21:22:52,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:22:52,919 INFO L87 Difference]: Start difference. First operand 456 states and 580 transitions. Second operand has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 27 states have internal predecessors, (40), 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,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:13,885 INFO L93 Difference]: Finished difference Result 1408 states and 1787 transitions. [2022-01-31 21:23:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-01-31 21:23:13,886 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 27 states have internal predecessors, (40), 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:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:13,888 INFO L225 Difference]: With dead ends: 1408 [2022-01-31 21:23:13,888 INFO L226 Difference]: Without dead ends: 991 [2022-01-31 21:23:13,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5960 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1515, Invalid=16307, Unknown=0, NotChecked=0, Total=17822 [2022-01-31 21:23:13,890 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 218 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:13,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 132 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-01-31 21:23:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2022-01-31 21:23:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 448. [2022-01-31 21:23:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 443 states have (on average 1.275395033860045) internal successors, (565), 443 states have internal predecessors, (565), 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:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 569 transitions. [2022-01-31 21:23:14,663 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 569 transitions. Word has length 51 [2022-01-31 21:23:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:14,663 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 569 transitions. [2022-01-31 21:23:14,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 27 states have internal predecessors, (40), 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:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 569 transitions. [2022-01-31 21:23:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:23:14,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:14,664 INFO L514 BasicCegarLoop]: trace histogram [15, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:14,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 21:23:14,664 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2147362633, now seen corresponding path program 26 times [2022-01-31 21:23:14,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:14,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [41680580] [2022-01-31 21:23:14,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:14,690 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:14,690 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:23:14,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:14,693 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_59.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:23:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:14,711 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_59.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:23:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:23:16,212 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:16,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [41680580] [2022-01-31 21:23:16,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [41680580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:16,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:16,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 21:23:16,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931236387] [2022-01-31 21:23:16,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:16,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 21:23:16,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:16,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 21:23:16,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:23:16,213 INFO L87 Difference]: Start difference. First operand 448 states and 569 transitions. Second operand has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 27 states have internal predecessors, (40), 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,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:27,606 INFO L93 Difference]: Finished difference Result 1614 states and 2297 transitions. [2022-01-31 21:23:27,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 21:23:27,607 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 27 states have internal predecessors, (40), 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 52 [2022-01-31 21:23:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:27,610 INFO L225 Difference]: With dead ends: 1614 [2022-01-31 21:23:27,610 INFO L226 Difference]: Without dead ends: 1484 [2022-01-31 21:23:27,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=783, Invalid=2877, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 21:23:27,611 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 618 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:27,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [618 Valid, 122 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-01-31 21:23:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2022-01-31 21:23:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 466. [2022-01-31 21:23:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 461 states have (on average 1.2798264642082429) internal successors, (590), 461 states have internal predecessors, (590), 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:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 594 transitions. [2022-01-31 21:23:28,421 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 594 transitions. Word has length 52 [2022-01-31 21:23:28,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:28,422 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 594 transitions. [2022-01-31 21:23:28,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 27 states have internal predecessors, (40), 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:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 594 transitions. [2022-01-31 21:23:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:23:28,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:28,423 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:28,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 21:23:28,423 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:28,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -43081415, now seen corresponding path program 27 times [2022-01-31 21:23:28,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:28,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903367563] [2022-01-31 21:23:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:28,452 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:23:28,453 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:23:28,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:28,456 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_60.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:23:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:28,496 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_60.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:23:28,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:28,702 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:20,841 WARN L228 SmtUtils]: Spent 15.88s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:24:20,842 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:20,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903367563] [2022-01-31 21:24:20,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1903367563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:20,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:20,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:24:20,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553291583] [2022-01-31 21:24:20,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:20,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:24:20,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:20,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:24:20,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=428, Unknown=3, NotChecked=0, Total=506 [2022-01-31 21:24:20,843 INFO L87 Difference]: Start difference. First operand 466 states and 594 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 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,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:24:22,222 INFO L93 Difference]: Finished difference Result 485 states and 612 transitions. [2022-01-31 21:24:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:24:22,222 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 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:24:22,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:24:22,223 INFO L225 Difference]: With dead ends: 485 [2022-01-31 21:24:22,223 INFO L226 Difference]: Without dead ends: 444 [2022-01-31 21:24:22,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=124, Invalid=995, Unknown=3, NotChecked=0, Total=1122 [2022-01-31 21:24:22,224 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:24:22,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 375 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-01-31 21:24:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-01-31 21:24:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2022-01-31 21:24:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 439 states have (on average 1.2892938496583144) internal successors, (566), 439 states have internal predecessors, (566), 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:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 570 transitions. [2022-01-31 21:24:23,017 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 570 transitions. Word has length 53 [2022-01-31 21:24:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:24:23,017 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 570 transitions. [2022-01-31 21:24:23,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 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:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 570 transitions. [2022-01-31 21:24:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:24:23,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:24:23,018 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:24:23,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 21:24:23,018 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:24:23,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:24:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1030959415, now seen corresponding path program 7 times [2022-01-31 21:24:23,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:24:23,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1548438787] [2022-01-31 21:24:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:24:23,050 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:24:23,050 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:24:23,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:24:23,053 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_61.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:24:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:23,084 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_61.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:24:23,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:24:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:23,390 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:24,977 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:24,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1548438787] [2022-01-31 21:24:24,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1548438787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:24,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:24,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:24:24,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395138331] [2022-01-31 21:24:24,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:24,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:24:24,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:24,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:24:24,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:24:24,978 INFO L87 Difference]: Start difference. First operand 444 states and 570 transitions. Second operand has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 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:25:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:03,105 INFO L93 Difference]: Finished difference Result 1121 states and 1415 transitions. [2022-01-31 21:25:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-01-31 21:25:03,106 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 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 53 [2022-01-31 21:25:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:03,109 INFO L225 Difference]: With dead ends: 1121 [2022-01-31 21:25:03,109 INFO L226 Difference]: Without dead ends: 1106 [2022-01-31 21:25:03,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8295 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=2257, Invalid=22549, Unknown=0, NotChecked=0, Total=24806 [2022-01-31 21:25:03,119 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 102 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:03,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 132 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2022-01-31 21:25:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-01-31 21:25:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 524. [2022-01-31 21:25:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 519 states have (on average 1.2447013487475915) internal successors, (646), 519 states have internal predecessors, (646), 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:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 650 transitions. [2022-01-31 21:25:04,242 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 650 transitions. Word has length 53 [2022-01-31 21:25:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:04,242 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 650 transitions. [2022-01-31 21:25:04,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 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:25:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 650 transitions. [2022-01-31 21:25:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:25:04,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:04,243 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:25:04,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 21:25:04,244 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -838334759, now seen corresponding path program 10 times [2022-01-31 21:25:04,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:04,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1734493168] [2022-01-31 21:25:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:04,272 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:04,273 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:25:04,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:04,280 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_62.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:25:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:04,314 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_62.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:25:04,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:04,607 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:06,002 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:25:06,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1734493168] [2022-01-31 21:25:06,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1734493168] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:25:06,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:25:06,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:25:06,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997943555] [2022-01-31 21:25:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:25:06,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:25:06,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:25:06,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:25:06,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:25:06,004 INFO L87 Difference]: Start difference. First operand 524 states and 650 transitions. Second operand has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 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:25:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:25:46,589 INFO L93 Difference]: Finished difference Result 1630 states and 2040 transitions. [2022-01-31 21:25:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-01-31 21:25:46,589 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 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 53 [2022-01-31 21:25:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:25:46,592 INFO L225 Difference]: With dead ends: 1630 [2022-01-31 21:25:46,592 INFO L226 Difference]: Without dead ends: 1158 [2022-01-31 21:25:46,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8704 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=2002, Invalid=23120, Unknown=0, NotChecked=0, Total=25122 [2022-01-31 21:25:46,594 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 277 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:25:46,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 134 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2022-01-31 21:25:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2022-01-31 21:25:47,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 534. [2022-01-31 21:25:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 529 states have (on average 1.2325141776937618) internal successors, (652), 529 states have internal predecessors, (652), 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:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 656 transitions. [2022-01-31 21:25:47,703 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 656 transitions. Word has length 53 [2022-01-31 21:25:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:25:47,704 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 656 transitions. [2022-01-31 21:25:47,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 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:25:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 656 transitions. [2022-01-31 21:25:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:25:47,704 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:25:47,704 INFO L514 BasicCegarLoop]: trace histogram [16, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:25:47,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-31 21:25:47,705 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:25:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:25:47,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1076499318, now seen corresponding path program 10 times [2022-01-31 21:25:47,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:25:47,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1116308307] [2022-01-31 21:25:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:25:47,769 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:25:47,769 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:25:47,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:25:47,772 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_63.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:25:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:47,791 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_63.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:25:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:25:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:25:48,087 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:50,249 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:25:50,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1116308307] [2022-01-31 21:25:50,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1116308307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:25:50,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:25:50,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-01-31 21:25:50,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193208816] [2022-01-31 21:25:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:25:50,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 21:25:50,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:25:50,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 21:25:50,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:25:50,251 INFO L87 Difference]: Start difference. First operand 534 states and 656 transitions. Second operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:26:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:26:06,160 INFO L93 Difference]: Finished difference Result 1883 states and 2639 transitions. [2022-01-31 21:26:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 21:26:06,160 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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 54 [2022-01-31 21:26:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:26:06,165 INFO L225 Difference]: With dead ends: 1883 [2022-01-31 21:26:06,165 INFO L226 Difference]: Without dead ends: 1673 [2022-01-31 21:26:06,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=927, Invalid=3363, Unknown=0, NotChecked=0, Total=4290 [2022-01-31 21:26:06,166 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 589 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:26:06,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 136 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-01-31 21:26:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2022-01-31 21:26:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 552. [2022-01-31 21:26:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.2376599634369287) internal successors, (677), 547 states have internal predecessors, (677), 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:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 681 transitions. [2022-01-31 21:26:07,364 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 681 transitions. Word has length 54 [2022-01-31 21:26:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:26:07,364 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 681 transitions. [2022-01-31 21:26:07,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:26:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 681 transitions. [2022-01-31 21:26:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:26:07,365 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:26:07,365 INFO L514 BasicCegarLoop]: trace histogram [17, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:26:07,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-31 21:26:07,365 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:26:07,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:26:07,365 INFO L85 PathProgramCache]: Analyzing trace with hash -190363496, now seen corresponding path program 11 times [2022-01-31 21:26:07,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:26:07,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1186071933] [2022-01-31 21:26:07,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:26:07,390 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:26:07,390 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:26:07,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:26:07,393 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_64.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:26:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:07,414 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_64.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:26:07,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:26:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:07,706 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:09,841 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:26:09,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1186071933] [2022-01-31 21:26:09,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1186071933] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:26:09,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:26:09,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:26:09,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570656646] [2022-01-31 21:26:09,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:26:09,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:26:09,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:26:09,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:26:09,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:26:09,842 INFO L87 Difference]: Start difference. First operand 552 states and 681 transitions. Second operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 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:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:26:28,639 INFO L93 Difference]: Finished difference Result 1926 states and 2699 transitions. [2022-01-31 21:26:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 21:26:28,640 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 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:26:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:26:28,652 INFO L225 Difference]: With dead ends: 1926 [2022-01-31 21:26:28,652 INFO L226 Difference]: Without dead ends: 1716 [2022-01-31 21:26:28,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=960, Invalid=3596, Unknown=0, NotChecked=0, Total=4556 [2022-01-31 21:26:28,653 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 600 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:26:28,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [600 Valid, 133 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 2639 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-01-31 21:26:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-01-31 21:26:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 569. [2022-01-31 21:26:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 564 states have (on average 1.2411347517730495) internal successors, (700), 564 states have internal predecessors, (700), 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:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 704 transitions. [2022-01-31 21:26:29,861 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 704 transitions. Word has length 55 [2022-01-31 21:26:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:26:29,861 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 704 transitions. [2022-01-31 21:26:29,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 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:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 704 transitions. [2022-01-31 21:26:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:26:29,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:26:29,862 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:26:29,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-31 21:26:29,862 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:26:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:26:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2069154410, now seen corresponding path program 11 times [2022-01-31 21:26:29,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:26:29,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2117861400] [2022-01-31 21:26:29,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:26:29,903 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:26:29,903 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:26:29,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:26:29,906 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_65.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:26:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:29,961 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_65.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:26:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:26:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:30,338 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:31,625 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:26:31,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2117861400] [2022-01-31 21:26:31,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2117861400] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:26:31,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:26:31,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:26:31,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908227370] [2022-01-31 21:26:31,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:26:31,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:26:31,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:26:31,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:26:31,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:26:31,627 INFO L87 Difference]: Start difference. First operand 569 states and 704 transitions. Second operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 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:28:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:28:02,291 INFO L93 Difference]: Finished difference Result 3507 states and 4621 transitions. [2022-01-31 21:28:02,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-01-31 21:28:02,292 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 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 56 [2022-01-31 21:28:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:28:02,297 INFO L225 Difference]: With dead ends: 3507 [2022-01-31 21:28:02,297 INFO L226 Difference]: Without dead ends: 3482 [2022-01-31 21:28:02,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34754 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=11766, Invalid=69744, Unknown=0, NotChecked=0, Total=81510 [2022-01-31 21:28:02,301 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 1156 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 1718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1718 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:28:02,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1156 Valid, 105 Invalid, 4326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1718 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 32.7s Time] [2022-01-31 21:28:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2022-01-31 21:28:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 628. [2022-01-31 21:28:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 623 states have (on average 1.3948635634028892) internal successors, (869), 623 states have internal predecessors, (869), 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:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 873 transitions. [2022-01-31 21:28:03,545 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 873 transitions. Word has length 56 [2022-01-31 21:28:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:28:03,545 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 873 transitions. [2022-01-31 21:28:03,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 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:28:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 873 transitions. [2022-01-31 21:28:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 21:28:03,546 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:28:03,546 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:28:03,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-01-31 21:28:03,546 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:28:03,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:28:03,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1718046247, now seen corresponding path program 8 times [2022-01-31 21:28:03,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:28:03,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947166388] [2022-01-31 21:28:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:28:03,607 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:28:03,607 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:28:03,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:28:03,610 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_66.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:28:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:28:03,652 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_66.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:28:04,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:28:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:28:04,011 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:06,791 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:28:06,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1947166388] [2022-01-31 21:28:06,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1947166388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:28:06,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:28:06,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-31 21:28:06,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113651717] [2022-01-31 21:28:06,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:28:06,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 21:28:06,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:28:06,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 21:28:06,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:28:06,792 INFO L87 Difference]: Start difference. First operand 628 states and 873 transitions. Second operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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:06,764 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:29:18,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:29:21,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:29:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:29:29,120 INFO L93 Difference]: Finished difference Result 1686 states and 2130 transitions. [2022-01-31 21:29:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2022-01-31 21:29:29,121 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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:29:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:29:29,123 INFO L225 Difference]: With dead ends: 1686 [2022-01-31 21:29:29,123 INFO L226 Difference]: Without dead ends: 1671 [2022-01-31 21:29:29,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13661 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=3214, Invalid=35398, Unknown=0, NotChecked=0, Total=38612 [2022-01-31 21:29:29,125 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 128 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 3351 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 3611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 3351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:29:29,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 147 Invalid, 3611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 3351 Invalid, 0 Unknown, 0 Unchecked, 36.2s Time] [2022-01-31 21:29:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-01-31 21:29:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 747. [2022-01-31 21:29:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 742 states have (on average 1.3450134770889488) internal successors, (998), 742 states have internal predecessors, (998), 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:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1002 transitions. [2022-01-31 21:29:30,865 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1002 transitions. Word has length 57 [2022-01-31 21:29:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:29:30,865 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 1002 transitions. [2022-01-31 21:29:30,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1002 transitions. [2022-01-31 21:29:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:29:30,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:29:30,875 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:29:30,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-01-31 21:29:30,875 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:29:30,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:29:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash -303599690, now seen corresponding path program 9 times [2022-01-31 21:29:30,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:29:30,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [215479266] [2022-01-31 21:29:30,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:29:30,913 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:29:30,914 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:29:30,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:29:30,918 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_67.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:29:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:29:30,980 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_67.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:29:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:29:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:29:31,257 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:33,095 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:29:33,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [215479266] [2022-01-31 21:29:33,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [215479266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:29:33,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:29:33,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 21:29:33,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724050563] [2022-01-31 21:29:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:29:33,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 21:29:33,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:29:33,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 21:29:33,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:29:33,096 INFO L87 Difference]: Start difference. First operand 747 states and 1002 transitions. Second operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 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:43,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:29:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:29:52,018 INFO L93 Difference]: Finished difference Result 1598 states and 1952 transitions. [2022-01-31 21:29:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 21:29:52,019 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 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 58 [2022-01-31 21:29:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:29:52,021 INFO L225 Difference]: With dead ends: 1598 [2022-01-31 21:29:52,021 INFO L226 Difference]: Without dead ends: 1484 [2022-01-31 21:29:52,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=726, Invalid=4530, Unknown=0, NotChecked=0, Total=5256 [2022-01-31 21:29:52,039 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 112 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:29:52,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 81 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-01-31 21:29:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2022-01-31 21:29:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 718. [2022-01-31 21:29:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 713 states have (on average 1.3309957924263676) internal successors, (949), 713 states have internal predecessors, (949), 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:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 953 transitions. [2022-01-31 21:29:53,728 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 953 transitions. Word has length 58 [2022-01-31 21:29:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:29:53,729 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 953 transitions. [2022-01-31 21:29:53,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 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:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 953 transitions. [2022-01-31 21:29:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:29:53,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:29:53,730 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:29:53,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-01-31 21:29:53,730 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:29:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:29:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash -68905898, now seen corresponding path program 10 times [2022-01-31 21:29:53,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:29:53,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [35831870] [2022-01-31 21:29:53,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:29:53,760 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:29:53,761 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:29:53,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:29:53,764 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_68.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:29:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:29:53,800 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_68.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:29:54,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:29:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:29:54,142 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:57,595 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:29:57,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [35831870] [2022-01-31 21:29:57,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [35831870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:29:57,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:29:57,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-31 21:29:57,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131528319] [2022-01-31 21:29:57,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:29:57,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 21:29:57,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:29:57,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 21:29:57,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:29:57,596 INFO L87 Difference]: Start difference. First operand 718 states and 953 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 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)