/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-de52.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:14:53,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:14:53,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:14:53,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:14:53,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:14:53,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:14:53,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:14:53,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:14:53,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:14:53,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:14:53,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:14:53,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:14:53,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:14:53,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:14:53,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:14:53,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:14:53,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:14:53,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:14:53,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:14:53,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:14:53,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:14:53,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:14:53,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:14:53,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:14:53,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:14:53,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:14:53,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:14:53,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:14:53,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:14:53,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:14:53,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:14:53,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:14:53,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:14:53,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:14:53,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:14:53,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:14:53,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:14:53,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:14:53,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:14:53,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:14:53,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:14:53,966 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:14:53,975 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:14:53,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:14:53,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:14:53,977 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:14:53,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:14:53,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:14:53,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:14:53,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:14:53,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:14:53,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:14:53,979 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:14:53,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:14:53,979 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:14:53,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:14:53,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:14:53,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:14:53,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:14:53,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:14:53,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:14:53,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:14:53,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:14:53,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:14:53,980 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:14:53,980 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:14:54,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:14:54,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:14:54,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:14:54,184 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:14:54,184 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:14:54,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-01-31 21:14:54,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c14e49c74/b6d7ba77c761450b87463071f3231b29/FLAG3015b205a [2022-01-31 21:14:54,546 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:14:54,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-01-31 21:14:54,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c14e49c74/b6d7ba77c761450b87463071f3231b29/FLAG3015b205a [2022-01-31 21:14:54,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c14e49c74/b6d7ba77c761450b87463071f3231b29 [2022-01-31 21:14:54,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:14:54,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:14:54,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:14:54,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:14:54,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:14:54,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:14:54" (1/1) ... [2022-01-31 21:14:54,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ff2b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:54, skipping insertion in model container [2022-01-31 21:14:54,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:14:54" (1/1) ... [2022-01-31 21:14:54,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:14:54,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:14:55,082 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-de52.c[368,381] [2022-01-31 21:14:55,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:14:55,116 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:14:55,123 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-de52.c[368,381] [2022-01-31 21:14:55,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:14:55,134 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:14:55,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:55 WrapperNode [2022-01-31 21:14:55,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:14:55,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:14:55,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:14:55,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:14:55,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:55" (1/1) ... [2022-01-31 21:14:55,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:55" (1/1) ... [2022-01-31 21:14:55,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:55" (1/1) ... [2022-01-31 21:14:55,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:55" (1/1) ... [2022-01-31 21:14:55,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:55" (1/1) ... [2022-01-31 21:14:55,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:55" (1/1) ... [2022-01-31 21:14:55,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:55" (1/1) ... [2022-01-31 21:14:55,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:14:55,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:14:55,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:14:55,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:14:55,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:55" (1/1) ... [2022-01-31 21:14:55,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:14:55,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:14:55,181 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:14:55,185 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:14:55,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:14:55,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:14:55,204 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:14:55,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:14:55,204 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:14:55,204 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:14:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:14:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:14:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:14:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 21:14:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:14:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:14:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:14:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:14:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:14:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:14:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:14:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:14:55,250 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:14:55,251 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:14:55,389 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:14:55,392 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:14:55,393 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-31 21:14:55,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:14:55 BoogieIcfgContainer [2022-01-31 21:14:55,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:14:55,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:14:55,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:14:55,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:14:55,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:14:54" (1/3) ... [2022-01-31 21:14:55,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e67581b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:14:55, skipping insertion in model container [2022-01-31 21:14:55,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:14:55" (2/3) ... [2022-01-31 21:14:55,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e67581b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:14:55, skipping insertion in model container [2022-01-31 21:14:55,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:14:55" (3/3) ... [2022-01-31 21:14:55,399 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de52.c [2022-01-31 21:14:55,402 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:14:55,403 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:14:55,435 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:14:55,451 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:14:55,455 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:14:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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:14:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 21:14:55,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:55,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:55,486 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:55,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:55,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-01-31 21:14:55,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:55,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1806217330] [2022-01-31 21:14:55,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:55,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:55,563 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:14:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:55,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:55,694 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:14:55,696 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:55,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1806217330] [2022-01-31 21:14:55,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1806217330] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:55,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:55,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 21:14:55,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013902774] [2022-01-31 21:14:55,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:55,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 21:14:55,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:55,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 21:14:55,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 21:14:55,727 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:55,766 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-01-31 21:14:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 21:14:55,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 21:14:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:55,772 INFO L225 Difference]: With dead ends: 41 [2022-01-31 21:14:55,772 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 21:14:55,774 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:14:55,776 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 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:14:55,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:14:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 21:14:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 21:14:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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:14:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-01-31 21:14:55,813 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-01-31 21:14:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:55,813 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-01-31 21:14:55,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-01-31 21:14:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 21:14:55,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:55,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:14:55,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:14:55,814 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-01-31 21:14:55,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:55,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1030914131] [2022-01-31 21:14:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:55,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:55,817 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:14:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:55,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:55,920 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:14:55,921 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:55,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1030914131] [2022-01-31 21:14:55,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1030914131] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:55,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:55,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:55,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415854220] [2022-01-31 21:14:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:55,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:55,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:55,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:55,928 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:56,036 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-01-31 21:14:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:14:56,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 21:14:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:56,038 INFO L225 Difference]: With dead ends: 34 [2022-01-31 21:14:56,038 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 21:14:56,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 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:14:56,040 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:56,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:14:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 21:14:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-31 21:14:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-01-31 21:14:56,049 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2022-01-31 21:14:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:56,049 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-01-31 21:14:56,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-01-31 21:14:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:14:56,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:56,050 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:14:56,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:14:56,050 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-01-31 21:14:56,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:56,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1558849052] [2022-01-31 21:14:56,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:56,188 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:14:56,189 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:56,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:56,200 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:56,213 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:56,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:56,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:14:56,299 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:56,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1558849052] [2022-01-31 21:14:56,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1558849052] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:56,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:56,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:14:56,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866602721] [2022-01-31 21:14:56,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:56,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:14:56,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:56,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:14:56,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:14:56,300 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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:14:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:56,354 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-01-31 21:14:56,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:14:56,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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:14:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:56,355 INFO L225 Difference]: With dead ends: 36 [2022-01-31 21:14:56,355 INFO L226 Difference]: Without dead ends: 24 [2022-01-31 21:14:56,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:14:56,357 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:56,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:14:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-31 21:14:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-31 21:14:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-01-31 21:14:56,361 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 17 [2022-01-31 21:14:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:56,362 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-01-31 21:14:56,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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:14:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-01-31 21:14:56,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 21:14:56,362 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:56,362 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:14:56,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:14:56,363 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:56,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-01-31 21:14:56,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:56,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [453232185] [2022-01-31 21:14:56,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:56,432 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:14:56,433 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:56,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:56,452 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:14:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:56,463 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:14:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:56,499 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:14:56,558 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:56,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [453232185] [2022-01-31 21:14:56,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [453232185] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:56,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:56,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:14:56,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050347869] [2022-01-31 21:14:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:56,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:14:56,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:56,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:14:56,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:14:56,560 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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:14:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:56,628 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-01-31 21:14:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:14:56,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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:14:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:56,629 INFO L225 Difference]: With dead ends: 31 [2022-01-31 21:14:56,629 INFO L226 Difference]: Without dead ends: 20 [2022-01-31 21:14:56,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:14:56,638 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:56,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:14:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-31 21:14:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-01-31 21:14:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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:14:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-01-31 21:14:56,648 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 17 [2022-01-31 21:14:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:56,649 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-01-31 21:14:56,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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:14:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-01-31 21:14:56,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:14:56,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:56,650 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:14:56,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:14:56,650 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:56,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -809859500, now seen corresponding path program 1 times [2022-01-31 21:14:56,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:56,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334541704] [2022-01-31 21:14:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:56,696 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:14:56,697 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:56,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:56,702 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:14:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:56,715 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:14:56,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:56,745 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:14:56,758 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334541704] [2022-01-31 21:14:56,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1334541704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:56,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:56,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:14:56,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061447435] [2022-01-31 21:14:56,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:56,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:14:56,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:56,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:14:56,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:14:56,760 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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:14:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:56,825 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-01-31 21:14:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:14:56,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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:14:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:56,826 INFO L225 Difference]: With dead ends: 36 [2022-01-31 21:14:56,826 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 21:14:56,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 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:14:56,827 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:56,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 27 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:14:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 21:14:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-01-31 21:14:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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:14:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-01-31 21:14:56,832 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2022-01-31 21:14:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:56,832 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-01-31 21:14:56,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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:14:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-01-31 21:14:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 21:14:56,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:56,833 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:14:56,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:14:56,833 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:56,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash 592968899, now seen corresponding path program 1 times [2022-01-31 21:14:56,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:56,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1494403264] [2022-01-31 21:14:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:56,891 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:14:56,891 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:56,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:56,896 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:14:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:56,900 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:14:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:56,917 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:14:56,928 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:56,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1494403264] [2022-01-31 21:14:56,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1494403264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:56,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:56,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:14:56,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101511585] [2022-01-31 21:14:56,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:56,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:14:56,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:56,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:14:56,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:14:56,930 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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:14:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:56,998 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2022-01-31 21:14:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:14:56,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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:14:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:57,000 INFO L225 Difference]: With dead ends: 43 [2022-01-31 21:14:57,000 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 21:14:57,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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:14:57,002 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:57,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 24 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:14:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 21:14:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-01-31 21:14:57,012 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:14:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-01-31 21:14:57,013 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2022-01-31 21:14:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:57,013 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-01-31 21:14:57,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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:14:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-01-31 21:14:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 21:14:57,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:57,013 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:14:57,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:14:57,014 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:57,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 735022287, now seen corresponding path program 1 times [2022-01-31 21:14:57,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:57,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2079272839] [2022-01-31 21:14:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:57,063 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:14:57,063 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:57,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:57,076 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:14:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:57,094 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:14:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:57,120 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:14:57,139 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:57,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2079272839] [2022-01-31 21:14:57,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2079272839] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:57,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:57,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:57,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296746426] [2022-01-31 21:14:57,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:57,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:57,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:57,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:57,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:57,140 INFO L87 Difference]: Start difference. First operand 28 states and 37 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:14:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:57,191 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-01-31 21:14:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:14:57,192 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:14:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:57,192 INFO L225 Difference]: With dead ends: 35 [2022-01-31 21:14:57,192 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 21:14:57,193 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:14:57,193 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:57,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:14:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 21:14:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 21:14:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:57,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-01-31 21:14:57,198 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-01-31 21:14:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:57,198 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-01-31 21:14:57,198 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:14:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-01-31 21:14:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 21:14:57,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:57,199 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:14:57,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:14:57,199 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:57,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash -528072081, now seen corresponding path program 1 times [2022-01-31 21:14:57,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:57,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1224290109] [2022-01-31 21:14:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:57,235 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:14:57,236 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:57,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:57,240 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:14:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:57,247 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:14:57,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:57,270 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:14:57,282 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:57,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1224290109] [2022-01-31 21:14:57,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1224290109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:57,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:57,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:57,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680284954] [2022-01-31 21:14:57,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:57,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:57,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:57,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:57,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:57,283 INFO L87 Difference]: Start difference. First operand 25 states and 32 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:14:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:57,345 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-01-31 21:14:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:14:57,345 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:14:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:57,346 INFO L225 Difference]: With dead ends: 30 [2022-01-31 21:14:57,346 INFO L226 Difference]: Without dead ends: 22 [2022-01-31 21:14:57,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 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:14:57,346 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:57,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 36 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:14:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-31 21:14:57,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-31 21:14:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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:14:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-01-31 21:14:57,350 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 19 [2022-01-31 21:14:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:57,350 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-01-31 21:14:57,350 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:14:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-01-31 21:14:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:14:57,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:57,351 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:14:57,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:14:57,351 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:57,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 1 times [2022-01-31 21:14:57,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:57,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1105116601] [2022-01-31 21:14:57,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:57,391 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:14:57,391 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:57,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:57,395 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:14:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:57,405 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:14:57,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:57,430 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:14:57,449 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:57,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1105116601] [2022-01-31 21:14:57,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1105116601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:57,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:57,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:57,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690988657] [2022-01-31 21:14:57,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:57,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:57,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:57,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:57,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:57,450 INFO L87 Difference]: Start difference. First operand 22 states and 27 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:14:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:57,536 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-01-31 21:14:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:14:57,536 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:14:57,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:57,538 INFO L225 Difference]: With dead ends: 37 [2022-01-31 21:14:57,538 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 21:14:57,538 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:14:57,538 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:57,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:14:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 21:14:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-01-31 21:14:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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:14:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-01-31 21:14:57,544 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2022-01-31 21:14:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:57,544 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-01-31 21:14:57,544 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:14:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-01-31 21:14:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:14:57,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:57,544 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:14:57,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:14:57,544 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:57,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-01-31 21:14:57,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:57,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [391785972] [2022-01-31 21:14:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:57,593 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:14:57,594 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:57,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:57,598 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:14:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:57,610 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:14:57,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:57,646 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:14:57,664 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:57,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [391785972] [2022-01-31 21:14:57,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [391785972] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:57,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:57,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:14:57,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510254879] [2022-01-31 21:14:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:57,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:14:57,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:57,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:14:57,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:14:57,666 INFO L87 Difference]: Start difference. First operand 27 states and 35 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:14:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:14:57,758 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-01-31 21:14:57,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:14:57,759 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:14:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:14:57,759 INFO L225 Difference]: With dead ends: 40 [2022-01-31 21:14:57,759 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 21:14:57,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:14:57,760 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:14:57,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 31 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:14:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 21:14:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-01-31 21:14:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:14:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-01-31 21:14:57,766 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 20 [2022-01-31 21:14:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:14:57,766 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-01-31 21:14:57,766 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:14:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-01-31 21:14:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 21:14:57,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:14:57,767 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:14:57,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:14:57,767 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:14:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:14:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-01-31 21:14:57,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:14:57,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1699729860] [2022-01-31 21:14:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:14:59,841 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:14:59,842 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:14:59,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:14:59,846 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:14:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:59,856 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:14:59,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:14:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:14:59,947 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:14:59,971 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:14:59,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1699729860] [2022-01-31 21:14:59,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1699729860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:14:59,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:14:59,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:14:59,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503235425] [2022-01-31 21:14:59,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:14:59,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:14:59,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:14:59,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:14:59,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:14:59,972 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:00,212 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2022-01-31 21:15:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:15:00,213 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 21:15:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:00,214 INFO L225 Difference]: With dead ends: 68 [2022-01-31 21:15:00,214 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 21:15:00,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:15:00,215 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:00,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:15:00,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 21:15:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-01-31 21:15:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-01-31 21:15:00,224 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 21 [2022-01-31 21:15:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:00,224 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-01-31 21:15:00,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2022-01-31 21:15:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 21:15:00,225 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:00,225 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] [2022-01-31 21:15:00,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:15:00,225 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:00,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -977123598, now seen corresponding path program 2 times [2022-01-31 21:15:00,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:00,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1392590382] [2022-01-31 21:15:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:00,266 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:15:00,266 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:00,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:00,275 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:15:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:00,307 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:00,419 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:15:00,878 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:00,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1392590382] [2022-01-31 21:15:00,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1392590382] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:00,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:00,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:15:00,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804282768] [2022-01-31 21:15:00,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:00,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:15:00,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:00,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:15:00,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:15:00,879 INFO L87 Difference]: Start difference. First operand 42 states and 58 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:15:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:01,101 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2022-01-31 21:15:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:15:01,102 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:15:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:01,102 INFO L225 Difference]: With dead ends: 61 [2022-01-31 21:15:01,102 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 21:15:01,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:15:01,103 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:01,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 55 Invalid, 0 Unknown, 7 Unchecked, 0.1s Time] [2022-01-31 21:15:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 21:15:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-01-31 21:15:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-01-31 21:15:01,114 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 22 [2022-01-31 21:15:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:01,115 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-01-31 21:15:01,115 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:15:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-01-31 21:15:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 21:15:01,115 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:01,115 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] [2022-01-31 21:15:01,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:15:01,115 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:01,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 3 times [2022-01-31 21:15:01,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:01,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1889124039] [2022-01-31 21:15:01,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:01,176 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 21:15:01,177 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:01,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:01,180 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:15:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:01,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:01,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:01,215 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:15:01,231 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:01,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1889124039] [2022-01-31 21:15:01,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1889124039] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:01,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:01,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:15:01,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026796271] [2022-01-31 21:15:01,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:01,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:15:01,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:01,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:15:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:15:01,232 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:15:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:01,305 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-01-31 21:15:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:15:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:15:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:01,306 INFO L225 Difference]: With dead ends: 53 [2022-01-31 21:15:01,306 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 21:15:01,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 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:15:01,307 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:01,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 25 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 21:15:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 21:15:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-31 21:15:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 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:15:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2022-01-31 21:15:01,317 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 22 [2022-01-31 21:15:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:01,317 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-01-31 21:15:01,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:15:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-01-31 21:15:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 21:15:01,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:01,318 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:01,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:15:01,318 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash -6760208, now seen corresponding path program 2 times [2022-01-31 21:15:01,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:01,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902869787] [2022-01-31 21:15:01,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:01,347 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:15:01,347 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:01,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:01,350 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:15:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:01,358 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:15:01,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:01,397 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:15:01,429 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:01,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1902869787] [2022-01-31 21:15:01,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1902869787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:01,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:01,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:15:01,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600013150] [2022-01-31 21:15:01,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:01,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:15:01,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:01,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:15:01,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:15:01,430 INFO L87 Difference]: Start difference. First operand 38 states and 51 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:15:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:01,635 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2022-01-31 21:15:01,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:15:01,635 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 23 [2022-01-31 21:15:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:01,636 INFO L225 Difference]: With dead ends: 74 [2022-01-31 21:15:01,636 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 21:15:01,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:15:01,637 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:01,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 34 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:15:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 21:15:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-01-31 21:15:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 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:15:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-01-31 21:15:01,650 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 23 [2022-01-31 21:15:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:01,650 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-01-31 21:15:01,650 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:15:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-01-31 21:15:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 21:15:01,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:01,650 INFO L514 BasicCegarLoop]: trace histogram [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:15:01,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:15:01,651 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:01,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1804115870, now seen corresponding path program 4 times [2022-01-31 21:15:01,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:01,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1405020741] [2022-01-31 21:15:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:01,681 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:15:01,682 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:01,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:01,685 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:15:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:01,693 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:15:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:01,735 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:15:01,764 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:01,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1405020741] [2022-01-31 21:15:01,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1405020741] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:01,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:01,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:15:01,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829412673] [2022-01-31 21:15:01,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:01,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:15:01,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:01,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:15:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:15:01,765 INFO L87 Difference]: Start difference. First operand 50 states and 68 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:15:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:01,973 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-01-31 21:15:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:15:01,973 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 24 [2022-01-31 21:15:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:01,973 INFO L225 Difference]: With dead ends: 58 [2022-01-31 21:15:01,973 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 21:15:01,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:15:01,974 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:01,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 46 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:15:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 21:15:01,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-01-31 21:15:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 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:15:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-01-31 21:15:01,985 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 24 [2022-01-31 21:15:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:01,985 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-01-31 21:15:01,985 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:15:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-01-31 21:15:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 21:15:01,985 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:01,985 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] [2022-01-31 21:15:01,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:15:01,986 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1227757058, now seen corresponding path program 3 times [2022-01-31 21:15:01,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:01,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [963283581] [2022-01-31 21:15:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:02,037 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:15:02,037 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:02,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:02,041 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:15:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:02,049 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:15:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:02,085 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:15:02,106 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:02,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [963283581] [2022-01-31 21:15:02,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [963283581] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:02,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:02,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:15:02,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521497661] [2022-01-31 21:15:02,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:02,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:15:02,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:15:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:15:02,107 INFO L87 Difference]: Start difference. First operand 41 states and 54 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:15:02,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:02,327 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2022-01-31 21:15:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:15:02,327 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 24 [2022-01-31 21:15:02,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:02,327 INFO L225 Difference]: With dead ends: 64 [2022-01-31 21:15:02,327 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 21:15:02,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:15:02,328 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:02,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 42 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:15:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 21:15:02,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2022-01-31 21:15:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 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:15:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-01-31 21:15:02,342 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 24 [2022-01-31 21:15:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:02,342 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-01-31 21:15:02,342 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:15:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-01-31 21:15:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 21:15:02,342 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:02,342 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] [2022-01-31 21:15:02,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:15:02,343 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:02,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1822836127, now seen corresponding path program 4 times [2022-01-31 21:15:02,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:02,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039448007] [2022-01-31 21:15:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:02,378 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:15:02,378 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:02,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:02,381 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:15:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:02,390 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:02,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:02,439 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:15:02,467 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:02,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039448007] [2022-01-31 21:15:02,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2039448007] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:02,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:02,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:15:02,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24633829] [2022-01-31 21:15:02,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:02,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:15:02,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:02,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:15:02,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:15:02,468 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:15:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:02,855 INFO L93 Difference]: Finished difference Result 88 states and 125 transitions. [2022-01-31 21:15:02,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:15:02,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:15:02,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:02,856 INFO L225 Difference]: With dead ends: 88 [2022-01-31 21:15:02,856 INFO L226 Difference]: Without dead ends: 82 [2022-01-31 21:15:02,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:15:02,857 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:02,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 43 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:15:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-31 21:15:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2022-01-31 21:15:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2022-01-31 21:15:02,881 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 25 [2022-01-31 21:15:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:02,881 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2022-01-31 21:15:02,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:15:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2022-01-31 21:15:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 21:15:02,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:02,885 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] [2022-01-31 21:15:02,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:15:02,885 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 5 times [2022-01-31 21:15:02,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:02,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [337593359] [2022-01-31 21:15:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:02,971 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:15:02,972 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:02,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:02,975 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:15:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:03,008 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:03,193 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:15:07,339 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:07,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [337593359] [2022-01-31 21:15:07,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [337593359] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:07,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:07,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:15:07,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557785985] [2022-01-31 21:15:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:07,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:15:07,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:15:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2022-01-31 21:15:07,340 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) 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:15:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:20,183 INFO L93 Difference]: Finished difference Result 137 states and 197 transitions. [2022-01-31 21:15:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:15:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) 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 26 [2022-01-31 21:15:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:20,184 INFO L225 Difference]: With dead ends: 137 [2022-01-31 21:15:20,184 INFO L226 Difference]: Without dead ends: 93 [2022-01-31 21:15:20,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=177, Invalid=811, Unknown=4, NotChecked=0, Total=992 [2022-01-31 21:15:20,185 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 53 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:20,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 62 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 231 Invalid, 0 Unknown, 48 Unchecked, 0.2s Time] [2022-01-31 21:15:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-31 21:15:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2022-01-31 21:15:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2022-01-31 21:15:20,212 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 26 [2022-01-31 21:15:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:20,213 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2022-01-31 21:15:20,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) 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:15:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2022-01-31 21:15:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 21:15:20,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:20,213 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:15:20,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:15:20,214 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1626264450, now seen corresponding path program 6 times [2022-01-31 21:15:20,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:20,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371671925] [2022-01-31 21:15:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:20,257 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:15:20,257 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:20,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:20,262 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:15:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:20,289 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:15:20,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:20,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:15:20,375 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:20,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371671925] [2022-01-31 21:15:20,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [371671925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:20,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:20,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:15:20,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285765917] [2022-01-31 21:15:20,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:20,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:15:20,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:20,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:15:20,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:15:20,377 INFO L87 Difference]: Start difference. First operand 73 states and 104 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:15:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:20,630 INFO L93 Difference]: Finished difference Result 140 states and 204 transitions. [2022-01-31 21:15:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:15:20,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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 26 [2022-01-31 21:15:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:20,631 INFO L225 Difference]: With dead ends: 140 [2022-01-31 21:15:20,631 INFO L226 Difference]: Without dead ends: 123 [2022-01-31 21:15:20,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 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:15:20,631 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 69 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:20,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 29 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:15:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-31 21:15:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2022-01-31 21:15:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 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:15:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2022-01-31 21:15:20,660 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 26 [2022-01-31 21:15:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:20,660 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2022-01-31 21:15:20,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:15:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2022-01-31 21:15:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 21:15:20,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:20,661 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] [2022-01-31 21:15:20,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:15:20,661 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:20,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:20,661 INFO L85 PathProgramCache]: Analyzing trace with hash 171340688, now seen corresponding path program 7 times [2022-01-31 21:15:20,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:20,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1547737378] [2022-01-31 21:15:20,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:20,741 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:15:20,742 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:20,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:20,745 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:15:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:20,764 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:15:20,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:20,861 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:20,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1547737378] [2022-01-31 21:15:20,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1547737378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:20,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:20,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:15:20,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323083022] [2022-01-31 21:15:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:20,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:15:20,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:20,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:15:20,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:15:20,863 INFO L87 Difference]: Start difference. First operand 96 states and 133 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:15:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:21,174 INFO L93 Difference]: Finished difference Result 166 states and 239 transitions. [2022-01-31 21:15:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:15:21,174 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 27 [2022-01-31 21:15:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:21,175 INFO L225 Difference]: With dead ends: 166 [2022-01-31 21:15:21,175 INFO L226 Difference]: Without dead ends: 149 [2022-01-31 21:15:21,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 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:15:21,176 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:21,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 42 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:15:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-01-31 21:15:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 110. [2022-01-31 21:15:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 105 states have internal predecessors, (149), 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:15:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2022-01-31 21:15:21,208 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 27 [2022-01-31 21:15:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:21,208 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2022-01-31 21:15:21,209 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:15:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2022-01-31 21:15:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:15:21,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:21,209 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] [2022-01-31 21:15:21,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:15:21,209 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:21,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:21,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1703289154, now seen corresponding path program 8 times [2022-01-31 21:15:21,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:21,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1590044564] [2022-01-31 21:15:21,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:21,236 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:15:21,236 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:21,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:21,240 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:15:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:21,250 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:21,307 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:15:21,334 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:21,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1590044564] [2022-01-31 21:15:21,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1590044564] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:21,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:21,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:15:21,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100006302] [2022-01-31 21:15:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:21,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:15:21,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:21,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:15:21,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:15:21,335 INFO L87 Difference]: Start difference. First operand 110 states and 153 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:15:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:21,735 INFO L93 Difference]: Finished difference Result 127 states and 172 transitions. [2022-01-31 21:15:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:15:21,736 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 28 [2022-01-31 21:15:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:21,736 INFO L225 Difference]: With dead ends: 127 [2022-01-31 21:15:21,736 INFO L226 Difference]: Without dead ends: 87 [2022-01-31 21:15:21,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:15:21,737 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:21,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 60 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:15:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-31 21:15:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2022-01-31 21:15:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2022-01-31 21:15:21,758 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 28 [2022-01-31 21:15:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:21,758 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2022-01-31 21:15:21,758 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:15:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2022-01-31 21:15:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 21:15:21,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:21,759 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] [2022-01-31 21:15:21,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:15:21,759 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:21,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash -341378767, now seen corresponding path program 9 times [2022-01-31 21:15:21,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:21,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1361697737] [2022-01-31 21:15:21,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:21,806 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:15:21,807 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:21,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:21,810 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:15:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:21,821 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:15:21,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:21,886 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:15:21,932 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:21,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1361697737] [2022-01-31 21:15:21,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1361697737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:21,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:21,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:15:21,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905444147] [2022-01-31 21:15:21,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:21,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:15:21,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:21,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:15:21,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:15:21,933 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:22,343 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2022-01-31 21:15:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:15:22,344 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-01-31 21:15:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:22,344 INFO L225 Difference]: With dead ends: 113 [2022-01-31 21:15:22,344 INFO L226 Difference]: Without dead ends: 108 [2022-01-31 21:15:22,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:15:22,345 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 42 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:22,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 41 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 21:15:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-31 21:15:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 83. [2022-01-31 21:15:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 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:15:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2022-01-31 21:15:22,373 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 29 [2022-01-31 21:15:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:22,373 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2022-01-31 21:15:22,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2022-01-31 21:15:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:15:22,374 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:22,374 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] [2022-01-31 21:15:22,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:15:22,374 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:22,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash 723391956, now seen corresponding path program 10 times [2022-01-31 21:15:22,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:22,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [817307023] [2022-01-31 21:15:22,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:22,423 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:15:22,423 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:22,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:22,430 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:15:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:22,473 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:22,566 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:15:22,625 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:22,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [817307023] [2022-01-31 21:15:22,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [817307023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:22,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:22,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:15:22,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082173393] [2022-01-31 21:15:22,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:22,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:15:22,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:22,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:15:22,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:15:22,626 INFO L87 Difference]: Start difference. First operand 83 states and 113 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:15:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:23,337 INFO L93 Difference]: Finished difference Result 115 states and 155 transitions. [2022-01-31 21:15:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:15:23,338 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:15:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:23,338 INFO L225 Difference]: With dead ends: 115 [2022-01-31 21:15:23,339 INFO L226 Difference]: Without dead ends: 110 [2022-01-31 21:15:23,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 21:15:23,339 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:23,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 59 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:15:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-01-31 21:15:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2022-01-31 21:15:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 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:15:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2022-01-31 21:15:23,367 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 30 [2022-01-31 21:15:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:23,367 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2022-01-31 21:15:23,367 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:15:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2022-01-31 21:15:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:15:23,368 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:23,368 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:23,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:15:23,368 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1086993202, now seen corresponding path program 5 times [2022-01-31 21:15:23,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:23,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697141468] [2022-01-31 21:15:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:23,392 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:15:23,393 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:23,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:23,396 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:15:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:23,406 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:15:23,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:23,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:15:23,511 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:23,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697141468] [2022-01-31 21:15:23,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [697141468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:23,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:23,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:15:23,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135296418] [2022-01-31 21:15:23,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:23,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:15:23,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:15:23,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:15:23,512 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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:15:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:24,144 INFO L93 Difference]: Finished difference Result 124 states and 169 transitions. [2022-01-31 21:15:24,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:15:24,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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 30 [2022-01-31 21:15:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:24,145 INFO L225 Difference]: With dead ends: 124 [2022-01-31 21:15:24,145 INFO L226 Difference]: Without dead ends: 118 [2022-01-31 21:15:24,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:15:24,146 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 53 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:24,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 61 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:15:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-31 21:15:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2022-01-31 21:15:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 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:15:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions. [2022-01-31 21:15:24,180 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 30 [2022-01-31 21:15:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:24,180 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 133 transitions. [2022-01-31 21:15:24,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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:15:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions. [2022-01-31 21:15:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:15:24,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:24,181 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] [2022-01-31 21:15:24,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:15:24,181 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:24,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:24,181 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 11 times [2022-01-31 21:15:24,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:24,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913286152] [2022-01-31 21:15:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:24,213 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:15:24,213 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:24,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:24,217 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:15:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:24,234 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:15:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:24,295 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:15:24,341 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:24,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913286152] [2022-01-31 21:15:24,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1913286152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:24,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:24,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:15:24,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505026007] [2022-01-31 21:15:24,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:24,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:15:24,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:24,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:15:24,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:15:24,342 INFO L87 Difference]: Start difference. First operand 98 states and 133 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) 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:15:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:24,880 INFO L93 Difference]: Finished difference Result 232 states and 315 transitions. [2022-01-31 21:15:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:15:24,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) 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 31 [2022-01-31 21:15:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:24,881 INFO L225 Difference]: With dead ends: 232 [2022-01-31 21:15:24,881 INFO L226 Difference]: Without dead ends: 162 [2022-01-31 21:15:24,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:15:24,882 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:24,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 60 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:15:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-01-31 21:15:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2022-01-31 21:15:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.356060606060606) internal successors, (179), 132 states have internal predecessors, (179), 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:15:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2022-01-31 21:15:24,933 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 31 [2022-01-31 21:15:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:24,933 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2022-01-31 21:15:24,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) 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:15:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2022-01-31 21:15:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:15:24,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:24,934 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:24,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:15:24,934 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash 944401809, now seen corresponding path program 12 times [2022-01-31 21:15:24,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:24,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [417670520] [2022-01-31 21:15:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:24,961 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:15:24,961 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:24,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:24,964 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:15:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:24,988 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:15:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:25,064 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:15:25,123 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:25,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [417670520] [2022-01-31 21:15:25,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [417670520] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:25,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:25,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:15:25,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216693369] [2022-01-31 21:15:25,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:25,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:15:25,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:25,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:15:25,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:15:25,124 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:25,668 INFO L93 Difference]: Finished difference Result 255 states and 367 transitions. [2022-01-31 21:15:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:15:25,668 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-01-31 21:15:25,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:25,669 INFO L225 Difference]: With dead ends: 255 [2022-01-31 21:15:25,669 INFO L226 Difference]: Without dead ends: 233 [2022-01-31 21:15:25,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 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:15:25,670 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 125 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:25,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 35 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:15:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-01-31 21:15:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 156. [2022-01-31 21:15:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 151 states have internal predecessors, (206), 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:15:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 210 transitions. [2022-01-31 21:15:25,744 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 210 transitions. Word has length 31 [2022-01-31 21:15:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:25,745 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 210 transitions. [2022-01-31 21:15:25,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:15:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 210 transitions. [2022-01-31 21:15:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 21:15:25,745 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:25,745 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:25,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:15:25,745 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:25,746 INFO L85 PathProgramCache]: Analyzing trace with hash -420451419, now seen corresponding path program 13 times [2022-01-31 21:15:25,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:25,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1823698211] [2022-01-31 21:15:25,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:25,789 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:15:25,789 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:25,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:25,792 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:15:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:25,802 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:15:25,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:25,882 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:15:25,960 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:25,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1823698211] [2022-01-31 21:15:25,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1823698211] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:25,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:25,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:15:25,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883471524] [2022-01-31 21:15:25,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:25,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:15:25,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:25,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:15:25,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:15:25,962 INFO L87 Difference]: Start difference. First operand 156 states and 210 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:15:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:26,594 INFO L93 Difference]: Finished difference Result 276 states and 394 transitions. [2022-01-31 21:15:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:15:26,595 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 32 [2022-01-31 21:15:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:26,595 INFO L225 Difference]: With dead ends: 276 [2022-01-31 21:15:26,595 INFO L226 Difference]: Without dead ends: 254 [2022-01-31 21:15:26,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:15:26,596 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 103 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:26,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 48 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:15:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-01-31 21:15:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 173. [2022-01-31 21:15:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.3630952380952381) internal successors, (229), 168 states have internal predecessors, (229), 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:15:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2022-01-31 21:15:26,697 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 32 [2022-01-31 21:15:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:26,697 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2022-01-31 21:15:26,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:15:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-01-31 21:15:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 21:15:26,698 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:26,698 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:26,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:15:26,698 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:26,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2062500636, now seen corresponding path program 14 times [2022-01-31 21:15:26,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:26,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976297082] [2022-01-31 21:15:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:26,734 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:15:26,735 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:26,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:26,739 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:15:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:26,754 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:15:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:26,923 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:26,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976297082] [2022-01-31 21:15:26,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1976297082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:26,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:26,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:15:26,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885076546] [2022-01-31 21:15:26,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:26,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:15:26,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:15:26,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:15:26,924 INFO L87 Difference]: Start difference. First operand 173 states and 233 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:15:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:27,730 INFO L93 Difference]: Finished difference Result 243 states and 312 transitions. [2022-01-31 21:15:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:15:27,730 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 32 [2022-01-31 21:15:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:27,731 INFO L225 Difference]: With dead ends: 243 [2022-01-31 21:15:27,731 INFO L226 Difference]: Without dead ends: 208 [2022-01-31 21:15:27,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:15:27,732 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:27,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 78 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:15:27,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-01-31 21:15:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 158. [2022-01-31 21:15:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.3725490196078431) internal successors, (210), 153 states have internal predecessors, (210), 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:15:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 214 transitions. [2022-01-31 21:15:27,803 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 214 transitions. Word has length 32 [2022-01-31 21:15:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:27,803 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 214 transitions. [2022-01-31 21:15:27,803 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:15:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 214 transitions. [2022-01-31 21:15:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 21:15:27,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:27,804 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:27,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:15:27,804 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:27,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:27,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1665087761, now seen corresponding path program 15 times [2022-01-31 21:15:27,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:27,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [450043662] [2022-01-31 21:15:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:27,835 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:15:27,835 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:27,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:27,838 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:15:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:27,850 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:15:27,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:27,926 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:15:27,980 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:27,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [450043662] [2022-01-31 21:15:27,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [450043662] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:27,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:27,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:15:27,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419155676] [2022-01-31 21:15:27,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:27,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:15:27,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:15:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:15:27,981 INFO L87 Difference]: Start difference. First operand 158 states and 214 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:15:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:28,916 INFO L93 Difference]: Finished difference Result 212 states and 276 transitions. [2022-01-31 21:15:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:15:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 33 [2022-01-31 21:15:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:28,917 INFO L225 Difference]: With dead ends: 212 [2022-01-31 21:15:28,917 INFO L226 Difference]: Without dead ends: 157 [2022-01-31 21:15:28,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=967, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:15:28,918 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:28,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 70 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:15:28,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-01-31 21:15:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 112. [2022-01-31 21:15:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 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:15:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 150 transitions. [2022-01-31 21:15:28,972 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 150 transitions. Word has length 33 [2022-01-31 21:15:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:28,973 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 150 transitions. [2022-01-31 21:15:28,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:15:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2022-01-31 21:15:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 21:15:28,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:28,973 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:28,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:15:28,973 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash -524795518, now seen corresponding path program 16 times [2022-01-31 21:15:28,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:28,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [715181946] [2022-01-31 21:15:28,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:29,004 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:15:29,004 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:29,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:29,007 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:15:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:29,020 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:15:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:29,127 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:15:29,222 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:29,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [715181946] [2022-01-31 21:15:29,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [715181946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:29,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:29,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:15:29,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965480788] [2022-01-31 21:15:29,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:29,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:15:29,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:29,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:15:29,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:15:29,223 INFO L87 Difference]: Start difference. First operand 112 states and 150 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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:15:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:30,136 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-01-31 21:15:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:15:30,136 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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 34 [2022-01-31 21:15:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:30,137 INFO L225 Difference]: With dead ends: 163 [2022-01-31 21:15:30,137 INFO L226 Difference]: Without dead ends: 144 [2022-01-31 21:15:30,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1031, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:15:30,138 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:30,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 80 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:15:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-01-31 21:15:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 110. [2022-01-31 21:15:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 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:15:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 145 transitions. [2022-01-31 21:15:30,188 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 145 transitions. Word has length 34 [2022-01-31 21:15:30,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:30,188 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 145 transitions. [2022-01-31 21:15:30,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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:15:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 145 transitions. [2022-01-31 21:15:30,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 21:15:30,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:30,188 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:30,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:15:30,188 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:30,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1983137790, now seen corresponding path program 6 times [2022-01-31 21:15:30,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:30,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1616970224] [2022-01-31 21:15:30,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:30,224 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:15:30,224 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:30,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:30,227 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:15:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:30,237 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:15:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:30,330 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:15:30,459 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:30,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1616970224] [2022-01-31 21:15:30,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1616970224] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:30,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:30,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:15:30,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885311993] [2022-01-31 21:15:30,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:30,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:15:30,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:30,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:15:30,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:15:30,460 INFO L87 Difference]: Start difference. First operand 110 states and 145 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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:15:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:31,267 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2022-01-31 21:15:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:15:31,267 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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 34 [2022-01-31 21:15:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:31,268 INFO L225 Difference]: With dead ends: 220 [2022-01-31 21:15:31,268 INFO L226 Difference]: Without dead ends: 199 [2022-01-31 21:15:31,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:15:31,269 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 114 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:31,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 53 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:15:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-01-31 21:15:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 122. [2022-01-31 21:15:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 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:15:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2022-01-31 21:15:31,329 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 162 transitions. Word has length 34 [2022-01-31 21:15:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:31,329 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 162 transitions. [2022-01-31 21:15:31,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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:15:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2022-01-31 21:15:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 21:15:31,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:31,331 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:31,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:15:31,331 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash 443549264, now seen corresponding path program 7 times [2022-01-31 21:15:31,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:31,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468461380] [2022-01-31 21:15:31,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:31,368 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:15:31,368 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:31,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:31,371 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:15:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:31,386 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:31,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:31,512 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:15:31,641 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:31,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468461380] [2022-01-31 21:15:31,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [468461380] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:31,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:31,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:15:31,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073505335] [2022-01-31 21:15:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:31,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:15:31,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:31,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:15:31,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:15:31,642 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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:15:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:32,663 INFO L93 Difference]: Finished difference Result 234 states and 339 transitions. [2022-01-31 21:15:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:15:32,663 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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 35 [2022-01-31 21:15:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:32,664 INFO L225 Difference]: With dead ends: 234 [2022-01-31 21:15:32,664 INFO L226 Difference]: Without dead ends: 213 [2022-01-31 21:15:32,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:15:32,665 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 138 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:32,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 46 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:15:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-01-31 21:15:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 133. [2022-01-31 21:15:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.3515625) internal successors, (173), 128 states have internal predecessors, (173), 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:15:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2022-01-31 21:15:32,733 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 35 [2022-01-31 21:15:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:32,733 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2022-01-31 21:15:32,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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:15:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2022-01-31 21:15:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:15:32,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:32,734 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] [2022-01-31 21:15:32,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:15:32,734 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:32,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:32,734 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 17 times [2022-01-31 21:15:32,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:32,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410502140] [2022-01-31 21:15:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:32,761 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:15:32,761 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:32,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:32,764 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:15:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:32,780 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:15:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:32,935 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:15:33,069 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:33,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410502140] [2022-01-31 21:15:33,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [410502140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:33,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:33,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:15:33,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870512836] [2022-01-31 21:15:33,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:33,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:15:33,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:33,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:15:33,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:15:33,070 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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:15:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:34,444 INFO L93 Difference]: Finished difference Result 337 states and 437 transitions. [2022-01-31 21:15:34,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:15:34,445 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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 36 [2022-01-31 21:15:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:34,445 INFO L225 Difference]: With dead ends: 337 [2022-01-31 21:15:34,445 INFO L226 Difference]: Without dead ends: 202 [2022-01-31 21:15:34,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=1754, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 21:15:34,447 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:34,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 91 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:15:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-01-31 21:15:34,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 138. [2022-01-31 21:15:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 133 states have internal predecessors, (184), 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:15:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2022-01-31 21:15:34,522 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 36 [2022-01-31 21:15:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:34,522 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2022-01-31 21:15:34,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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:15:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2022-01-31 21:15:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:15:34,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:34,523 INFO L514 BasicCegarLoop]: trace histogram [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:15:34,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:15:34,523 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1762228047, now seen corresponding path program 18 times [2022-01-31 21:15:34,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:34,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [432362413] [2022-01-31 21:15:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:34,563 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:15:34,563 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:34,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:34,567 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:15:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:34,588 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:15:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:34,752 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:15:34,947 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:34,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [432362413] [2022-01-31 21:15:34,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [432362413] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:34,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:34,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:15:34,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956426481] [2022-01-31 21:15:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:34,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:15:34,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:34,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:15:34,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:15:34,949 INFO L87 Difference]: Start difference. First operand 138 states and 188 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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:15:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:37,432 INFO L93 Difference]: Finished difference Result 206 states and 265 transitions. [2022-01-31 21:15:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 21:15:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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:15:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:37,433 INFO L225 Difference]: With dead ends: 206 [2022-01-31 21:15:37,433 INFO L226 Difference]: Without dead ends: 201 [2022-01-31 21:15:37,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=444, Invalid=2526, Unknown=0, NotChecked=0, Total=2970 [2022-01-31 21:15:37,434 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 49 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:37,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 88 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:15:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-01-31 21:15:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2022-01-31 21:15:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 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:15:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 178 transitions. [2022-01-31 21:15:37,515 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 178 transitions. Word has length 37 [2022-01-31 21:15:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:37,515 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 178 transitions. [2022-01-31 21:15:37,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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:15:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2022-01-31 21:15:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:15:37,515 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:37,515 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:37,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 21:15:37,516 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:37,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:37,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1670686287, now seen corresponding path program 8 times [2022-01-31 21:15:37,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:37,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950320134] [2022-01-31 21:15:37,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:37,550 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:15:37,550 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:37,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:37,553 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:15:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:37,570 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:37,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:37,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:15:37,914 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:37,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950320134] [2022-01-31 21:15:37,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [950320134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:37,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:37,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:15:37,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135827549] [2022-01-31 21:15:37,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:37,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:15:37,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:37,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:15:37,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:15:37,916 INFO L87 Difference]: Start difference. First operand 133 states and 178 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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:15:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:40,255 INFO L93 Difference]: Finished difference Result 225 states and 275 transitions. [2022-01-31 21:15:40,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 21:15:40,256 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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:15:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:40,257 INFO L225 Difference]: With dead ends: 225 [2022-01-31 21:15:40,257 INFO L226 Difference]: Without dead ends: 201 [2022-01-31 21:15:40,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=208, Invalid=1514, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 21:15:40,258 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 57 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:40,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 96 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:15:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-01-31 21:15:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 132. [2022-01-31 21:15:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 127 states have internal predecessors, (170), 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:15:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 174 transitions. [2022-01-31 21:15:40,343 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 174 transitions. Word has length 37 [2022-01-31 21:15:40,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:40,344 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 174 transitions. [2022-01-31 21:15:40,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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:15:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 174 transitions. [2022-01-31 21:15:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 21:15:40,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:40,344 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] [2022-01-31 21:15:40,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 21:15:40,344 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1492577871, now seen corresponding path program 9 times [2022-01-31 21:15:40,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:40,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [92822167] [2022-01-31 21:15:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:40,397 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:15:40,397 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:40,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:40,401 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:15:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:40,412 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:15:40,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:40,545 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:15:40,803 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:40,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [92822167] [2022-01-31 21:15:40,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [92822167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:40,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:40,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:15:40,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766779700] [2022-01-31 21:15:40,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:40,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:15:40,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:40,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:15:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:15:40,804 INFO L87 Difference]: Start difference. First operand 132 states and 174 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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:15:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:42,211 INFO L93 Difference]: Finished difference Result 269 states and 394 transitions. [2022-01-31 21:15:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:15:42,211 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 37 [2022-01-31 21:15:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:42,212 INFO L225 Difference]: With dead ends: 269 [2022-01-31 21:15:42,212 INFO L226 Difference]: Without dead ends: 246 [2022-01-31 21:15:42,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=360, Invalid=1200, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 21:15:42,213 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 132 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:42,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 56 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:15:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-01-31 21:15:42,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 144. [2022-01-31 21:15:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 139 states have internal predecessors, (187), 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:15:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 191 transitions. [2022-01-31 21:15:42,312 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 191 transitions. Word has length 37 [2022-01-31 21:15:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:42,313 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 191 transitions. [2022-01-31 21:15:42,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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:15:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 191 transitions. [2022-01-31 21:15:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 21:15:42,313 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:42,313 INFO L514 BasicCegarLoop]: trace histogram [10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:42,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 21:15:42,313 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash 816552355, now seen corresponding path program 10 times [2022-01-31 21:15:42,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:42,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67342278] [2022-01-31 21:15:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:42,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:15:42,344 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:42,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:42,347 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:15:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:42,357 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:15:42,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:42,494 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:15:42,750 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:42,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67342278] [2022-01-31 21:15:42,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [67342278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:42,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:42,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:15:42,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690240550] [2022-01-31 21:15:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:42,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:15:42,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:42,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:15:42,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:15:42,752 INFO L87 Difference]: Start difference. First operand 144 states and 191 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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:15:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:44,367 INFO L93 Difference]: Finished difference Result 283 states and 412 transitions. [2022-01-31 21:15:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 21:15:44,367 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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:15:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:44,368 INFO L225 Difference]: With dead ends: 283 [2022-01-31 21:15:44,368 INFO L226 Difference]: Without dead ends: 260 [2022-01-31 21:15:44,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 21:15:44,369 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 200 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:44,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 44 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:15:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-01-31 21:15:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 155. [2022-01-31 21:15:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 150 states have internal predecessors, (202), 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:15:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 206 transitions. [2022-01-31 21:15:44,478 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 206 transitions. Word has length 38 [2022-01-31 21:15:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:44,478 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 206 transitions. [2022-01-31 21:15:44,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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:15:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-01-31 21:15:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 21:15:44,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:44,478 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] [2022-01-31 21:15:44,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 21:15:44,479 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2087930961, now seen corresponding path program 11 times [2022-01-31 21:15:44,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:44,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [566928596] [2022-01-31 21:15:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:44,514 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:15:44,514 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:44,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:44,519 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:15:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:44,535 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:15:44,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:44,677 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:15:44,813 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:44,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [566928596] [2022-01-31 21:15:44,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [566928596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:44,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:44,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:15:44,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657792668] [2022-01-31 21:15:44,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:44,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:15:44,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:44,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:15:44,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:15:44,814 INFO L87 Difference]: Start difference. First operand 155 states and 206 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:15:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:47,263 INFO L93 Difference]: Finished difference Result 313 states and 409 transitions. [2022-01-31 21:15:47,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-31 21:15:47,263 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:15:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:47,264 INFO L225 Difference]: With dead ends: 313 [2022-01-31 21:15:47,264 INFO L226 Difference]: Without dead ends: 308 [2022-01-31 21:15:47,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=653, Invalid=3007, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 21:15:47,265 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 71 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:47,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 71 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:15:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-01-31 21:15:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 176. [2022-01-31 21:15:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 171 states have internal predecessors, (231), 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:15:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 235 transitions. [2022-01-31 21:15:47,398 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 235 transitions. Word has length 39 [2022-01-31 21:15:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:47,399 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 235 transitions. [2022-01-31 21:15:47,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:15:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 235 transitions. [2022-01-31 21:15:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:15:47,399 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:47,399 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] [2022-01-31 21:15:47,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 21:15:47,399 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash -355872300, now seen corresponding path program 12 times [2022-01-31 21:15:47,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:47,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122512887] [2022-01-31 21:15:47,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:47,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:15:47,429 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:47,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:47,432 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:15:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:47,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:15:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:47,620 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:15:47,837 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:47,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122512887] [2022-01-31 21:15:47,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [122512887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:47,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:47,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:15:47,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851063282] [2022-01-31 21:15:47,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:47,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:15:47,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:47,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:15:47,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:15:47,839 INFO L87 Difference]: Start difference. First operand 176 states and 235 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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:15:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:50,797 INFO L93 Difference]: Finished difference Result 485 states and 622 transitions. [2022-01-31 21:15:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 21:15:50,798 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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:15:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:50,799 INFO L225 Difference]: With dead ends: 485 [2022-01-31 21:15:50,799 INFO L226 Difference]: Without dead ends: 334 [2022-01-31 21:15:50,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=295, Invalid=2675, Unknown=0, NotChecked=0, Total=2970 [2022-01-31 21:15:50,800 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:50,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 109 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:15:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-01-31 21:15:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 183. [2022-01-31 21:15:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.3202247191011236) internal successors, (235), 178 states have internal predecessors, (235), 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:15:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2022-01-31 21:15:50,938 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 40 [2022-01-31 21:15:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:50,938 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2022-01-31 21:15:50,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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:15:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2022-01-31 21:15:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:15:50,939 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:50,939 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] [2022-01-31 21:15:50,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 21:15:50,939 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:50,939 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 19 times [2022-01-31 21:15:50,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:50,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [93582634] [2022-01-31 21:15:50,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:50,969 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:15:50,969 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:50,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:50,973 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:15:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:50,992 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:15:51,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:51,083 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:15:51,233 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:51,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [93582634] [2022-01-31 21:15:51,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [93582634] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:51,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:51,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:15:51,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284579740] [2022-01-31 21:15:51,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:51,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:15:51,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:51,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:15:51,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:15:51,234 INFO L87 Difference]: Start difference. First operand 183 states and 239 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:15:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:53,611 INFO L93 Difference]: Finished difference Result 344 states and 419 transitions. [2022-01-31 21:15:53,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 21:15:53,613 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 41 [2022-01-31 21:15:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:53,614 INFO L225 Difference]: With dead ends: 344 [2022-01-31 21:15:53,614 INFO L226 Difference]: Without dead ends: 339 [2022-01-31 21:15:53,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=297, Invalid=1509, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 21:15:53,615 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:53,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 74 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:15:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-01-31 21:15:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 191. [2022-01-31 21:15:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.3494623655913978) internal successors, (251), 186 states have internal predecessors, (251), 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:15:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 255 transitions. [2022-01-31 21:15:53,772 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 255 transitions. Word has length 41 [2022-01-31 21:15:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:53,772 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 255 transitions. [2022-01-31 21:15:53,772 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:15:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 255 transitions. [2022-01-31 21:15:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:15:53,773 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:53,773 INFO L514 BasicCegarLoop]: trace histogram [11, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:53,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 21:15:53,773 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:53,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1435666111, now seen corresponding path program 13 times [2022-01-31 21:15:53,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:53,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131462822] [2022-01-31 21:15:53,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:53,828 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:15:53,828 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:53,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:53,832 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:15:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:53,844 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:15:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:53,998 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:15:54,437 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:54,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131462822] [2022-01-31 21:15:54,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [131462822] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:54,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:54,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 21:15:54,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434094872] [2022-01-31 21:15:54,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:54,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 21:15:54,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:54,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 21:15:54,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:15:54,438 INFO L87 Difference]: Start difference. First operand 191 states and 255 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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:15:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:15:58,927 INFO L93 Difference]: Finished difference Result 398 states and 601 transitions. [2022-01-31 21:15:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:15:58,928 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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 41 [2022-01-31 21:15:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:15:58,929 INFO L225 Difference]: With dead ends: 398 [2022-01-31 21:15:58,929 INFO L226 Difference]: Without dead ends: 372 [2022-01-31 21:15:58,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=483, Invalid=1679, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 21:15:58,930 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 217 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:15:58,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 57 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:15:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-01-31 21:15:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 205. [2022-01-31 21:15:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.355) internal successors, (271), 200 states have internal predecessors, (271), 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:15:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 275 transitions. [2022-01-31 21:15:59,109 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 275 transitions. Word has length 41 [2022-01-31 21:15:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:15:59,109 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 275 transitions. [2022-01-31 21:15:59,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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:15:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 275 transitions. [2022-01-31 21:15:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:15:59,109 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:15:59,109 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:15:59,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 21:15:59,109 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:15:59,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:15:59,110 INFO L85 PathProgramCache]: Analyzing trace with hash 410232754, now seen corresponding path program 20 times [2022-01-31 21:15:59,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:15:59,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [900744771] [2022-01-31 21:15:59,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:15:59,145 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:15:59,145 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:15:59,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:15:59,152 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:15:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:59,171 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:15:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:15:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:15:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:15:59,366 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:15:59,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [900744771] [2022-01-31 21:15:59,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [900744771] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:15:59,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:15:59,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:15:59,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024912504] [2022-01-31 21:15:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:15:59,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:15:59,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:15:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:15:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:15:59,367 INFO L87 Difference]: Start difference. First operand 205 states and 275 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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:16:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:01,040 INFO L93 Difference]: Finished difference Result 319 states and 395 transitions. [2022-01-31 21:16:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 21:16:01,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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:16:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:01,041 INFO L225 Difference]: With dead ends: 319 [2022-01-31 21:16:01,041 INFO L226 Difference]: Without dead ends: 288 [2022-01-31 21:16:01,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=1193, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 21:16:01,042 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:01,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 65 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:16:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-01-31 21:16:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 193. [2022-01-31 21:16:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.3617021276595744) internal successors, (256), 188 states have internal predecessors, (256), 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:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 260 transitions. [2022-01-31 21:16:01,222 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 260 transitions. Word has length 42 [2022-01-31 21:16:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:01,222 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 260 transitions. [2022-01-31 21:16:01,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 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:16:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 260 transitions. [2022-01-31 21:16:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:16:01,222 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:01,222 INFO L514 BasicCegarLoop]: trace histogram [12, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:01,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 21:16:01,223 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1049677711, now seen corresponding path program 14 times [2022-01-31 21:16:01,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:01,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1776626771] [2022-01-31 21:16:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:01,264 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:01,264 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:01,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:01,267 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:16:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:01,280 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:16:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:01,459 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:01,867 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:01,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1776626771] [2022-01-31 21:16:01,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1776626771] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:01,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:01,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:16:01,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373275172] [2022-01-31 21:16:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:01,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:16:01,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:01,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:16:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:16:01,868 INFO L87 Difference]: Start difference. First operand 193 states and 260 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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:16:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:16:05,453 INFO L93 Difference]: Finished difference Result 404 states and 607 transitions. [2022-01-31 21:16:05,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:16:05,453 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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:16:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:16:05,454 INFO L225 Difference]: With dead ends: 404 [2022-01-31 21:16:05,455 INFO L226 Difference]: Without dead ends: 377 [2022-01-31 21:16:05,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 21:16:05,455 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 179 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:16:05,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 52 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:16:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-01-31 21:16:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 206. [2022-01-31 21:16:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 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:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 278 transitions. [2022-01-31 21:16:05,656 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 278 transitions. Word has length 42 [2022-01-31 21:16:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:16:05,656 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 278 transitions. [2022-01-31 21:16:05,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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:16:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 278 transitions. [2022-01-31 21:16:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 21:16:05,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:16:05,657 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:16:05,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 21:16:05,657 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:16:05,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:16:05,657 INFO L85 PathProgramCache]: Analyzing trace with hash -774755905, now seen corresponding path program 15 times [2022-01-31 21:16:05,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:16:05,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [623998846] [2022-01-31 21:16:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:16:05,693 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:05,693 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:16:05,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:16:05,696 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:16:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:05,718 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:16:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:16:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:16:05,960 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,945 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 (mod (+ c_main_~x~0 1) 4294967296)) (< 0 (mod (+ 3 c_main_~x~0) 4294967296)) (< 0 (mod (+ 5 c_main_~x~0) 4294967296)) (< 0 (mod (+ 4 c_main_~x~0) 4294967296)) (or (= (+ (- 5) c_main_~y~0) 0) (and (< 0 (mod (+ c_main_~x~0 c_main_~y~0) 4294967296)) (forall ((v_it_42 Int)) (or (not (<= 1 v_it_42)) (not (<= (+ 6 v_it_42) c_main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_42) c_main_~x~0 c_main_~y~0) 4294967296)))) (< 5 c_main_~y~0))) (< 0 (mod (+ 2 c_main_~x~0) 4294967296))) is different from false [2022-01-31 21:16:43,081 WARN L228 SmtUtils]: Spent 6.92s 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:16:43,083 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:16:43,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [623998846] [2022-01-31 21:16:43,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [623998846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:16:43,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:16:43,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:16:43,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145390416] [2022-01-31 21:16:43,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:16:43,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:16:43,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:16:43,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:16:43,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=572, Unknown=3, NotChecked=50, Total=756 [2022-01-31 21:16:43,084 INFO L87 Difference]: Start difference. First operand 206 states and 278 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:06,827 WARN L228 SmtUtils]: Spent 16.45s on a formula simplification. DAG size of input: 59 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:17:26,397 WARN L228 SmtUtils]: Spent 10.52s on a formula simplification. DAG size of input: 74 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 21:17:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:27,221 INFO L93 Difference]: Finished difference Result 291 states and 416 transitions. [2022-01-31 21:17:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 21:17:27,222 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-01-31 21:17:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:27,222 INFO L225 Difference]: With dead ends: 291 [2022-01-31 21:17:27,222 INFO L226 Difference]: Without dead ends: 286 [2022-01-31 21:17:27,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 80.9s TimeCoverageRelationStatistics Valid=315, Invalid=1660, Unknown=9, NotChecked=86, Total=2070 [2022-01-31 21:17:27,223 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:27,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 58 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 256 Invalid, 0 Unknown, 144 Unchecked, 0.2s Time] [2022-01-31 21:17:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-01-31 21:17:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 230. [2022-01-31 21:17:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.3644444444444443) internal successors, (307), 225 states have internal predecessors, (307), 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,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 311 transitions. [2022-01-31 21:17:27,453 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 311 transitions. Word has length 43 [2022-01-31 21:17:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:27,453 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 311 transitions. [2022-01-31 21:17:27,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:17:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 311 transitions. [2022-01-31 21:17:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:17:27,454 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:27,454 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:27,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 21:17:27,454 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:27,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash 919531266, now seen corresponding path program 21 times [2022-01-31 21:17:27,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:27,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [78248031] [2022-01-31 21:17:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:27,478 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,479 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:27,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:27,482 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:17:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:27,502 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:17:27,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:27,660 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:27,966 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:27,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [78248031] [2022-01-31 21:17:27,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [78248031] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:27,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:27,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:17:27,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122078751] [2022-01-31 21:17:27,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:27,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:17:27,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:27,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:17:27,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:17:27,967 INFO L87 Difference]: Start difference. First operand 230 states and 311 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:17:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:29,527 INFO L93 Difference]: Finished difference Result 378 states and 470 transitions. [2022-01-31 21:17:29,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:17:29,528 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 44 [2022-01-31 21:17:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:29,529 INFO L225 Difference]: With dead ends: 378 [2022-01-31 21:17:29,529 INFO L226 Difference]: Without dead ends: 348 [2022-01-31 21:17:29,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=294, Invalid=1346, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 21:17:29,529 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:29,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 53 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:17:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-01-31 21:17:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 210. [2022-01-31 21:17:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.3365853658536586) internal successors, (274), 205 states have internal predecessors, (274), 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:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 278 transitions. [2022-01-31 21:17:29,734 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 278 transitions. Word has length 44 [2022-01-31 21:17:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:29,734 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 278 transitions. [2022-01-31 21:17:29,734 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:17:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 278 transitions. [2022-01-31 21:17:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:17:29,735 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:29,735 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] [2022-01-31 21:17:29,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 21:17:29,735 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:29,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:29,735 INFO L85 PathProgramCache]: Analyzing trace with hash -107841918, now seen corresponding path program 16 times [2022-01-31 21:17:29,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:29,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1679942857] [2022-01-31 21:17:29,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:29,785 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:29,786 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:29,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:29,789 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:17:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:29,808 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:17:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:29,901 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:30,197 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:30,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1679942857] [2022-01-31 21:17:30,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1679942857] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:30,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:30,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:17:30,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33237987] [2022-01-31 21:17:30,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:30,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:17:30,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:30,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:17:30,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:17:30,198 INFO L87 Difference]: Start difference. First operand 210 states and 278 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:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:34,983 INFO L93 Difference]: Finished difference Result 422 states and 524 transitions. [2022-01-31 21:17:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 21:17:34,983 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 44 [2022-01-31 21:17:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:34,984 INFO L225 Difference]: With dead ends: 422 [2022-01-31 21:17:34,984 INFO L226 Difference]: Without dead ends: 416 [2022-01-31 21:17:34,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=571, Invalid=3211, Unknown=0, NotChecked=0, Total=3782 [2022-01-31 21:17:34,985 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:34,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 74 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 21:17:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-01-31 21:17:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 240. [2022-01-31 21:17:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 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:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 323 transitions. [2022-01-31 21:17:35,215 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 323 transitions. Word has length 44 [2022-01-31 21:17:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:35,215 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 323 transitions. [2022-01-31 21:17:35,215 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:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 323 transitions. [2022-01-31 21:17:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:17:35,216 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:35,216 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] [2022-01-31 21:17:35,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 21:17:35,216 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:35,216 INFO L85 PathProgramCache]: Analyzing trace with hash 986362945, now seen corresponding path program 22 times [2022-01-31 21:17:35,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:35,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [66445706] [2022-01-31 21:17:35,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:35,257 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:35,257 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:35,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:35,260 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:17:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:35,284 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:17:35,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:35,503 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:35,920 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:35,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [66445706] [2022-01-31 21:17:35,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [66445706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:35,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:35,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:17:35,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743883056] [2022-01-31 21:17:35,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:35,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:17:35,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:35,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:17:35,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:17:35,921 INFO L87 Difference]: Start difference. First operand 240 states and 323 transitions. Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 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:17:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:41,515 INFO L93 Difference]: Finished difference Result 687 states and 875 transitions. [2022-01-31 21:17:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-31 21:17:41,516 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 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 45 [2022-01-31 21:17:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:41,517 INFO L225 Difference]: With dead ends: 687 [2022-01-31 21:17:41,517 INFO L226 Difference]: Without dead ends: 475 [2022-01-31 21:17:41,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=368, Invalid=3664, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 21:17:41,520 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 59 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:41,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 126 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 21:17:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-01-31 21:17:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 247. [2022-01-31 21:17:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.3305785123966942) internal successors, (322), 242 states have internal predecessors, (322), 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:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 326 transitions. [2022-01-31 21:17:41,756 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 326 transitions. Word has length 45 [2022-01-31 21:17:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:41,756 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 326 transitions. [2022-01-31 21:17:41,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 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:17:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2022-01-31 21:17:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:17:41,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:41,757 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:41,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 21:17:41,757 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:41,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash 284721058, now seen corresponding path program 23 times [2022-01-31 21:17:41,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:41,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1136993774] [2022-01-31 21:17:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:41,796 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:41,797 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:41,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:41,800 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:17:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:41,833 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:17:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:42,084 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:42,554 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:42,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1136993774] [2022-01-31 21:17:42,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1136993774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:42,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:42,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:17:42,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266736841] [2022-01-31 21:17:42,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:42,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:17:42,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:42,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:17:42,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:17:42,555 INFO L87 Difference]: Start difference. First operand 247 states and 326 transitions. Second operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 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:17:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:48,766 INFO L93 Difference]: Finished difference Result 479 states and 581 transitions. [2022-01-31 21:17:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 21:17:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 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 46 [2022-01-31 21:17:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:48,768 INFO L225 Difference]: With dead ends: 479 [2022-01-31 21:17:48,768 INFO L226 Difference]: Without dead ends: 445 [2022-01-31 21:17:48,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=355, Invalid=3305, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 21:17:48,768 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 80 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:48,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 120 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-31 21:17:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-01-31 21:17:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 243. [2022-01-31 21:17:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.365546218487395) internal successors, (325), 238 states have internal predecessors, (325), 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:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 329 transitions. [2022-01-31 21:17:49,013 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 329 transitions. Word has length 46 [2022-01-31 21:17:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:49,013 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 329 transitions. [2022-01-31 21:17:49,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 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:17:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 329 transitions. [2022-01-31 21:17:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:17:49,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:49,013 INFO L514 BasicCegarLoop]: trace histogram [13, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:49,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 21:17:49,014 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:49,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:49,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1367658354, now seen corresponding path program 17 times [2022-01-31 21:17:49,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:49,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [373319808] [2022-01-31 21:17:49,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:49,046 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:49,047 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:49,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:49,049 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:17:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:49,061 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:17:49,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:49,273 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:50,028 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:50,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [373319808] [2022-01-31 21:17:50,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [373319808] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:50,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:50,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:17:50,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399870804] [2022-01-31 21:17:50,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:50,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:17:50,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:50,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:17:50,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:17:50,029 INFO L87 Difference]: Start difference. First operand 243 states and 329 transitions. Second operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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:17:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:17:54,215 INFO L93 Difference]: Finished difference Result 553 states and 853 transitions. [2022-01-31 21:17:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 21:17:54,215 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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 46 [2022-01-31 21:17:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:17:54,217 INFO L225 Difference]: With dead ends: 553 [2022-01-31 21:17:54,217 INFO L226 Difference]: Without dead ends: 521 [2022-01-31 21:17:54,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=624, Invalid=2238, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 21:17:54,217 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 193 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:17:54,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 62 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 21:17:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-01-31 21:17:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 260. [2022-01-31 21:17:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 255 states have (on average 1.3686274509803922) internal successors, (349), 255 states have internal predecessors, (349), 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:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 353 transitions. [2022-01-31 21:17:54,505 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 353 transitions. Word has length 46 [2022-01-31 21:17:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:17:54,505 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 353 transitions. [2022-01-31 21:17:54,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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:17:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 353 transitions. [2022-01-31 21:17:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:17:54,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:17:54,506 INFO L514 BasicCegarLoop]: trace histogram [14, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:17:54,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 21:17:54,506 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:17:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:17:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1228485026, now seen corresponding path program 18 times [2022-01-31 21:17:54,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:17:54,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238002297] [2022-01-31 21:17:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:17:54,536 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:54,536 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:17:54,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:17:54,540 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:17:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:54,562 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:17:54,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:17:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:17:54,782 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,583 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:17:55,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238002297] [2022-01-31 21:17:55,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [238002297] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:17:55,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:17:55,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:17:55,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366649831] [2022-01-31 21:17:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:17:55,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:17:55,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:17:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:17:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:17:55,584 INFO L87 Difference]: Start difference. First operand 260 states and 353 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:00,037 INFO L93 Difference]: Finished difference Result 574 states and 880 transitions. [2022-01-31 21:18:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 21:18:00,038 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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 47 [2022-01-31 21:18:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:00,039 INFO L225 Difference]: With dead ends: 574 [2022-01-31 21:18:00,039 INFO L226 Difference]: Without dead ends: 542 [2022-01-31 21:18:00,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=651, Invalid=2429, Unknown=0, NotChecked=0, Total=3080 [2022-01-31 21:18:00,040 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 201 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:00,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 70 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:18:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-01-31 21:18:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 276. [2022-01-31 21:18:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.3690036900369005) internal successors, (371), 271 states have internal predecessors, (371), 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,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 375 transitions. [2022-01-31 21:18:00,360 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 375 transitions. Word has length 47 [2022-01-31 21:18:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:00,360 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 375 transitions. [2022-01-31 21:18:00,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 375 transitions. [2022-01-31 21:18:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:18:00,362 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:00,362 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] [2022-01-31 21:18:00,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 21:18:00,362 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:00,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1502985036, now seen corresponding path program 24 times [2022-01-31 21:18:00,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:00,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [617141150] [2022-01-31 21:18:00,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:00,401 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,402 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:00,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:00,405 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:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:00,433 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:00,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:00,631 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:01,111 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:01,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [617141150] [2022-01-31 21:18:01,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [617141150] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:01,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:01,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-31 21:18:01,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605838558] [2022-01-31 21:18:01,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:01,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 21:18:01,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:01,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 21:18:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:18:01,112 INFO L87 Difference]: Start difference. First operand 276 states and 375 transitions. Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 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:18:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:10,979 INFO L93 Difference]: Finished difference Result 564 states and 715 transitions. [2022-01-31 21:18:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-31 21:18:10,979 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 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:18:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:10,981 INFO L225 Difference]: With dead ends: 564 [2022-01-31 21:18:10,981 INFO L226 Difference]: Without dead ends: 559 [2022-01-31 21:18:10,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2400 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1270, Invalid=6740, Unknown=0, NotChecked=0, Total=8010 [2022-01-31 21:18:10,983 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 100 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:10,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 53 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-31 21:18:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-01-31 21:18:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 270. [2022-01-31 21:18:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.350943396226415) internal successors, (358), 265 states have internal predecessors, (358), 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:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 362 transitions. [2022-01-31 21:18:11,324 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 362 transitions. Word has length 48 [2022-01-31 21:18:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:11,324 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 362 transitions. [2022-01-31 21:18:11,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 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:18:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 362 transitions. [2022-01-31 21:18:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:18:11,324 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:11,324 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] [2022-01-31 21:18:11,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 21:18:11,325 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:11,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash 755437972, now seen corresponding path program 19 times [2022-01-31 21:18:11,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:11,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [888286468] [2022-01-31 21:18:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:11,363 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:11,363 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:11,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:11,366 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:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:11,389 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:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:11,633 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:12,456 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:12,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [888286468] [2022-01-31 21:18:12,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [888286468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:12,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:12,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 21:18:12,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660517871] [2022-01-31 21:18:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:12,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 21:18:12,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:12,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 21:18:12,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:18:12,457 INFO L87 Difference]: Start difference. First operand 270 states and 362 transitions. Second operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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:18:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:24,292 INFO L93 Difference]: Finished difference Result 855 states and 1066 transitions. [2022-01-31 21:18:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 21:18:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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:18:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:24,294 INFO L225 Difference]: With dead ends: 855 [2022-01-31 21:18:24,294 INFO L226 Difference]: Without dead ends: 616 [2022-01-31 21:18:24,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=439, Invalid=4673, Unknown=0, NotChecked=0, Total=5112 [2022-01-31 21:18:24,295 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 85 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:24,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 128 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-01-31 21:18:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-01-31 21:18:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 279. [2022-01-31 21:18:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 274 states have (on average 1.3248175182481752) internal successors, (363), 274 states have internal predecessors, (363), 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:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 367 transitions. [2022-01-31 21:18:24,641 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 367 transitions. Word has length 48 [2022-01-31 21:18:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:24,641 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 367 transitions. [2022-01-31 21:18:24,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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:18:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 367 transitions. [2022-01-31 21:18:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:18:24,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:24,642 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] [2022-01-31 21:18:24,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 21:18:24,642 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:24,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1875815935, now seen corresponding path program 20 times [2022-01-31 21:18:24,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:24,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1131206123] [2022-01-31 21:18:24,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:24,694 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:24,695 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:24,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:24,698 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:18:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:24,713 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_51.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:18:24,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:24,957 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:26,909 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1131206123] [2022-01-31 21:18:26,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1131206123] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:26,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:26,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 21:18:26,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135151229] [2022-01-31 21:18:26,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:26,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 21:18:26,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:26,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 21:18:26,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:18:26,910 INFO L87 Difference]: Start difference. First operand 279 states and 367 transitions. Second operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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:18:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:32,946 INFO L93 Difference]: Finished difference Result 623 states and 946 transitions. [2022-01-31 21:18:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 21:18:32,946 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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 49 [2022-01-31 21:18:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:32,948 INFO L225 Difference]: With dead ends: 623 [2022-01-31 21:18:32,948 INFO L226 Difference]: Without dead ends: 590 [2022-01-31 21:18:32,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=783, Invalid=2877, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 21:18:32,948 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 218 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:32,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 63 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 21:18:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-01-31 21:18:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 296. [2022-01-31 21:18:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 291 states have internal predecessors, (387), 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:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 391 transitions. [2022-01-31 21:18:33,345 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 391 transitions. Word has length 49 [2022-01-31 21:18:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:33,345 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 391 transitions. [2022-01-31 21:18:33,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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:18:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 391 transitions. [2022-01-31 21:18:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:18:33,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:33,346 INFO L514 BasicCegarLoop]: trace histogram [16, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:33,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 21:18:33,346 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:33,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1639498097, now seen corresponding path program 21 times [2022-01-31 21:18:33,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:33,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1674940436] [2022-01-31 21:18:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:33,375 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:33,376 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:33,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:33,379 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:18:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:33,400 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:18:33,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:33,664 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:35,067 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:35,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1674940436] [2022-01-31 21:18:35,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1674940436] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:35,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:35,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 21:18:35,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416807265] [2022-01-31 21:18:35,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:35,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 21:18:35,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:35,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 21:18:35,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:18:35,068 INFO L87 Difference]: Start difference. First operand 296 states and 391 transitions. Second operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 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:18:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:42,010 INFO L93 Difference]: Finished difference Result 644 states and 973 transitions. [2022-01-31 21:18:42,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 21:18:42,010 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 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 50 [2022-01-31 21:18:42,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:42,012 INFO L225 Difference]: With dead ends: 644 [2022-01-31 21:18:42,012 INFO L226 Difference]: Without dead ends: 611 [2022-01-31 21:18:42,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=813, Invalid=3093, Unknown=0, NotChecked=0, Total=3906 [2022-01-31 21:18:42,012 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 254 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:42,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 71 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 21:18:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-01-31 21:18:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 312. [2022-01-31 21:18:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 307 states have (on average 1.3322475570032573) internal successors, (409), 307 states have internal predecessors, (409), 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,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 413 transitions. [2022-01-31 21:18:42,449 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 413 transitions. Word has length 50 [2022-01-31 21:18:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:42,449 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 413 transitions. [2022-01-31 21:18:42,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 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:18:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 413 transitions. [2022-01-31 21:18:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:18:42,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:42,450 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:18:42,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 21:18:42,450 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:42,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1540323473, now seen corresponding path program 25 times [2022-01-31 21:18:42,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:42,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1979705874] [2022-01-31 21:18:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:42,485 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,485 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:42,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:42,488 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:18:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:42,519 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:18:42,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:42,808 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,531 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:43,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1979705874] [2022-01-31 21:18:43,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1979705874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:43,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:43,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 21:18:43,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875472388] [2022-01-31 21:18:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:43,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 21:18:43,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:43,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 21:18:43,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:18:43,533 INFO L87 Difference]: Start difference. First operand 312 states and 413 transitions. Second operand has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:18:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:18:54,962 INFO L93 Difference]: Finished difference Result 733 states and 861 transitions. [2022-01-31 21:18:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-31 21:18:54,962 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-01-31 21:18:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:18:54,964 INFO L225 Difference]: With dead ends: 733 [2022-01-31 21:18:54,964 INFO L226 Difference]: Without dead ends: 695 [2022-01-31 21:18:54,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=429, Invalid=4263, Unknown=0, NotChecked=0, Total=4692 [2022-01-31 21:18:54,965 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 90 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:18:54,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 127 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-01-31 21:18:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-01-31 21:18:55,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 305. [2022-01-31 21:18:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 300 states have (on average 1.3633333333333333) internal successors, (409), 300 states have internal predecessors, (409), 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:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 413 transitions. [2022-01-31 21:18:55,419 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 413 transitions. Word has length 51 [2022-01-31 21:18:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:18:55,419 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 413 transitions. [2022-01-31 21:18:55,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:18:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 413 transitions. [2022-01-31 21:18:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:18:55,420 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:18:55,420 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] [2022-01-31 21:18:55,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 21:18:55,420 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:18:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:18:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1612016959, now seen corresponding path program 22 times [2022-01-31 21:18:55,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:18:55,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [338037129] [2022-01-31 21:18:55,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:18:55,449 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:55,449 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:18:55,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:18:55,452 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:18:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:55,478 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:18:55,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:18:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:18:55,693 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:56,435 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:18:56,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [338037129] [2022-01-31 21:18:56,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [338037129] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:18:56,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:18:56,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 21:18:56,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282532264] [2022-01-31 21:18:56,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:18:56,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 21:18:56,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:18:56,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 21:18:56,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:18:56,436 INFO L87 Difference]: Start difference. First operand 305 states and 413 transitions. Second operand has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 28 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:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:17,987 INFO L93 Difference]: Finished difference Result 785 states and 989 transitions. [2022-01-31 21:19:17,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-01-31 21:19:17,988 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 28 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 51 [2022-01-31 21:19:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:17,989 INFO L225 Difference]: With dead ends: 785 [2022-01-31 21:19:17,989 INFO L226 Difference]: Without dead ends: 780 [2022-01-31 21:19:17,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1724, Invalid=9832, Unknown=0, NotChecked=0, Total=11556 [2022-01-31 21:19:17,990 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 153 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:17,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 49 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-01-31 21:19:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-01-31 21:19:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 335. [2022-01-31 21:19:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 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:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 454 transitions. [2022-01-31 21:19:18,504 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 454 transitions. Word has length 51 [2022-01-31 21:19:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:18,505 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 454 transitions. [2022-01-31 21:19:18,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 28 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:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2022-01-31 21:19:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:19:18,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:18,505 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:19:18,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 21:19:18,506 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:18,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1152566108, now seen corresponding path program 26 times [2022-01-31 21:19:18,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:18,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242556958] [2022-01-31 21:19:18,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:18,549 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:18,550 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:18,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:18,553 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:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:18,581 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:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:18,769 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:19,675 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:19,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242556958] [2022-01-31 21:19:19,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [242556958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:19,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:19,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 21:19:19,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599945389] [2022-01-31 21:19:19,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:19,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 21:19:19,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:19,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 21:19:19,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:19:19,677 INFO L87 Difference]: Start difference. First operand 335 states and 454 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:19:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:25,121 INFO L93 Difference]: Finished difference Result 651 states and 786 transitions. [2022-01-31 21:19:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 21:19:25,121 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 52 [2022-01-31 21:19:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:25,122 INFO L225 Difference]: With dead ends: 651 [2022-01-31 21:19:25,123 INFO L226 Difference]: Without dead ends: 615 [2022-01-31 21:19:25,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=456, Invalid=2196, Unknown=0, NotChecked=0, Total=2652 [2022-01-31 21:19:25,123 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:25,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 21:19:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-01-31 21:19:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 310. [2022-01-31 21:19:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 305 states have (on average 1.340983606557377) internal successors, (409), 305 states have internal predecessors, (409), 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:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 413 transitions. [2022-01-31 21:19:25,583 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 413 transitions. Word has length 52 [2022-01-31 21:19:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:25,583 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 413 transitions. [2022-01-31 21:19:25,583 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:19:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 413 transitions. [2022-01-31 21:19:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:19:25,584 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:25,584 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] [2022-01-31 21:19:25,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 21:19:25,584 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:25,585 INFO L85 PathProgramCache]: Analyzing trace with hash 623870786, now seen corresponding path program 23 times [2022-01-31 21:19:25,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:25,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1964345040] [2022-01-31 21:19:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:25,616 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:25,616 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:25,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:25,619 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:19:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:25,647 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:19:25,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:25,936 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:27,430 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:27,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1964345040] [2022-01-31 21:19:27,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1964345040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:27,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:27,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:19:27,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104389247] [2022-01-31 21:19:27,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:27,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:19:27,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:27,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:19:27,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:19:27,431 INFO L87 Difference]: Start difference. First operand 310 states and 413 transitions. Second operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 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:19:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:19:50,223 INFO L93 Difference]: Finished difference Result 1020 states and 1256 transitions. [2022-01-31 21:19:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-31 21:19:50,224 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 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:19:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:19:50,226 INFO L225 Difference]: With dead ends: 1020 [2022-01-31 21:19:50,226 INFO L226 Difference]: Without dead ends: 744 [2022-01-31 21:19:50,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=524, Invalid=5956, Unknown=0, NotChecked=0, Total=6480 [2022-01-31 21:19:50,227 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 101 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:19:50,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 150 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-01-31 21:19:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-01-31 21:19:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 320. [2022-01-31 21:19:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.3174603174603174) internal successors, (415), 315 states have internal predecessors, (415), 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:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 419 transitions. [2022-01-31 21:19:50,708 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 419 transitions. Word has length 52 [2022-01-31 21:19:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:19:50,708 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 419 transitions. [2022-01-31 21:19:50,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 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:19:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 419 transitions. [2022-01-31 21:19:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:19:50,708 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:19:50,709 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] [2022-01-31 21:19:50,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 21:19:50,709 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:19:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:19:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1666153009, now seen corresponding path program 24 times [2022-01-31 21:19:50,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:19:50,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [828272642] [2022-01-31 21:19:50,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:19:50,736 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:50,736 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:19:50,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:19:50,739 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:19:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:50,769 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_57.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:19:51,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:19:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:19:51,055 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:54,149 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:19:54,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [828272642] [2022-01-31 21:19:54,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [828272642] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:19:54,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:19:54,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:19:54,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847887748] [2022-01-31 21:19:54,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:19:54,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:19:54,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:19:54,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:19:54,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:19:54,151 INFO L87 Difference]: Start difference. First operand 320 states and 419 transitions. Second operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 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:20:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:04,016 INFO L93 Difference]: Finished difference Result 727 states and 1103 transitions. [2022-01-31 21:20:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 21:20:04,016 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 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 53 [2022-01-31 21:20:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:04,018 INFO L225 Difference]: With dead ends: 727 [2022-01-31 21:20:04,018 INFO L226 Difference]: Without dead ends: 692 [2022-01-31 21:20:04,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=960, Invalid=3596, Unknown=0, NotChecked=0, Total=4556 [2022-01-31 21:20:04,018 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 243 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:04,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 66 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-01-31 21:20:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-01-31 21:20:04,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 338. [2022-01-31 21:20:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 333 states have (on average 1.3213213213213213) internal successors, (440), 333 states have internal predecessors, (440), 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:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 444 transitions. [2022-01-31 21:20:04,568 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 444 transitions. Word has length 53 [2022-01-31 21:20:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:04,569 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 444 transitions. [2022-01-31 21:20:04,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 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:20:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 444 transitions. [2022-01-31 21:20:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:20:04,569 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:04,569 INFO L514 BasicCegarLoop]: trace histogram [18, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:20:04,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 21:20:04,569 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:04,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1899867741, now seen corresponding path program 25 times [2022-01-31 21:20:04,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:04,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1071716962] [2022-01-31 21:20:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:04,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:20:04,608 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:04,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:04,611 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:20:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:04,630 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:20:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:04,963 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:07,569 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:07,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1071716962] [2022-01-31 21:20:07,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1071716962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:07,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:07,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:20:07,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865521460] [2022-01-31 21:20:07,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:07,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:20:07,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:07,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:20:07,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:20:07,570 INFO L87 Difference]: Start difference. First operand 338 states and 444 transitions. Second operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 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:20:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:20:18,280 INFO L93 Difference]: Finished difference Result 749 states and 1131 transitions. [2022-01-31 21:20:18,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 21:20:18,281 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 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:20:18,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:20:18,283 INFO L225 Difference]: With dead ends: 749 [2022-01-31 21:20:18,283 INFO L226 Difference]: Without dead ends: 714 [2022-01-31 21:20:18,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=993, Invalid=3837, Unknown=0, NotChecked=0, Total=4830 [2022-01-31 21:20:18,284 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 375 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:20:18,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 74 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1563 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-01-31 21:20:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-01-31 21:20:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 355. [2022-01-31 21:20:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.322857142857143) internal successors, (463), 350 states have internal predecessors, (463), 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:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 467 transitions. [2022-01-31 21:20:18,883 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 467 transitions. Word has length 54 [2022-01-31 21:20:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:20:18,883 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 467 transitions. [2022-01-31 21:20:18,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 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:20:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 467 transitions. [2022-01-31 21:20:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:20:18,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:20:18,884 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] [2022-01-31 21:20:18,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 21:20:18,884 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:20:18,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:20:18,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1311636561, now seen corresponding path program 26 times [2022-01-31 21:20:18,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:20:18,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369209491] [2022-01-31 21:20:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:20:18,915 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:18,915 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:20:18,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:20:18,918 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:20:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:18,953 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_59.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:20:19,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:20:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:20:19,245 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:20,298 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:20:20,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369209491] [2022-01-31 21:20:20,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1369209491] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:20:20,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:20:20,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:20:20,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001316059] [2022-01-31 21:20:20,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:20:20,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:20:20,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:20:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:20:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:20:20,299 INFO L87 Difference]: Start difference. First operand 355 states and 467 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 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:20:23,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:21:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:21:21,815 INFO L93 Difference]: Finished difference Result 2054 states and 2542 transitions. [2022-01-31 21:21:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2022-01-31 21:21:21,816 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 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:21:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:21:21,825 INFO L225 Difference]: With dead ends: 2054 [2022-01-31 21:21:21,826 INFO L226 Difference]: Without dead ends: 2048 [2022-01-31 21:21:21,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18635 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=7530, Invalid=39342, Unknown=0, NotChecked=0, Total=46872 [2022-01-31 21:21:21,828 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 351 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:21:21,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 63 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 18.5s Time] [2022-01-31 21:21:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-01-31 21:21:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 495. [2022-01-31 21:21:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.473469387755102) internal successors, (722), 490 states have internal predecessors, (722), 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:21:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 726 transitions. [2022-01-31 21:21:22,603 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 726 transitions. Word has length 55 [2022-01-31 21:21:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:21:22,603 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 726 transitions. [2022-01-31 21:21:22,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 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:21:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 726 transitions. [2022-01-31 21:21:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:21:22,604 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:21:22,604 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:21:22,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 21:21:22,604 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:21:22,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:21:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1945484158, now seen corresponding path program 27 times [2022-01-31 21:21:22,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:21:22,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [851584661] [2022-01-31 21:21:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:21:22,630 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:21:22,631 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:21:22,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:21:22,634 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:21:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:21:22,683 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_60.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:21:23,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:21:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:21:23,025 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:21:24,447 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:21:24,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [851584661] [2022-01-31 21:21:24,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [851584661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:21:24,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:21:24,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 21:21:24,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233832794] [2022-01-31 21:21:24,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:21:24,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 21:21:24,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:21:24,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 21:21:24,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:21:24,448 INFO L87 Difference]: Start difference. First operand 495 states and 726 transitions. Second operand has 32 states, 32 states have (on average 1.625) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:21:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:21:47,168 INFO L93 Difference]: Finished difference Result 1061 states and 1323 transitions. [2022-01-31 21:21:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-31 21:21:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 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:21:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:21:47,171 INFO L225 Difference]: With dead ends: 1061 [2022-01-31 21:21:47,171 INFO L226 Difference]: Without dead ends: 1019 [2022-01-31 21:21:47,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=508, Invalid=5344, Unknown=0, NotChecked=0, Total=5852 [2022-01-31 21:21:47,171 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 75 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:21:47,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 139 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-01-31 21:21:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2022-01-31 21:21:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 489. [2022-01-31 21:21:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 484 states have (on average 1.4979338842975207) internal successors, (725), 484 states have internal predecessors, (725), 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:21:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 729 transitions. [2022-01-31 21:21:47,961 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 729 transitions. Word has length 56 [2022-01-31 21:21:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:21:47,961 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 729 transitions. [2022-01-31 21:21:47,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:21:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 729 transitions. [2022-01-31 21:21:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:21:47,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:21:47,962 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:21:47,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 21:21:47,962 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:21:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:21:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1971532620, now seen corresponding path program 28 times [2022-01-31 21:21:47,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:21:47,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1612208047] [2022-01-31 21:21:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:21:48,002 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:21:48,003 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:21:48,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:21:48,012 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:21:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:21:48,058 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:21:48,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:21:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:21:48,360 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:21:49,694 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:21:49,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1612208047] [2022-01-31 21:21:49,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1612208047] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:21:49,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:21:49,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-31 21:21:49,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391047949] [2022-01-31 21:21:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:21:49,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 21:21:49,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:21:49,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 21:21:49,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:21:49,695 INFO L87 Difference]: Start difference. First operand 489 states and 729 transitions. Second operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 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:22:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:33,301 INFO L93 Difference]: Finished difference Result 1149 states and 1485 transitions. [2022-01-31 21:22:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-01-31 21:22:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 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:22:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:33,304 INFO L225 Difference]: With dead ends: 1149 [2022-01-31 21:22:33,304 INFO L226 Difference]: Without dead ends: 1144 [2022-01-31 21:22:33,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4732 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=2133, Invalid=12629, Unknown=0, NotChecked=0, Total=14762 [2022-01-31 21:22:33,305 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 95 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:33,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 94 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 17.6s Time] [2022-01-31 21:22:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2022-01-31 21:22:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 518. [2022-01-31 21:22:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 513 states have (on average 1.4717348927875245) internal successors, (755), 513 states have internal predecessors, (755), 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:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 759 transitions. [2022-01-31 21:22:34,223 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 759 transitions. Word has length 56 [2022-01-31 21:22:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:34,223 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 759 transitions. [2022-01-31 21:22:34,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 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:22:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 759 transitions. [2022-01-31 21:22:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 21:22:34,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:34,224 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] [2022-01-31 21:22:34,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 21:22:34,224 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1705835599, now seen corresponding path program 29 times [2022-01-31 21:22:34,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:34,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435461793] [2022-01-31 21:22:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:34,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:22:34,259 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:34,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:34,263 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:22:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:34,300 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_62.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:22:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:22:36,962 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:36,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435461793] [2022-01-31 21:22:36,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1435461793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:36,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:36,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-01-31 21:22:36,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445684581] [2022-01-31 21:22:36,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:36,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 21:22:36,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:36,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 21:22:36,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:22:36,964 INFO L87 Difference]: Start difference. First operand 518 states and 759 transitions. Second operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:22:51,038 INFO L93 Difference]: Finished difference Result 1066 states and 1327 transitions. [2022-01-31 21:22:51,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 21:22:51,038 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 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 57 [2022-01-31 21:22:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:22:51,041 INFO L225 Difference]: With dead ends: 1066 [2022-01-31 21:22:51,041 INFO L226 Difference]: Without dead ends: 1043 [2022-01-31 21:22:51,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=445, Invalid=3337, Unknown=0, NotChecked=0, Total=3782 [2022-01-31 21:22:51,041 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:22:51,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 83 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-01-31 21:22:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2022-01-31 21:22:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 518. [2022-01-31 21:22:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 513 states have (on average 1.469785575048733) internal successors, (754), 513 states have internal predecessors, (754), 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,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 758 transitions. [2022-01-31 21:22:51,943 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 758 transitions. Word has length 57 [2022-01-31 21:22:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:22:51,943 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 758 transitions. [2022-01-31 21:22:51,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:22:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 758 transitions. [2022-01-31 21:22:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 21:22:51,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:22:51,944 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] [2022-01-31 21:22:51,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-31 21:22:51,944 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:22:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:22:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2027371601, now seen corresponding path program 30 times [2022-01-31 21:22:51,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:22:51,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [427052636] [2022-01-31 21:22:51,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:22:51,974 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,974 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:22:51,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:22:51,977 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:22:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:52,029 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:22:52,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:22:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:22:52,379 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:55,677 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:22:55,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [427052636] [2022-01-31 21:22:55,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [427052636] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:22:55,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:22:55,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-31 21:22:55,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360710341] [2022-01-31 21:22:55,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:22:55,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 21:22:55,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:22:55,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 21:22:55,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:22:55,678 INFO L87 Difference]: Start difference. First operand 518 states and 758 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:23:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:37,348 INFO L93 Difference]: Finished difference Result 1694 states and 2202 transitions. [2022-01-31 21:23:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-31 21:23:37,348 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:23:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:37,351 INFO L225 Difference]: With dead ends: 1694 [2022-01-31 21:23:37,351 INFO L226 Difference]: Without dead ends: 1213 [2022-01-31 21:23:37,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1692 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=607, Invalid=7225, Unknown=0, NotChecked=0, Total=7832 [2022-01-31 21:23:37,352 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 76 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:37,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 164 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 17.7s Time] [2022-01-31 21:23:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-01-31 21:23:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 520. [2022-01-31 21:23:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 515 states have (on average 1.4427184466019418) internal successors, (743), 515 states have internal predecessors, (743), 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:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 747 transitions. [2022-01-31 21:23:38,273 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 747 transitions. Word has length 57 [2022-01-31 21:23:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:23:38,273 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 747 transitions. [2022-01-31 21:23:38,273 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:23:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 747 transitions. [2022-01-31 21:23:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:23:38,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:23:38,274 INFO L514 BasicCegarLoop]: trace histogram [19, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:23:38,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-31 21:23:38,274 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:23:38,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:23:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1918443774, now seen corresponding path program 31 times [2022-01-31 21:23:38,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:23:38,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1745368572] [2022-01-31 21:23:38,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:23:38,335 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:38,335 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:23:38,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:23:38,338 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:23:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:38,363 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:23:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:23:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:23:38,709 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:42,173 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:23:42,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1745368572] [2022-01-31 21:23:42,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1745368572] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:23:42,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:23:42,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-31 21:23:42,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703674305] [2022-01-31 21:23:42,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:23:42,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 21:23:42,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:23:42,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 21:23:42,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=810, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:23:42,174 INFO L87 Difference]: Start difference. First operand 520 states and 747 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:23:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:23:59,211 INFO L93 Difference]: Finished difference Result 1252 states and 2037 transitions. [2022-01-31 21:23:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-31 21:23:59,212 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 58 [2022-01-31 21:23:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:23:59,214 INFO L225 Difference]: With dead ends: 1252 [2022-01-31 21:23:59,215 INFO L226 Difference]: Without dead ends: 1204 [2022-01-31 21:23:59,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1155, Invalid=4395, Unknown=0, NotChecked=0, Total=5550 [2022-01-31 21:23:59,215 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 289 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:23:59,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 84 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-01-31 21:23:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2022-01-31 21:24:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 550. [2022-01-31 21:24:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4495412844036697) internal successors, (790), 545 states have internal predecessors, (790), 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:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 794 transitions. [2022-01-31 21:24:00,317 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 794 transitions. Word has length 58 [2022-01-31 21:24:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:24:00,317 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 794 transitions. [2022-01-31 21:24:00,317 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:24:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 794 transitions. [2022-01-31 21:24:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 21:24:00,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:24:00,318 INFO L514 BasicCegarLoop]: trace histogram [20, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:24:00,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-31 21:24:00,318 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:24:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:24:00,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1191090192, now seen corresponding path program 32 times [2022-01-31 21:24:00,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:24:00,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1410687377] [2022-01-31 21:24:00,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:24:00,355 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:00,355 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:24:00,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:24:00,359 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:24:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:00,383 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_65.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:24:00,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:24:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:00,753 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:05,807 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:05,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1410687377] [2022-01-31 21:24:05,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1410687377] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:05,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:05,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-01-31 21:24:05,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525891585] [2022-01-31 21:24:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:05,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 21:24:05,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:05,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 21:24:05,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=866, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:24:05,809 INFO L87 Difference]: Start difference. First operand 550 states and 794 transitions. Second operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:24:21,747 INFO L93 Difference]: Finished difference Result 1288 states and 2089 transitions. [2022-01-31 21:24:21,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-31 21:24:21,747 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-01-31 21:24:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:24:21,750 INFO L225 Difference]: With dead ends: 1288 [2022-01-31 21:24:21,750 INFO L226 Difference]: Without dead ends: 1240 [2022-01-31 21:24:21,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1191, Invalid=4661, Unknown=0, NotChecked=0, Total=5852 [2022-01-31 21:24:21,751 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 290 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:24:21,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 87 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-01-31 21:24:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2022-01-31 21:24:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 579. [2022-01-31 21:24:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 574 states have (on average 1.4547038327526132) internal successors, (835), 574 states have internal predecessors, (835), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 839 transitions. [2022-01-31 21:24:22,939 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 839 transitions. Word has length 59 [2022-01-31 21:24:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:24:22,939 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 839 transitions. [2022-01-31 21:24:22,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:24:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 839 transitions. [2022-01-31 21:24:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 21:24:22,940 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:24:22,940 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:24:22,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-01-31 21:24:22,941 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:24:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:24:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1569010494, now seen corresponding path program 33 times [2022-01-31 21:24:22,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:24:22,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [249895881] [2022-01-31 21:24:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:24:22,970 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:22,970 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:24:22,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:24:22,973 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:24:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:23,013 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:24:23,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:24:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:23,265 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:26,656 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:26,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [249895881] [2022-01-31 21:24:26,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [249895881] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:26,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:26,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 21:24:26,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899662138] [2022-01-31 21:24:26,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:26,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 21:24:26,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:26,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 21:24:26,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-01-31 21:24:26,657 INFO L87 Difference]: Start difference. First operand 579 states and 839 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:24:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:24:41,957 INFO L93 Difference]: Finished difference Result 1175 states and 1459 transitions. [2022-01-31 21:24:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 21:24:41,957 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 60 [2022-01-31 21:24:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:24:41,960 INFO L225 Difference]: With dead ends: 1175 [2022-01-31 21:24:41,960 INFO L226 Difference]: Without dead ends: 1133 [2022-01-31 21:24:41,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=730, Invalid=3692, Unknown=0, NotChecked=0, Total=4422 [2022-01-31 21:24:41,961 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:24:41,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 72 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-01-31 21:24:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-01-31 21:24:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 549. [2022-01-31 21:24:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 544 states have (on average 1.4448529411764706) internal successors, (786), 544 states have internal predecessors, (786), 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:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 790 transitions. [2022-01-31 21:24:43,056 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 790 transitions. Word has length 60 [2022-01-31 21:24:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:24:43,056 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 790 transitions. [2022-01-31 21:24:43,056 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:24:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 790 transitions. [2022-01-31 21:24:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 21:24:43,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:24:43,057 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:24:43,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-01-31 21:24:43,057 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:24:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:24:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1468572068, now seen corresponding path program 34 times [2022-01-31 21:24:43,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:24:43,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [956076074] [2022-01-31 21:24:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:24:43,084 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:43,084 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:24:43,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:24:43,087 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:24:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:43,134 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_67.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:24:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:24:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:24:43,496 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:45,860 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:24:45,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [956076074] [2022-01-31 21:24:45,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [956076074] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:24:45,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:24:45,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-31 21:24:45,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174677171] [2022-01-31 21:24:45,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:24:45,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 21:24:45,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:24:45,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 21:24:45,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 21:24:45,861 INFO L87 Difference]: Start difference. First operand 549 states and 790 transitions. Second operand has 36 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 35 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call 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:52,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:26:07,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:26:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:26:39,291 INFO L93 Difference]: Finished difference Result 2770 states and 3339 transitions. [2022-01-31 21:26:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2022-01-31 21:26:39,291 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 35 states have internal predecessors, (46), 2 states have call successors, (3), 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 60 [2022-01-31 21:26:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:26:39,297 INFO L225 Difference]: With dead ends: 2770 [2022-01-31 21:26:39,297 INFO L226 Difference]: Without dead ends: 2764 [2022-01-31 21:26:39,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28996 ImplicationChecksByTransitivity, 71.6s TimeCoverageRelationStatistics Valid=11909, Invalid=56997, Unknown=0, NotChecked=0, Total=68906 [2022-01-31 21:26:39,300 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 506 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:26:39,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [506 Valid, 48 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 35.4s Time] [2022-01-31 21:26:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2022-01-31 21:26:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 602. [2022-01-31 21:26:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 597 states have (on average 1.4673366834170853) internal successors, (876), 597 states have internal predecessors, (876), 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:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 880 transitions. [2022-01-31 21:26:40,535 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 880 transitions. Word has length 60 [2022-01-31 21:26:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:26:40,535 INFO L470 AbstractCegarLoop]: Abstraction has 602 states and 880 transitions. [2022-01-31 21:26:40,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 35 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call 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:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 880 transitions. [2022-01-31 21:26:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 21:26:40,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:26:40,536 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:26:40,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-01-31 21:26:40,536 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:26:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:26:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash -118573007, now seen corresponding path program 35 times [2022-01-31 21:26:40,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:26:40,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [116897232] [2022-01-31 21:26:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:26:40,612 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:40,612 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:26:40,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:26:40,615 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:26:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:40,661 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:26:41,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:26:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:26:41,009 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:43,928 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:26:43,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [116897232] [2022-01-31 21:26:43,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [116897232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:26:43,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:26:43,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-01-31 21:26:43,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405090776] [2022-01-31 21:26:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:26:43,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 21:26:43,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:26:43,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 21:26:43,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:26:43,929 INFO L87 Difference]: Start difference. First operand 602 states and 880 transitions. Second operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:27:27,381 INFO L93 Difference]: Finished difference Result 1405 states and 1727 transitions. [2022-01-31 21:27:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-31 21:27:27,382 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-01-31 21:27:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:27:27,384 INFO L225 Difference]: With dead ends: 1405 [2022-01-31 21:27:27,384 INFO L226 Difference]: Without dead ends: 1359 [2022-01-31 21:27:27,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=594, Invalid=6546, Unknown=0, NotChecked=0, Total=7140 [2022-01-31 21:27:27,385 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 98 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:27:27,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 151 Invalid, 2196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2022-01-31 21:27:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-01-31 21:27:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 595. [2022-01-31 21:27:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 590 states have (on average 1.4898305084745762) internal successors, (879), 590 states have internal predecessors, (879), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 883 transitions. [2022-01-31 21:27:28,637 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 883 transitions. Word has length 61 [2022-01-31 21:27:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:27:28,637 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 883 transitions. [2022-01-31 21:27:28,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:27:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 883 transitions. [2022-01-31 21:27:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 21:27:28,638 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:27:28,638 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:27:28,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-01-31 21:27:28,638 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:27:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:27:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 424147649, now seen corresponding path program 36 times [2022-01-31 21:27:28,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:27:28,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748981724] [2022-01-31 21:27:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:27:28,672 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:27:28,673 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:27:28,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:27:28,676 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_69.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:27:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:27:28,722 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_69.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:27:29,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:27:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:27:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:27:34,424 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:27:34,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748981724] [2022-01-31 21:27:34,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1748981724] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:27:34,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:27:34,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-31 21:27:34,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658086177] [2022-01-31 21:27:34,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:27:34,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-31 21:27:34,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:27:34,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-31 21:27:34,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 21:27:34,425 INFO L87 Difference]: Start difference. First operand 595 states and 883 transitions. Second operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:08,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 21:28:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:28:50,070 INFO L93 Difference]: Finished difference Result 1947 states and 2552 transitions. [2022-01-31 21:28:50,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-01-31 21:28:50,070 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-01-31 21:28:50,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:28:50,072 INFO L225 Difference]: With dead ends: 1947 [2022-01-31 21:28:50,072 INFO L226 Difference]: Without dead ends: 1392 [2022-01-31 21:28:50,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2095 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=704, Invalid=8802, Unknown=0, NotChecked=0, Total=9506 [2022-01-31 21:28:50,073 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 98 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:28:50,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 176 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 33.6s Time] [2022-01-31 21:28:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-01-31 21:28:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 596. [2022-01-31 21:28:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 591 states have (on average 1.4619289340101522) internal successors, (864), 591 states have internal predecessors, (864), 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:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 868 transitions. [2022-01-31 21:28:51,340 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 868 transitions. Word has length 61 [2022-01-31 21:28:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:28:51,340 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 868 transitions. [2022-01-31 21:28:51,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 21:28:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 868 transitions. [2022-01-31 21:28:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 21:28:51,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:28:51,341 INFO L514 BasicCegarLoop]: trace histogram [21, 11, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:28:51,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-01-31 21:28:51,342 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:28:51,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:28:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1390910447, now seen corresponding path program 37 times [2022-01-31 21:28:51,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:28:51,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [326660657] [2022-01-31 21:28:51,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:28:51,378 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:51,379 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:28:51,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:28:51,381 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_70.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:28:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:28:51,408 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_70.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 21:28:51,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:28:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:28:51,787 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:58,917 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:28:58,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [326660657] [2022-01-31 21:28:58,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [326660657] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:28:58,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:28:58,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-31 21:28:58,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211217154] [2022-01-31 21:28:58,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:28:58,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-31 21:28:58,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:28:58,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-31 21:28:58,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=962, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 21:28:58,918 INFO L87 Difference]: Start difference. First operand 596 states and 868 transitions. Second operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)